TY  - JOUR
ID  - digilib36227
UR  - http://doi.org/10.1142/S0219686718500282
IS  - 04
A1  - Savitri, H.
A1  - Kurniawati, Dwi Agustina
N2  - CV. Jogja Transport is a company that distribute cakes \Sari Roti" in Yogyakarta, Indonesia.
It has responsibility to distribute the cakes for every customer during the customers' time
windows. The distribution problem of CV. Jogja Transport belongs to Vehicle Routing Problem
with Time Window (VRPTW). This paper tries to solve the problem of CV. Jogja Transport by
proposing \cluster ¯rst route second" algorithm of simple heuristic method. Then the algorithm
is combined with sweep algorithm for clustering the customers and Mixed Integer Linear
Programming (MILP) to select the best route so that it can minimize the distance of each
cluster. The result indicate that implementation of sweep algorithm and MILP can reduce the
distances and the fuel up to 10.95% and the travel distance up to 2.60%.
Keywords: Optimization; vehicle routing problem; time windows; sweep algorithm; mixed
integer linear programming; cluster ¯rst route second; distribution
VL  - 17
TI  - Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows
AV  - restricted
EP  - 513
Y1  - 2018/01/02/
PB  - World Scientific Publishing Company
JF  - Journal of Advanced Manufacturing Systems
KW  - Optimization; vehicle routing problem; time windows; sweep algorithm; mixed
integer linear programming; cluster ¯rst route second; distribution
SN  - 0219-6867
SP  - 505
ER  -