Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows

Savitri, H. and Kurniawati, Dwi Agustina (2018) Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows. Journal of Advanced Manufacturing Systems, 17 (04). pp. 505-513. ISSN 0219-6867

Archive Dwi Agustina Kurniawati _ SWEEP ALGORITHM AND MIXED INTEGER LINEAR PROGRAM FOR VEHICLE ROUTING PROBLEM WITH TIME WINDOWS.pdf - Other Restricted to Registered users only Download (634kB)

Abstract

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

Share this knowledge with your friends :

Actions (login required)

View Item