relation: https://digilib.uin-suka.ac.id/id/eprint/36227/
title: Sweep Algorithm and Mixed Integer Linear Program for Vehicle Routing Problem with Time Windows
creator: Savitri, H.
creator: Kurniawati, Dwi Agustina
subject: Sains
description: 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
publisher: World Scientific Publishing Company
date: 2018-01-02
type: Article
type: PeerReviewed
format: archive
language: en
identifier: https://digilib.uin-suka.ac.id/id/eprint/36227/1/Dwi%20Agustina%20Kurniawati%20_%20SWEEP%20ALGORITHM%20AND%20MIXED%20INTEGER%20LINEAR%20PROGRAM%20FOR%20VEHICLE%20ROUTING%20PROBLEM%20WITH%20TIME%20WINDOWS.pdf
identifier:   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     
relation: http://doi.org/10.1142/S0219686718500282
relation: doi:10.1142/S0219686718500282