Investigating the Vehicle Routing Problem with Simultaneous Pickup and Delivery in Multi-Product Distribution: An Optimization Approach

Irvanu Rahman (Industrial Engineering Department, Universitas Indonesia, Kampus Baru UI Depok, West Java. Indonesia 16424)
Komarudin Komarudin (Industrial Engineering Department, Universitas Indonesia, Kampus Baru UI Depok, West Java. Indonesia 16424)
Frans Samuel (Industrial Engineering Department, Universitas Indonesia, Kampus Baru UI Depok, West Java. Indonesia 16424)

International Journal of Supply Chain Management
Vol 9, No 3 (2020): International Journal of Supply Chain Management (IJSCM)

This study addresses a method to solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD), which carries multi-products in multiple compartments within a single-vehicle. The unique characteristics of the study is on the route determination of the vehicle from the depot to customers because not only does it consider the vehicle’s capacity but also the compartment capacity of each product as a limitation We calculate the set of instances using two customer grouping methods namely smallest maximum load (SML) and largest maximum load (LML). The solution obtained by the cheapest insertion method can be improved by the Tabu Search algorithm. Finally, the computational result is reported from the test instance.