An Efficient Simulated Annealing Algorithm for the Vehicle Routing Problem in Omnichannel Distribution

Vincent F. Yu, Ching-Hsuan Lin, Renan S. Maglasang, Shih-Wei Lin () and Kuan-Fu Chen
Additional contact information
Vincent F. Yu: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan
Ching-Hsuan Lin: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan
Renan S. Maglasang: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 106, Taiwan
Shih-Wei Lin: Department of Information Management, Chang Gung University, Taoyuan 333, Taiwan
Kuan-Fu Chen: Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 204, Taiwan

Mathematics, 2024, vol. 12, issue 23, 1-18

Abstract: A variant of the vehicle routing problem (VRP) known as the Vehicle Routing Problem in Omnichannel Retailing Distribution Systems (VRPO) has recently been introduced in the literature, driven by the increasing adoption of omnichannel logistics in practice. The VRPO scenario involves a large retailer managing several stores, a depot, and a homogenous fleet of vehicles to meet the demands of both stores and online customers. This variant falls within the class of VRPs that consider precedence constraints. Although the vehicle routing problem in omnichannel retailing distribution (VRPO) has been addressed using a few heuristic and metaheuristic approaches, the use of Simulated Annealing (SA) remains largely unexplored in the pickup and delivery problem (PDP) literature, both before and after the rise of omnichannel logistics. This article introduces the Efficient Simulated Annealing (ESA) algorithm, demonstrating its suitability in generating new benchmark solutions for the VRPO. In experiments with sixty large instances, ESA significantly outperformed two previous algorithms, discovering new best-known solutions (BKSs) in fifty-nine out of sixty cases. Additionally, ESA demonstrated superior efficiency in 68.3% of the test cases in terms of reduced computational times, showcasing its higher effectiveness in handling complex VRPO instances.

Keywords: vehicle routing problem; pickup and delivery; simulated annealing; metaheuristics; omnichannel distribution (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/23/3664/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/23/3664/ (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:12:y:2024:i:23:p:3664-:d:1527300

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 ().