Publication Type
Conference Proceeding Article
Version
acceptedVersion
Publication Date
12-2022
Abstract
This paper addresses a new variant of Pickup and Delivery Problem with Time Windows (PDPTW) for enhancing customer satisfaction. In particular, a huge number of requests is served in the system, where each request includes a pickup node and several delivery nodes instead of a pair of pickup and delivery nodes. It is named Pickup and Multi-Delivery Problem with Time Windows (PMDPTW). A mixed-integer programming model is formulated with the objective of minimizing total travel costs. Computational experiments are conducted to test the correctness of the model with a newly generated benchmark based on the PDPTW benchmark instances. Results show that our proposed model is able to solve small-size instances. Alternative approaches for solving larger problems are proposed for future research.
Keywords
Pickup and multiple delivery problem, Time windows, Non-linear constraint, Mixed-integer programming
Discipline
Computer Sciences | Operations and Supply Chain Management
Research Areas
Intelligent Systems and Optimization
Publication
2022 IEEE International Conference on Industrial Engineering and Engineering Management IEEM: Kuala Lumpur, December 7-10: Proceedings
First Page
571
Last Page
575
ISBN
9781665486873
Identifier
10.1109/IEEM55944.2022.9989995
Publisher
IEEE
City or Country
Piscataway, NJ
Citation
ANH, Pham Tuan; GUNAWAN, Aldy; YU, Vincent F.; and CHAU, Tuan C..
Pickup and multi-delivery problem with time windows. (2022). 2022 IEEE International Conference on Industrial Engineering and Engineering Management IEEM: Kuala Lumpur, December 7-10: Proceedings. 571-575.
Available at: https://ink.library.smu.edu.sg/sis_research/7552
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.
Additional URL
https://doi.org/10.1109/IEEM55944.2022.9989995