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 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. The computational results for hypothetical data with 50% backhaul and mix time
windows are reported.

Creator(s)

• JOHAN OSCAR ONG
• SUPRAYOGI

Contributor(s)

-

Publisher

Universitas Kristen Petra; 2011

Language

English

Category

jou – Journal

Sub Category

-

Source

Jurnal Teknik Industri, Vol. 13, No. 1, Juni 2011, 1-10; Johan Oscar Ong (NA00404223), Suprayogi (NA00404224)

Subject(s)

-

File(s)

• jiunkpe-ns-jou-2011-na00404223-23765-vehicle_routing-resource1.pdf