Skip to main content
Presentation
A Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
in the Proceedings of the 10th international conference on Modelling, Optimization and Simulation (MOSIM’14), Nancy, France (2014)
  • L. Zhao
  • H. Xiao
  • L. Kerbache
  • Z. H. Hu
  • Soumia Ichoua, Embry-Riddle Aeronautical University
Abstract

The demand of distribution and reverse logistics is drastically increasing. In order to absorb customers and improve customer satisfaction degree, the logistical services for returned goods are increasingly important. The vehicle routing problem with simultaneous pick-ups and deliveries (VRPSPD) is one of the major operations problems in reverse logistics research. This paper proposed a variable neighborhood search (VNS) algorithm to solve the combinatorial optimization problem. A Genetic Algorithm for VRPSPD is also developed and used as a reference for performance comparison. The algorithm can also solve the vehicle routing problem with backhaul and mixed load (VRPBM). An extensive numerical experiment is performed on benchmark problem instances available in literature. It is found that VNS gives good results compared to the existing algorithms.

Keywords
  • Meta-heuristics,
  • Variable neighborhood search,
  • Genetic Algorithm,
  • Vehicle Routing,
  • simultaneous Pickup and Delivery,
  • Reverse Logistics
Publication Date
November, 2014
Citation Information
L. Zhao, H. Xiao, L. Kerbache, Z. H. Hu, et al.. "A Variable Neighborhood Search Algorithm for the Vehicle Routing Problem with Simultaneous Pickup and Delivery" in the Proceedings of the 10th international conference on Modelling, Optimization and Simulation (MOSIM’14), Nancy, France (2014)
Available at: http://works.bepress.com/soumia_ichoua/22/