DOI: https://doi.org/10.9744/jti.13.1.1-10

Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

Johan Oscar Ong, Suprayogi .

Abstract


Transportation planning is one of the important components to increase efficiency and effectiveness in the supply chain system. Good planning will give a saving in total cost of the supply chain. This paper develops the new VRP variants’, VRP with backhauls, multiple trips, and time window (VRPBMTTW) along with its problem solving techniques by using Ant Colony Optimization (ACO) and Sequential Insertion as initial solution algorithm. ACO is modified by adding the decoding process in order to determine the number of vehicles, total duration time, and range of duration time regardless of checking capacity constraint and time window. This algorithm is tested by using set of random data and verified as well as analyzed its parameter changing’s. The computational results for hypothetical data with 50% backhaul and mix time windows are reported.

Keywords


Vehicle routing problem, vehicle routing problem with backhauls, multiple trips, time window, sequential insertion, ant colony optimization, ant system.

Full Text:

PDF


DOI: https://doi.org/10.9744/jti.13.1.1-10



Instructions for Preparing Papers for JTI.docx
Panduan untuk Menulis di JTI.docx

The Journal is published by The Institute of Research & Community Outreach - Petra Christian University. It available online supported by Directorate General of Higher Education - Ministry of National Education - Republic of Indonesia.

©All right reserved 2016.Jurnal Teknik Industri, ISSN: 1411-2485, e-ISSN: 2087-7439

shopify traffic stats
View My Stats