Investigating the vehicle routing problem with simultaneous pickup and delivery for multi-product distribution: An optimization approach

This study addresses 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 lies on the determination of the vehicle route from the depot to customers because not only does it consider the vehicle's capacity but also the compartment capacity which also serves 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.