Solving the vehicle routing problem with simultaneous pickup and delivery and occasional drivers by simulated annealing

• Main Authors: YU, Vincent F., ALOINA, Grace, JODIAWAN, Panca, GUNAWAN, Aldy, HUANG, Tsung-Chi
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2021
• Subjects: Simultaneous pickup and delivery; occasional driver; simulated annealing vehicle routing problem; Artificial Intelligence and Robotics
• Online Access: https://ink.library.smu.edu.sg/sis_research/6689; https://ink.library.smu.edu.sg/context/sis_research/article/7692/viewcontent/IEEM21_A_0093_GraceAloina.pdf
• Institution: Singapore Management University

This research studies the vehicle routing problem with simultaneous pickup and delivery with an occasional driver (VRPSPDOD). VRPSPDOD is a new variant of the vehicle routing problems with simultaneous pickup and delivery (VRPSPD). Different from VRPSPD, in VRPSPDOD, occasional drivers are employed to work with regular vehicles to service customers’ pickup and delivery requests in order to minimize the total cost. We formulate a mixed integer linear programming model for VRPSPD and propose a heuristic algorithm based on simulated annealing (SA) to solve the problem. The results of comprehensive numerical experiments show that the proposed SA performs well in terms of solution quality and computational time.