This paper will address Vehicle Routing Problem with Time Windows (VRPTW) for single product. VRPTW is developed from its basic model called by Vehicle Routing Problem (VRP). VRP is utilized to determine route with minimum cost from depot to costumer which is spreading out of location with certain demand. In one way route must be end and start in depot. In one way route should not exceeded more than its vehicle capacity. This paper has two fold: first, modelling the algorithm of VRP with Time Windows constraint using Mixed Integer Linear Programming (MILP), and second development of Cross Entropy (CE) Algorithm to solve VRP. Algorithm will run with computational experiment Lingo 11 version for MILP and Matlab R201b for CE Algorithm. Then we will compare the result from computational experiment from both MILP and CE. Computational from CE results the initial solution almost the same from computational result for Exact Method (MILP).
展开▼
