IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i23p3664-d1527300.html
   My bibliography  Save this article

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

Author

Listed:
  • 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
    Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 204, Taiwan
    Department of Industrial Engineering and Management, Ming Chi University of Technology, New Taipei 243, Taiwan)

  • Kuan-Fu Chen

    (Department of Emergency Medicine, Keelung Chang Gung Memorial Hospital, Keelung 204, Taiwan
    College of Intelligent Computing, Chang Gung University, Taoyuan 333, Taiwan)

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.

Suggested Citation

  • Vincent F. Yu & Ching-Hsuan Lin & Renan S. Maglasang & Shih-Wei Lin & Kuan-Fu Chen, 2024. "An Efficient Simulated Annealing Algorithm for the Vehicle Routing Problem in Omnichannel Distribution," Mathematics, MDPI, vol. 12(23), pages 1-18, November.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3664-:d:1527300
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/23/3664/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/23/3664/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:23:p:3664-:d:1527300. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.