Vehicle Routing Problem with Backhaul, Multiple Trips and Time Window

Johan Oscar Ong (Faculty of Industrial Teknology, Industrial Engineering Department, Institut Teknologi Harapan Bangsa. Jl. Dipatiukur 80-84, Bandung 40132)
Suprayogi . (Faculty of Industrial Technology, Industrial Engineering Department, Bandung Institute of Technology, Jl. Ganesha 10, Bandung 40132)

Jurnal Teknik Industri: Jurnal Keilmuan dan Aplikasi Teknik Industri
Vol. 13 No. 1 (2011): JUNE 2011

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.