Publication Type
Conference Paper
Version
submittedVersion
Publication Date
12-2021
Abstract
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.
Keywords
Simultaneous pickup and delivery, occasional driver, simulated annealing vehicle routing problem
Discipline
Artificial Intelligence and Robotics
Research Areas
Intelligent Systems and Optimization
Publication
Proceedings of the 28th IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2021), Virtual Conference, December 13-16
First Page
1
Last Page
1
Publisher
IEEE
City or Country
Virtual Conference
Citation
YU, Vincent F.; ALOINA, Grace; JODIAWAN, Panca; GUNAWAN, Aldy; and HUANG, Tsung-Chi.
Solving the vehicle routing problem with simultaneous pickup and delivery and occasional drivers by simulated annealing. (2021). Proceedings of the 28th IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2021), Virtual Conference, December 13-16. 1-1.
Available at: https://ink.library.smu.edu.sg/sis_research/6689
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Comments
Only abstract of the paper was submitted to the conference.