IDEAS home Printed from https://ideas.repec.org/a/spr/eurjtl/v8y2019i5d10.1007_s13676-019-00141-w.html
   My bibliography  Save this article

The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach

Author

Listed:
  • Kassem Danach

    (Islamic University of Lebanon)

  • Shahin Gelareh

    (Université Artois)

  • Rahimeh Neamatian Monemi

    (University of Southampton)

Abstract

A variant of the hub location routing problem studied in this work, which is the problem of locating a set of hub nodes, is establishing the hub-level network and allocating the spoke nodes to the hub nodes. As a particular property of this problem, each cluster of spoke nodes allocated to a hub constitutes a directed route that starts from the hub, visits all the spokes in the same cluster, and terminates to the same hub. We propose a hybrid of hyper-heuristic and a relax-and-cut solution method, which includes cooperation among several low-level heuristics governed and controlled by a learning mechanism. This hybridization provides a mechanism in which the obtained dual information through the Lagrangian relaxation (bundle) method being utilized to guide the local searches for constructing/improving feasible solutions. Several classes of valid inequalities as well as efficient separation routings are also proposed for being used within the relax-and-cut approach. Our extensive computational experiments confirm the efficiency of this solution method in terms of quality as well as computational time.

Suggested Citation

  • Kassem Danach & Shahin Gelareh & Rahimeh Neamatian Monemi, 2019. "The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 597-631, December.
    • Handle: RePEc:spr:eurjtl:v:8:y:2019:i:5:d:10.1007_s13676-019-00141-w
    DOI: 10.1007/s13676-019-00141-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13676-019-00141-w
    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/s13676-019-00141-w?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. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    2. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    3. Manfred W. Padberg & M. R. Rao, 1982. "Odd Minimum Cut-Sets and b -Matchings," Mathematics of Operations Research, INFORMS, vol. 7(1), pages 67-80, February.
    4. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    5. 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.
    6. Ilic, Aleksandar & Urosevic, Dragan & Brimberg, Jack & Mladenovic, Nenad, 2010. "A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem," European Journal of Operational Research, Elsevier, vol. 206(2), pages 289-300, October.
    7. A.T. Ernst & M. Krishnamoorthy, 1999. "Solution algorithms for the capacitated single allocation hub location problem," Annals of Operations Research, Springer, vol. 86(0), pages 141-159, January.
    8. Campbell, Ann Melissa & Lowe, Timothy J. & Zhang, Li, 2007. "The p-hub center allocation problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 819-835, January.
    9. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1998. "Solving the Orienteering Problem through Branch-and-Cut," INFORMS Journal on Computing, INFORMS, vol. 10(2), pages 133-148, May.
    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. Marshall L. Fisher, 2004. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 50(12_supple), pages 1861-1871, December.
    12. Abdinnour-Helm, Sue, 1998. "A hybrid heuristic for the uncapacitated hub location problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 489-499, April.
    13. Ebery, Jamie & Krishnamoorthy, Mohan & Ernst, Andreas & Boland, Natashia, 2000. "The capacitated multiple allocation hub location problem: Formulations and algorithms," European Journal of Operational Research, Elsevier, vol. 120(3), pages 614-631, February.
    14. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    15. 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.
    16. 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.
    17. 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)

    Citations

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


    Cited by:

    1. Henry, Elise & Furno, Angelo & Faouzi, Nour-Eddin El & Rey, David, 2022. "Locating park-and-ride facilities for resilient on-demand urban mobility," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    2. Saldanha-da-Gama, Francisco, 2022. "Facility Location in Logistics and Transportation: An enduring relationship," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    3. Aloullal, Afaf & Saldanha-da-Gama, Francisco & Todosijević, Raca, 2023. "Multi-period single-allocation hub location-routing: Models and heuristic solutions," European Journal of Operational Research, Elsevier, vol. 310(1), pages 53-70.

    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. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    2. 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.
    3. Zühal Kartal & Mohan Krishnamoorthy & Andreas T. Ernst, 2019. "Heuristic algorithms for the single allocation p-hub center problem with routing considerations," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(1), pages 99-145, March.
    4. Alumur, Sibel A. & Nickel, Stefan & Saldanha-da-Gama, Francisco, 2012. "Hub location under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 46(4), pages 529-543.
    5. Nader Ghaffarinasab & Bahar Y. Kara, 2019. "Benders Decomposition Algorithms for Two Variants of the Single Allocation Hub Location Problem," Networks and Spatial Economics, Springer, vol. 19(1), pages 83-108, March.
    6. 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.
    7. Trung Hieu Tran & Jesse R. O’Hanley & M. Paola Scaparra, 2017. "Reliable Hub Network Design: Formulation and Solution Techniques," Transportation Science, INFORMS, vol. 51(1), pages 358-375, February.
    8. Alumur, Sibel & Kara, Bahar Y., 2008. "Network hub location problems: The state of the art," European Journal of Operational Research, Elsevier, vol. 190(1), pages 1-21, October.
    9. Juanjo Peiró & Ángel Corberán & Rafael Martí & Francisco Saldanha-da-Gama, 2019. "Heuristic Solutions for a Class of Stochastic Uncapacitated p-Hub Median Problems," Transportation Science, INFORMS, vol. 53(4), pages 1126-1149, July.
    10. Wu, Yuehui & Qureshi, Ali Gul & Yamada, Tadashi, 2022. "Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1113-1127.
    11. Liting Chen & Sebastian Wandelt & Weibin Dai & Xiaoqian Sun, 2022. "Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 834-856, March.
    12. Dhyani, Sneha & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2019. "Alternate Second Order Conic Programming Reformulations for Hub Location with Capacity Selection under Demand," IIMA Working Papers WP 2018-12-04, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. 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.
    14. Sneha Dhyani Bhatt & Sachin Jayaswal & Ankur Sinha & Navneet Vidyarthi, 2021. "Alternate second order conic program reformulations for hub location under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 304(1), pages 481-527, September.
    15. Jayaswal, Sachin & Vidyarthi, Navneet, 2013. "Capacitated Multiple Allocation Hub Location with Service Level Constraints for Multiple Consignment Classes," IIMA Working Papers WP2013-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Zheng, Jianfeng & Meng, Qiang & Sun, Zhuo, 2014. "Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design," European Journal of Operational Research, Elsevier, vol. 234(3), pages 874-884.
    17. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    18. Samir Elhedhli & Huyu Wu, 2010. "A Lagrangean Heuristic for Hub-and-Spoke System Design with Capacity Selection and Congestion," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 282-296, May.
    19. Hu, Qing-Mi & Hu, Shaolong & Wang, Jian & Li, Xiaoping, 2021. "Stochastic single allocation hub location problems with balanced utilization of hub capacities," Transportation Research Part B: Methodological, Elsevier, vol. 153(C), pages 204-227.
    20. Nader Azizi & Navneet Vidyarthi & Satyaveer S. Chauhan, 2018. "Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion," Annals of Operations Research, Springer, vol. 264(1), pages 1-40, May.

    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:eurjtl:v:8:y:2019:i:5:d:10.1007_s13676-019-00141-w. 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.