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

A Hybrid Adaptive Simulated Annealing and Tempering Algorithm for Solving the Half-Open Multi-Depot Vehicle Routing Problem

Author

Listed:
  • Shichang Xiao

    (Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China)

  • Pan Peng

    (Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China)

  • Peng Zheng

    (Logistics Engineering College, Shanghai Maritime University, Shanghai 201306, China)

  • Zigao Wu

    (Department of Mechanical Engineering, North China Electric Power University, Baoding 071003, China)

Abstract

The half-open multi-depot vehicle routing problem (HOMDVRP) is a typical decision optimization problem in the field of collaborative logistics that considers resource sharing. This study aims to develop an effective meta-heuristic algorithm for solving the HOMDVRP. Firstly, a mixed-integer programming model of HOMDVRP is established to minimize the total travel distance of the vehicles. After that, a novel hybrid adaptive simulated annealing and tempering algorithm (HASATA) is proposed based on the features of HOMDVRP. The proposed algorithm combines the strengths of the simulated annealing algorithm and the large-neighborhood search algorithm to balance the algorithm’s searching capabilities in both breadth and depth. Meanwhile, an adaptive Markov chain length mechanism and a tempering mechanism are designed to improve the algorithm’s computational efficiency and convergence ability. Finally, simulation experiments are conducted to verify the effectiveness of the proposed model and the computational performance of the proposed algorithm. Four comparison algorithms are selected and analyzed using 24 groups of problem instances. The comparison results show that the proposed HASATA can solve the HOMDVRP more efficiently and obtain a solution with better optimization performance and satisfactory stability.

Suggested Citation

  • Shichang Xiao & Pan Peng & Peng Zheng & Zigao Wu, 2024. "A Hybrid Adaptive Simulated Annealing and Tempering Algorithm for Solving the Half-Open Multi-Depot Vehicle Routing Problem," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:947-:d:1362332
    as

    Download full text from publisher

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

    References listed on IDEAS

    as
    1. William Ferrell & Kimberly Ellis & Phil Kaminsky & Chase Rainwater, 2020. "Horizontal collaboration: opportunities for improved logistics planning," International Journal of Production Research, Taylor & Francis Journals, vol. 58(14), pages 4267-4284, July.
    2. Masmoudi, Mohamed Amine & Hosny, Manar & Braekers, Kris & Dammak, Abdelaziz, 2016. "Three effective metaheuristics to solve the multi-depot multi-trip heterogeneous dial-a-ride problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 96(C), pages 60-80.
    3. Gansterer, Margaretha & Hartl, Richard F., 2018. "Collaborative vehicle routing: A survey," European Journal of Operational Research, Elsevier, vol. 268(1), pages 1-12.
    4. Wang, Junwei & Yu, Yang & Tang, Jiafu, 2018. "Compensation and profit distribution for cooperative green pickup and delivery problem," Transportation Research Part B: Methodological, Elsevier, vol. 113(C), pages 54-69.
    5. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    6. Hongqiang Fan & Yichen Sun & Lifen Yun & Runfeng Yu, 2023. "A Joint Distribution Pricing Model of Express Enterprises Based on Dynamic Game Theory," Mathematics, MDPI, vol. 11(19), pages 1-17, September.
    7. Xue Bai & Ning Ma & Kwai-Sang Chin, 2022. "Hybrid Heuristic for the Multi-Depot Static Bike Rebalancing and Collection Problem," Mathematics, MDPI, vol. 10(23), pages 1-28, December.
    8. Braekers, Kris & Caris, An & Janssens, Gerrit K., 2014. "Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 166-186.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    2. Molenbruch, Yves & Braekers, Kris & Caris, An, 2017. "Benefits of horizontal cooperation in dial-a-ride services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 107(C), pages 97-119.
    3. Masmoudi, Mohamed Amine & Hosny, Manar & Demir, Emrah & Genikomsakis, Konstantinos N. & Cheikhrouhou, Naoufel, 2018. "The dial-a-ride problem with electric vehicles and battery swapping stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 392-420.
    4. Wang, Yuan & Lei, Linfei & Zhang, Dongxiang & Lee, Loo Hay, 2020. "Towards delivery-as-a-service: Effective neighborhood search strategies for integrated delivery optimization of E-commerce and static O2O parcels," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 38-63.
    5. Ertan Yakıcı & Robert F. Dell & Travis Hartman & Connor McLemore, 2018. "Daily aircraft routing for amphibious ready groups," Annals of Operations Research, Springer, vol. 264(1), pages 477-498, May.
    6. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    7. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    8. Bongiovanni, Claudia & Kaspi, Mor & Cordeau, Jean-François & Geroliminis, Nikolas, 2022. "A machine learning-driven two-phase metaheuristic for autonomous ridesharing operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    9. Justiani Sally & Wibowo Budhi S., 2022. "The Economic and Environmental Benefits of Collaborative Pick-Up in Urban Delivery Systems," LOGI – Scientific Journal on Transport and Logistics, Sciendo, vol. 13(1), pages 245-256, January.
    10. De Moor, Bram J. & Creemers, Stefan & Boute, Robert N., 2023. "Breaking truck dominance in supply chains: Proactive freight consolidation and modal split transport," International Journal of Production Economics, Elsevier, vol. 257(C).
    11. Timo Gschwind & Michael Drexl, 2016. "Adaptive Large Neighborhood Search with a Constant-Time Feasibility Test for the Dial-a-Ride Problem," Working Papers 1624, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. Zhang, Ruijuan & Dai, Ying & Yang, Fei & Ma, Zujun, 2024. "A cooperative vehicle routing problem with delivery options for simultaneous pickup and delivery services in rural areas," Socio-Economic Planning Sciences, Elsevier, vol. 93(C).
    13. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    14. Arjun Paul & Ravi Shankar Kumar & Chayanika Rout & Adrijit Goswami, 2021. "A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint," OPSEARCH, Springer;Operational Research Society of India, vol. 58(4), pages 962-993, December.
    15. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    16. Soriano, Adria & Gansterer, Margaretha & Hartl, Richard F., 2023. "The multi-depot vehicle routing problem with profit fairness," International Journal of Production Economics, Elsevier, vol. 255(C).
    17. Ma, Tai-Yu & Fang, Yumeng & Connors, Richard D. & Viti, Francesco & Nakao, Haruko, 2024. "A hybrid metaheuristic to optimize electric first-mile feeder services with charging synchronization constraints and customer rejections," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    18. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    19. Shejun Deng & Yingying Yuan & Yong Wang & Haizhong Wang & Charles Koll, 2020. "Collaborative multicenter logistics delivery network optimization with resource sharing," PLOS ONE, Public Library of Science, vol. 15(11), pages 1-31, November.
    20. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.

    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:7:p:947-:d:1362332. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.