IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v302y2022i3p1113-1127.html
   My bibliography  Save this article

Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem

Author

Listed:
  • Wu, Yuehui
  • Qureshi, Ali Gul
  • Yamada, Tadashi

Abstract

In this study, we investigate a multi-allocation hub location routing problem (MAHLRP) for the design of an intra-city express service system, in which flows of mails and parcels are exchanged among the branch offices of the service provider via local tours and hubs. In this application, the pickup and delivery processes are handled simultaneously, and both hub capacity and vehicle capacity are considered. We propose a mixed integer programming formulation for this variant of problem for the first time, followed by a meta-heuristic algorithm, named as adaptive large neighborhood decomposition search, to solve the problem. The proposed model and algorithm are also applied to the single-allocation hub location routing problem (SAHLRP) with minor modifications for comparison reasons. Series of numerical experiments have been conducted on the instances generated from Australian Post data set to test the proposed model and algorithm for both the SAHLRP and the MAHLRP. The results prove that our algorithm outperforms the CPLEX on solving these two problems, as well as that applying the MAHLRP can efficiently reduce the operating cost as compared to the SAHLRP.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:302:y:2022:i:3:p:1113-1127
    DOI: 10.1016/j.ejor.2022.02.002
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722000893
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.02.002?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. 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.
    2. 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.
    3. Fábio Francisco da Costa Fontes & Gilles Goncalves, 2021. "A variable neighbourhood decomposition search approach applied to a global liner shipping network using a hub-and-spoke with sub-hub structure," International Journal of Production Research, Taylor & Francis Journals, vol. 59(1), pages 30-46, January.
    4. Gelareh, Shahin & Nickel, Stefan, 2011. "Hub location problems in transportation networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 47(6), pages 1092-1111.
    5. Ji Ung Sun, 2015. "An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-11, July.
    6. 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.
    7. Campbell, James F., 1994. "Integer programming formulations of discrete hub location problems," European Journal of Operational Research, Elsevier, vol. 72(2), pages 387-405, January.
    8. Archetti, Claudia & Bianchessi, Nicola & Speranza, M. Grazia, 2014. "Branch-and-cut algorithms for the split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 685-698.
    9. Selim Çetiner & Canan Sepil & Haldun Süral, 2010. "Hubbing and routing in postal delivery systems," Annals of Operations Research, Springer, vol. 181(1), pages 109-124, December.
    10. 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.
    11. Mari'n, Alfredo & Canovas, Lazaro & Landete, Mercedes, 2006. "New formulations for the uncapacitated multiple allocation hub location problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 274-292, July.
    12. O'kelly, Morton E., 1987. "A quadratic integer program for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 32(3), pages 393-404, December.
    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. Koç, Çağrı & Bektaş, Tolga & Jabali, Ola & Laporte, Gilbert, 2016. "The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm," European Journal of Operational Research, Elsevier, vol. 248(1), pages 33-51.
    15. 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.
    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. Wang, Congke & Liu, Yankui & Yang, Guoqing, 2023. "Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    2. Elham Ziar & Mehdi Seifbarghy & Mahdi Bashiri & Benny Tjahjono, 2023. "An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach," Annals of Operations Research, Springer, vol. 322(2), pages 1143-1166, March.
    3. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    4. Mrabti, Nassim & Hamani, Nadia & Boulaksil, Youssef & Amine Gargouri, Mohamed & Delahoche, Laurent, 2022. "A multi-objective optimization model for the problems of sustainable collaborative hub location and cost sharing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    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. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    2. 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.
    3. 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.
    4. 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.
    5. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    6. Wang, Congke & Liu, Yankui & Yang, Guoqing, 2023. "Adaptive distributionally robust hub location and routing problem with a third-party logistics strategy," Socio-Economic Planning Sciences, Elsevier, vol. 87(PA).
    7. Real, Luiza Bernardes & Contreras, Ivan & Cordeau, Jean-François & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2021. "Multimodal hub network design with flexible routes," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    8. de Sá, Elisangela Martins & de Camargo, Ricardo Saraiva & de Miranda, Gilberto, 2013. "An improved Benders decomposition algorithm for the tree of hubs location problem," European Journal of Operational Research, Elsevier, vol. 226(2), pages 185-202.
    9. 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.
    10. Morton O’Kelly & Henrique Luna & Ricardo Camargo & Gilberto Miranda, 2015. "Hub Location Problems with Price Sensitive Demands," Networks and Spatial Economics, Springer, vol. 15(4), pages 917-945, December.
    11. Contreras, Ivan & Fernández, Elena & Marín, Alfredo, 2010. "The Tree of Hubs Location Problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 390-400, April.
    12. Ivan Contreras & Jean-François Cordeau & Gilbert Laporte, 2012. "Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels," Transportation Science, INFORMS, vol. 46(4), pages 439-459, November.
    13. James F. Campbell & Morton E. O'Kelly, 2012. "Twenty-Five Years of Hub Location Research," Transportation Science, INFORMS, vol. 46(2), pages 153-169, May.
    14. Ricardo Saraiva de Camargo & Gilberto de Miranda & Henrique Pacca L. Luna, 2009. "Benders Decomposition for Hub Location Problems with Economies of Scale," Transportation Science, INFORMS, vol. 43(1), pages 86-97, February.
    15. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    16. Bütün, Cihan & Petrovic, Sanja & Muyldermans, Luc, 2021. "The capacitated directed cycle hub location and routing problem under congestion," European Journal of Operational Research, Elsevier, vol. 292(2), pages 714-734.
    17. Jayaswal, Sachin & Vidyarthi, Navneet, 2023. "Multiple allocation hub location with service level constraints for two shipment classes," European Journal of Operational Research, Elsevier, vol. 309(2), pages 634-655.
    18. 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.
    19. Yuan, Yun & Yu, Jie, 2018. "Locating transit hubs in a multi-modal transportation network: A cluster-based optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 85-103.
    20. Canovas, Lazaro & Garcia, Sergio & Marin, Alfredo, 2007. "Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique," European Journal of Operational Research, Elsevier, vol. 179(3), pages 990-1007, 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:eee:ejores:v:302:y:2022:i:3:p:1113-1127. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.