IDEAS home Printed from https://ideas.repec.org/a/spr/orspec/v41y2019i1d10.1007_s00291-018-0526-2.html
   My bibliography  Save this article

Heuristic algorithms for the single allocation p-hub center problem with routing considerations

Author

Listed:
  • Zühal Kartal

    (Anadolu University)

  • Mohan Krishnamoorthy

    (University of Queensland)

  • Andreas T. Ernst

    (Monash University)

Abstract

Given a network with n nodes, the p-hub center problem locates p hubs and allocates the remaining non-hub nodes to the hubs in such a way that the maximum distance (or time) between all pairs of nodes is minimized. Commonly, it is assumed that a vehicle is available to operate between each demand center and hub. Thus traditional p-hub center models assume that vehicles do not visit more than one non-hub node. However, in many-to-many distribution systems, there are some cases where nodes do not have enough demand to justify direct connections between the non-hub nodes and the hubs. This results in unnecessarily increasing the total number of vehicles on the network. Therefore, the optimal hub network design ought to include location-allocation and routing decisions simultaneously to form the routes among the nodes allocated to the same hubs. In this paper, through the observations from real-life hub networks, we introduce the p-hub center and routing network design problem (pHCVRP) and propose a mixed integer programming (MIP) formulation to model this problem formally. The aim is to locate p hubs, allocate demand centers to the hubs and determine the routes of vehicles for each hub such that the maximum travel time between all origin-destination pairs is minimized. We prove that pHCVRP is NP-hard and therefore only very small instances can be solved to optimality using a MIP solver. Hence, we develop two heuristics based on ant colony system (ACS) and discrete particle swarm optimization (DPSO) to obtain solutions for realistic instance sizes. Our design of the DPSO is quite different to the standard DPSO methods. In our DPSO, we combine concepts from simulated annealing (SA) and ACS to update the particles. We also use iterated local search (ILS) as a baseline algorithm to observe the improvements from a pure local search through more complex algorithms. We test the performance of the heuristics that we develop on the Turkish network and Australia Post data set and compare the performance of these methods.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:orspec:v:41:y:2019:i:1:d:10.1007_s00291-018-0526-2
    DOI: 10.1007/s00291-018-0526-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00291-018-0526-2
    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/s00291-018-0526-2?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. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2009. "The design of single allocation incomplete hub networks," Transportation Research Part B: Methodological, Elsevier, vol. 43(10), pages 936-951, December.
    2. Serper, Elif Zeynep & Alumur, Sibel A., 2016. "The design of capacitated intermodal hub networks with different vehicle types," Transportation Research Part B: Methodological, Elsevier, vol. 86(C), pages 51-65.
    3. Bahar Y. Kara & Barbaros Ç. Tansel, 2001. "The Latest Arrival Hub Location Problem," Management Science, INFORMS, vol. 47(10), pages 1408-1420, October.
    4. 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.
    5. Yaman, Hande & Kara, Bahar Y. & Tansel, Barbaros Ç., 2007. "The latest arrival hub location problem for cargo delivery systems with stopovers," Transportation Research Part B: Methodological, Elsevier, vol. 41(8), pages 906-919, October.
    6. Gelareh, Shahin & Neamatian Monemi, Rahimeh & Nickel, Stefan, 2015. "Multi-period hub location problems in transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 75(C), pages 67-94.
    7. S Alumur & B Y Kara, 2009. "A hub covering network design problem for cargo applications in Turkey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1349-1359, October.
    8. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    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. Kemmoé Tchomté, Sylverin & Gourgand, Michel, 2009. "Particle swarm optimization: A study of particle displacement for solving continuous and combinatorial optimization problems," International Journal of Production Economics, Elsevier, vol. 121(1), pages 57-67, September.
    11. 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.
    12. Aykin, Turgut, 1995. "The hub location and routing problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 200-219, May.
    13. 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.
    14. Tasgetiren, M. Fatih & Liang, Yun-Chia & Sevkli, Mehmet & Gencyilmaz, Gunes, 2007. "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1930-1947, March.
    15. 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.
    16. Jozef Kratica & Zorica Stanimirović, 2006. "SOLVING THE UNCAPACITATED MULTIPLE ALLOCATIONp-HUB CENTER PROBLEM BY GENETIC ALGORITHM," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 23(04), pages 425-437.
    17. 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.
    18. Kara, Bahar Y. & Tansel, Barbaros C., 2000. "On the single-assignment p-hub center problem," European Journal of Operational Research, Elsevier, vol. 125(3), pages 648-655, September.
    19. Yaman, Hande, 2009. "The hierarchical hub median problem with single assignment," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 643-658, July.
    20. Marco Dorigo & Thomas Stützle, 2010. "Ant Colony Optimization: Overview and Recent Advances," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 227-263, Springer.
    21. The Jin Ai & Voratas Kachitvichyanukul, 2009. "A Particle Swarm Optimisation for Vehicle Routing Problem with Time Windows," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(4), pages 519-537.
    22. 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.
    23. Sun, Zhuo & Zheng, Jianfeng, 2016. "Finding potential hub locations for liner shipping," Transportation Research Part B: Methodological, Elsevier, vol. 93(PB), pages 750-761.
    24. 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.
    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. Yang, Lingxiao & Zheng, Jianfeng & Wang, Jian & Hu, Xiaowei, 2023. "The maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    2. 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.
    3. 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).
    4. 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.

    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. 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.
    2. Yang, Lingxiao & Zheng, Jianfeng & Wang, Jian & Hu, Xiaowei, 2023. "The maximal detour liner shipping hub location problem: Improving the applicability of the p-hub center problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 179(C).
    3. Ghaffarinasab, Nader & Kara, Bahar Y. & Campbell, James F., 2022. "The stratified p-hub center and p-hub maximal covering problems," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 120-148.
    4. Alumur, Sibel A. & Yaman, Hande & Kara, Bahar Y., 2012. "Hierarchical multimodal hub location problem with time-definite deliveries," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(6), pages 1107-1120.
    5. Mohammadreza Hamidi & Mohammadreza Gholamian & Kamran Shahanaghi, 2014. "Developing prevention reliability in hub location models," Journal of Risk and Reliability, , vol. 228(4), pages 337-346, August.
    6. Meuffels, W.J.M., 2015. "The design of road and air networks for express service providers," Other publications TiSEM d3266cb8-bc55-41be-adc7-4, Tilburg University, School of Economics and Management.
    7. Hande Yaman & Oya Ekin Karasan & Bahar Y. Kara, 2012. "Release Time Scheduling and Hub Location for Next-Day Delivery," Operations Research, INFORMS, vol. 60(4), pages 906-917, August.
    8. Mahmutogullari, Ali Irfan & Kara, Bahar Y., 2016. "Hub location under competition," European Journal of Operational Research, Elsevier, vol. 250(1), pages 214-225.
    9. Esmizadeh, Yalda & Bashiri, Mahdi & Jahani, Hamed & Almada-Lobo, Bernardo, 2021. "Cold chain management in hierarchical operational hub networks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    10. Yaman, Hande, 2011. "Allocation strategies in hub networks," European Journal of Operational Research, Elsevier, vol. 211(3), pages 442-451, June.
    11. Yıldız, Barış & Karaşan, Oya Ekin, 2015. "Regenerator Location Problem and survivable extensions: A hub covering location perspective," Transportation Research Part B: Methodological, Elsevier, vol. 71(C), pages 32-55.
    12. Hu, Lu & Zhu, Juan Xiu & Wang, Yuan & Lee, Loo Hay, 2018. "Joint design of fleet size, hub locations, and hub capacities for third-party logistics networks with road congestion constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 568-588.
    13. Taherkhani, Gita & Alumur, Sibel A., 2019. "Profit maximizing hub location problems," Omega, Elsevier, vol. 86(C), pages 1-15.
    14. Ting L. Lei, 2019. "Evaluating the Vulnerability of Time-Sensitive Transportation Networks: A Hub Center Interdiction Problem," Sustainability, MDPI, vol. 11(17), pages 1-13, August.
    15. El Mehdi Ibnoulouafi & Mustapha Oudani & Tarik Aouam & Mounir Ghogho, 2022. "Intermodal Green p-Hub Median Problem with Incomplete Hub-Network," Sustainability, MDPI, vol. 14(18), pages 1-29, September.
    16. 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.
    17. Elisangela Martins de Sá & Ivan Contreras & Jean-François Cordeau & Ricardo Saraiva de Camargo & Gilberto de Miranda, 2015. "The Hub Line Location Problem," Transportation Science, INFORMS, vol. 49(3), pages 500-518, August.
    18. S Alumur & B Y Kara, 2009. "A hub covering network design problem for cargo applications in Turkey," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(10), pages 1349-1359, October.
    19. Alumur, Sibel A. & Kara, Bahar Y. & Karasan, Oya E., 2012. "Multimodal hub location and hub network design," Omega, Elsevier, vol. 40(6), pages 927-939.
    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:orspec:v:41:y:2019:i:1:d:10.1007_s00291-018-0526-2. 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.