Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window
DOI:
https://doi.org/10.9744/jti.13.1.1-10Keywords:
Vehicle routing problem, vehicle routing problem with backhauls, multiple trips, time window, sequential insertion, ant colony optimization, ant system.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.Downloads
Download data is not yet available.
Downloads
Published
2011-06-11
How to Cite
[1]
J. O. Ong and S. ., “Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window”, Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri, vol. 13, no. 1, pp. 1–10, Jun. 2011.
Issue
Section
Articles
License
Articles published in the Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri will be Open-Access articles distributed under the terms and conditions of the Creative Commons Attribution License (CC BY).
This work is licensed under a Creative Commons Attribution License (CC BY).
