An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. (May 2015)

• Record Type: Journal Article
• Authors: Avci, Mustafa; Topaloglu, Seyda
• Is Part Of: Computers & industrial engineering. Volume 83(2015)
• Page Start: 15
• Page End: 29
• Publication Date: 2015-05
• Subjects: Local search -- Vehicle routing problem with simultaneous pickup and delivery -- Reverse logistics; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2015.02.002
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Vehicle routing problem with simultaneous and mixed pickups and deliveries have been addressed. An adaptive local search algorithm is proposed to solve the problems. The proposed approach generates high-quality solutions to the benchmark instances in reasonable computation time. Abstract: The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing Problem with Mixed Pickup and Delivery (VRPMPD) differs from the VRPSPD in that the customers may have either pickup or delivery demand. However, the solution approaches proposed for the VRPSPD can be directly applied to the VRPMPD. In this study, an adaptive local search solution approach is developed for both the VRPSPD and the VRPMPD, which hybridizes a Simulated Annealing inspired algorithm with Variable Neighborhood Descent. The algorithm uses an adaptive threshold function that makes the algorithm self-tuning. The proposed approach is tested on well-known VRPSPD and VRPMPD benchmark instances derived from the literature. The computational results indicate that the proposed algorithm is effective in solving the problems in reasonable computation time.