IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v308y2022i1d10.1007_s10479-020-03625-5.html
   My bibliography  Save this article

Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers

Author

Listed:
  • Abbas Tarhini

    (Lebanese American University)

  • Kassem Danach

    (Islamic University of Lebanon)

  • Antoine Harfouche

    (Université Paris Nanterre)

Abstract

The vehicle routing problem (VRP) is a combinatorial optimization management problem that seeks the optimal set of routes traversed by a vehicle to deliver products to customers. A recognized problem in this domain is to serve ‘prioritized’ customers in the shortest possible time where customers with known demands are supplied by one or several depots. This problem is known as the Vehicle Routing with Prioritized Customers (VRPC). The purpose of this work is to present and compare two artificial intelligence-based novel methods that minimize the traveling distance of vehicles when moving cargo to prioritized customers. Various studies have been conducted regarding this topic; nevertheless, up to now, few studies used the Cuckoo Search-based hyper-heuristic. This paper modifies a classical mathematical model that represents the VRPC, implements and tests an evolutionary Cuckoo Search-based hyper-heuristic, and then compares the results with those of our proposed modified version of the Clarke Wright (CW) algorithm. In this modified version, the CW algorithm serves all customers per their preassigned priorities while covering the needed working hours. The results indicate that the solution selected by the Cuckoo Search-based hyper-heuristic outperformed the modified Clarke Wright algorithm while taking into consideration the customers’ priority and demands and the vehicle capacity.

Suggested Citation

  • Abbas Tarhini & Kassem Danach & Antoine Harfouche, 2022. "Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers," Annals of Operations Research, Springer, vol. 308(1), pages 549-570, January.
    • Handle: RePEc:spr:annopr:v:308:y:2022:i:1:d:10.1007_s10479-020-03625-5
    DOI: 10.1007/s10479-020-03625-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03625-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03625-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Xianlong Ge & Ziqiang Zhu & Yuanzhi Jin, 2020. "Electric Vehicle Routing Problems with Stochastic Demands and Dynamic Remedial Measures," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-15, August.
    2. Jean-François Côté & Michel Gendreau & Jean-Yves Potvin, 2020. "The Vehicle Routing Problem with Stochastic Two-Dimensional Items," Transportation Science, INFORMS, vol. 54(2), pages 453-469, March.
    3. Fink, Martin & Desaulniers, Guy & Frey, Markus & Kiermaier, Ferdinand & Kolisch, Rainer & Soumis, François, 2019. "Column generation for vehicle routing problems with multiple synchronization constraints," European Journal of Operational Research, Elsevier, vol. 272(2), pages 699-711.
    4. Edmund K Burke & Michel Gendreau & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & Rong Qu, 2013. "Hyper-heuristics: a survey of the state of the art," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(12), pages 1695-1724, December.
    5. Szeto, W.Y. & Wu, Yongzhong & Ho, Sin C., 2011. "An artificial bee colony algorithm for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 215(1), pages 126-135, November.
    6. Zhen, Lu, 2016. "Modeling of yard congestion and optimization of yard template in container ports," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 83-104.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    8. Jin, Jianyong & Crainic, Teodor Gabriel & Løkketangen, Arne, 2012. "A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 222(3), pages 441-451.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Guy Assaker & Wassim Shahin, 2022. "What Drives Faculty Publication Citations in the Business Field? Empirical Results from an AACSB Middle Eastern Institution," Publications, MDPI, vol. 10(4), pages 1-29, November.

    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. Aderemi Oluyinka Adewumi & Olawale Joshua Adeleke, 2018. "A survey of recent advances in vehicle routing problems," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(1), pages 155-172, February.
    2. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    3. Cherkesly, Marilène & Gschwind, Timo, 2022. "The pickup and delivery problem with time windows, multiple stacks, and handling operations," European Journal of Operational Research, Elsevier, vol. 301(2), pages 647-666.
    4. Abdulkader, M.M.S. & Gajpal, Yuvraj & ElMekkawy, Tarek Y., 2018. "Vehicle routing problem in omni-channel retailing distribution systems," International Journal of Production Economics, Elsevier, vol. 196(C), pages 43-55.
    5. Hemmelmayr, Vera C., 2015. "Sequential and parallel large neighborhood search algorithms for the periodic location routing problem," European Journal of Operational Research, Elsevier, vol. 243(1), pages 52-60.
    6. Ahmed Kheiri & Alina G. Dragomir & David Mueller & Joaquim Gromicho & Caroline Jagtenberg & Jelke J. Hoorn, 2019. "Tackling a VRP challenge to redistribute scarce equipment within time windows using metaheuristic algorithms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 561-595, December.
    7. Zhang, Xiangyi & Chen, Lu & Gendreau, Michel & Langevin, André, 2022. "A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 302(1), pages 259-269.
    8. Ji, Bin & Zhang, Zheng & Yu, Samson S. & Zhou, Saiqi & Wu, Guohua, 2023. "Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1219-1235.
    9. Phan Nguyen Ky Phuc & Nguyen Le Phuong Thao, 2021. "Ant Colony Optimization for Multiple Pickup and Multiple Delivery Vehicle Routing Problem with Time Window and Heterogeneous Fleets," Logistics, MDPI, vol. 5(2), pages 1-13, May.
    10. Liyang Xiao & Mahjoub Dridi & Amir Hajjam El Hassani & Hongying Fei & Wanlong Lin, 2018. "An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions," Sustainability, MDPI, vol. 10(3), pages 1-19, March.
    11. Zheng Zhang & Bin Ji & Samson S. Yu, 2023. "An Adaptive Tabu Search Algorithm for Solving the Two-Dimensional Loading Constrained Vehicle Routing Problem with Stochastic Customers," Sustainability, MDPI, vol. 15(2), pages 1-23, January.
    12. Chen, Yujie & Cowling, Peter & Polack, Fiona & Remde, Stephen & Mourdjis, Philip, 2017. "Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system," European Journal of Operational Research, Elsevier, vol. 257(2), pages 494-510.
    13. Gong, Manlin & Hu, Yucong & Chen, Zhiwei & Li, Xiaopeng, 2021. "Transfer-based customized modular bus system design with passenger-route assignment optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    14. Smith, John Paul, 1974. "A Lockset analysis of farm to plant milk assembly," ISU General Staff Papers 1974010108000018144, Iowa State University, Department of Economics.
    15. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    16. Jumbo, Olga & Moghaddass, Ramin, 2022. "Resource optimization and image processing for vegetation management programs in power distribution networks," Applied Energy, Elsevier, vol. 319(C).
    17. Derya Deliktaş, 2022. "Self-adaptive memetic algorithms for multi-objective single machine learning-effect scheduling problems with release times," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 748-784, September.
    18. Martins, Sara & Ostermeier, Manuel & Amorim, Pedro & Hübner, Alexander & Almada-Lobo, Bernardo, 2019. "Product-oriented time window assignment for a multi-compartment vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 276(3), pages 893-909.
    19. Zi-bin Jiang & Qiong Yang, 2016. "A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem," PLOS ONE, Public Library of Science, vol. 11(11), pages 1-15, November.
    20. A. Scholz & G. Wäscher, 2017. "Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(2), pages 491-520, June.

    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:spr:annopr:v:308:y:2022:i:1:d:10.1007_s10479-020-03625-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.