The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers

Vincent F. Yu, Hadi Susanto, Yu-Hsuan Yeh, Shih-Wei Lin and Yu-Tsung Huang
Additional contact information
Vincent F. Yu: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
Hadi Susanto: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
Yu-Hsuan Yeh: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106335, Taiwan
Shih-Wei Lin: Department of Information Management, Chang Gung University, Taoyuan 33302, Taiwan
Yu-Tsung Huang: Kerry TJ Logistics Company Ltd., Taipei 10059, Taiwan

Mathematics, 2022, vol. 10, issue 6, 1-22

Abstract: Customers’ expectations of timely and accurate delivery and pickup of online purchases pose a new challenge to last-mile delivery. When the goods sent to customers are not received, they must be returned to the warehouse. This situation provides a high additional cost. Parcel locker systems and convenience stores have been launched to solve this problem and serve as pickup and payment stations. This research investigates a new last-mile distribution problem in the augmented system with three service modes: home delivery and pickup, parcel locker delivery and pickup, and home or parcel locker delivery and pickup. Previously, the simultaneous delivery and pickup problem with time windows (SDPPTW) only considered delivery and pickup to customers. The new problem proposed in this research addresses additional locker pickup and delivery options. The proposed problem is called the vehicle routing problem with simultaneous pickup and delivery and parcel lockers (VRPSPDPL). This research formulated a new mathematical model and developed two simulated annealing (SA) algorithms to solve the problem. The goal is to minimize the total traveling cost. Since there are no existing benchmark instances for the problem, we generate new instances based on SDPPTW benchmark instances. The experimental results show that the proposed algorithms are effective and efficient in solving VRPSPDPL.

Keywords: parcel locker; vehicle routing problem; simultaneous pickup and delivery; time windows; simulated annealing (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/6/920/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/6/920/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:6:p:920-:d:770261

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().