IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v21y2021i2d10.1007_s12351-019-00480-6.html
   My bibliography  Save this article

A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery

Author

Listed:
  • Yanwei Zhao

    (Zhejiang University of Technology)

  • Longlong Leng

    (Zhejiang University of Technology)

  • Chunmiao Zhang

    (Zhejiang University of Technology
    Jiaxing Vocational and Technical College)

Abstract

This paper addresses a new variant of location-routing problem (LRP), namely the LRP with simultaneous pickup and delivery (LRPSPD). A hyper-heuristic approach based on iterated local search (ILS-HH) is introduced to automatically optimize the LRPSPD. On basis of the novel proposed framework of hyper-heuristic, four selections mechanisms and five activation strategies are developed to examine the performance of the proposed framework. Three types computational evaluations were carried out and several conclusions can be drawn: (1) the proposed framework performs better than the classical one with performing several heavy-duty combinations of strategies in terms of solution quality and computing time; (2) different activated strategies have slight (not significant) effect on exploiting best solutions; (3) FRR-MAB-TS (fitness ratio rank based on multi-armed bandit with tabu search) works best among all selection methods. Moreover, the proposed approach could provide competitive, even better results compared to fine-tuned bespoke state-of-the-art approaches.

Suggested Citation

  • Yanwei Zhao & Longlong Leng & Chunmiao Zhang, 2021. "A novel framework of hyper-heuristic approach and its application in location-routing problem with simultaneous pickup and delivery," Operational Research, Springer, vol. 21(2), pages 1299-1332, June.
    • Handle: RePEc:spr:operea:v:21:y:2021:i:2:d:10.1007_s12351-019-00480-6
    DOI: 10.1007/s12351-019-00480-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-019-00480-6
    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/s12351-019-00480-6?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. Madsen, Oli B. G., 1983. "Methods for solving combined two level location-routing problems of realistic dimensions," European Journal of Operational Research, Elsevier, vol. 12(3), pages 295-301, March.
    2. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    3. Wasner, Michael & Zapfel, Gunther, 2004. "An integrated multi-depot hub-location vehicle routing model for network planning of parcel service," International Journal of Production Economics, Elsevier, vol. 90(3), pages 403-419, August.
    4. Christian Prins & Caroline Prodhon & Angel Ruiz & Patrick Soriano & Roberto Wolfler Calvo, 2007. "Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic," Transportation Science, INFORMS, vol. 41(4), pages 470-483, November.
    5. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    6. H Yildiz & M P Johnson & S Roehrig, 2013. "Planning for meals-on-wheels: algorithms and application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(10), pages 1540-1550, October.
    7. Burke, Edmund K. & McCollum, Barry & Meisels, Amnon & Petrovic, Sanja & Qu, Rong, 2007. "A graph-based hyper-heuristic for educational timetabling problems," European Journal of Operational Research, Elsevier, vol. 176(1), pages 177-192, January.
    8. S Salhi & G Nagy, 1999. "A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(10), pages 1034-1042, October.
    9. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    10. Ting, Ching-Jung & Chen, Chia-Ho, 2013. "A multiple ant colony optimization algorithm for the capacitated location routing problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 34-44.
    11. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    12. 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.
    13. Roberto Baldacci & Aristide Mingozzi & Roberto Wolfler Calvo, 2011. "An Exact Method for the Capacitated Location-Routing Problem," Operations Research, INFORMS, vol. 59(5), pages 1284-1296, October.
    14. Barreto, Sergio & Ferreira, Carlos & Paixao, Jose & Santos, Beatriz Sousa, 2007. "Using clustering analysis in a capacitated location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 968-977, June.
    15. Jacobsen, S. K. & Madsen, O. B. G., 1980. "A comparative study of heuristics for a two-level routing-location problem," European Journal of Operational Research, Elsevier, vol. 5(6), pages 378-387, December.
    16. Vincent F. Yu & Shin-Yu Lin, 2016. "Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 526-549, January.
    17. 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.
    18. S. Lin & B. W. Kernighan, 1973. "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research, INFORMS, vol. 21(2), pages 498-516, April.
    19. Edmund K. Burke & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & John R. Woodward, 2010. "A Classification of Hyper-heuristic Approaches," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 449-468, Springer.
    20. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    21. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    22. Claudio Contardo & Jean-François Cordeau & Bernard Gendron, 2014. "An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem," INFORMS Journal on Computing, INFORMS, vol. 26(1), pages 88-102, February.
    23. Fatih Rahim & Canan Sepil, 2014. "A location-routing problem in glass recycling," Annals of Operations Research, Springer, vol. 223(1), pages 329-353, December.
    24. G. Nagy & S. Salhi, 1998. "The many-to-many location-routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 6(2), pages 261-275, December.
    25. Tuzun, Dilek & Burke, Laura I., 1999. "A two-phase tabu search approach to the location routing problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 87-99, July.
    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. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    2. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    3. Michael Schneider & Michael Drexl, 2017. "A survey of the standard location-routing problem," Annals of Operations Research, Springer, vol. 259(1), pages 389-414, December.
    4. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    5. Rieck, Julia & Ehrenberg, Carsten & Zimmermann, Jürgen, 2014. "Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery," European Journal of Operational Research, Elsevier, vol. 236(3), pages 863-878.
    6. Paolo Gianessi & Laurent Alfandari & Lucas Létocart & Roberto Wolfler Calvo, 2016. "The Multicommodity-Ring Location Routing Problem," Transportation Science, INFORMS, vol. 50(2), pages 541-558, May.
    7. Younes Rahmani & Wahiba Ramdane Cherif-Khettaf & Ammar Oulamara, 2016. "The two-echelon multi-products location-routing problem with pickup and delivery: formulation and heuristic approaches," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 999-1019, February.
    8. Bagheri Hosseini, Mozhde & Dehghanian, Farzad & Salari, Majid, 2019. "Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network," European Journal of Operational Research, Elsevier, vol. 272(2), pages 655-673.
    9. Alvarez, Jose A. Lopez & Buijs, Paul & Deluster, Rogier & Coelho, Leandro C. & Ursavas, Evrim, 2020. "Strategic and operational decision-making in expanding supply chains for LNG as a fuel," Omega, Elsevier, vol. 97(C).
    10. Daniel Negrotto & Irene Loiseau, 2021. "A Branch & Cut algorithm for the prize-collecting capacitated location routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(1), pages 34-57, April.
    11. Nasrin Asgari & Mohsen Rajabi & Masoumeh Jamshidi & Maryam Khatami & Reza Zanjirani Farahani, 2017. "A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study," Annals of Operations Research, Springer, vol. 250(2), pages 279-308, March.
    12. Zhu, Stuart X. & Ursavas, Evrim, 2018. "Design and analysis of a satellite network with direct delivery in the pharmaceutical industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 190-207.
    13. Vincent F. Yu & Shin-Yu Lin, 2016. "Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing," International Journal of Production Research, Taylor & Francis Journals, vol. 54(2), pages 526-549, January.
    14. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    15. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    16. Menezes, Mozart B.C. & Ruiz-Hernández, Diego & Verter, Vedat, 2016. "A rough-cut approach for evaluating location-routing decisions via approximation algorithms," Transportation Research Part B: Methodological, Elsevier, vol. 87(C), pages 89-106.
    17. Lin Zhou & Xu Wang & Lin Ni & Yun Lin, 2016. "Location-Routing Problem with Simultaneous Home Delivery and Customer’s Pickup for City Distribution of Online Shopping Purchases," Sustainability, MDPI, vol. 8(8), pages 1-20, August.
    18. Nadizadeh, Ali & Hosseini Nasab, Hasan, 2014. "Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 238(2), pages 458-470.
    19. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    20. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.

    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:operea:v:21:y:2021:i:2:d:10.1007_s12351-019-00480-6. 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.