IDEAS home Printed from https://ideas.repec.org/a/spr/joheur/v27y2021i5d10.1007_s10732-021-09477-x.html
   My bibliography  Save this article

A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem

Author

Listed:
  • Venkatesh Pandiri

    (University of Hyderabad
    Indian Institute of Information Technology, Design and Manufacturing, Kancheepuram)

  • Alok Singh

    (University of Hyderabad)

Abstract

This paper addresses a variant of the many-to-many hub location-routing problem. Given an undirected edge-weighted complete graph $$G = (V, E)$$ G = ( V , E ) , this problem consists in finding a subset of V designated as hub nodes, partitioning all the nodes of V into cycles such that each cycle has exactly one hub node, and determining a Hamiltonian cycle on the subgraph induced by hub nodes. The objective is to minimize the total cost resulting from all these cycles. This problem is referred to as Many-to-Many p-Location-Hamiltonian Cycle Problem (MMpLHP) in this paper. To solve this problem, one has to deal with aspects of subset selection, grouping, and permutation. The characteristics of MMpLHP change according to the values of its constituent parameters. Hence, this problem can be regarded as a general problem which encompasses a diverse set of problems originating from different combinations of values of its constituent parameters. Such a general problem can be tackled effectively by suitably selecting and combining several different heuristics each of which cater to a different characteristic of the problem. Keeping this in mind, we have developed a simple multi-start hyper-heuristic approach for MMpLHP. Further, we have investigated two different selection mechanisms within the proposed approach. Experimental results and their analysis clearly demonstrate the superiority of our approach over best approaches known so far for this problem.

Suggested Citation

  • Venkatesh Pandiri & Alok Singh, 2021. "A simple hyper-heuristic approach for a variant of many-to-many hub location-routing problem," Journal of Heuristics, Springer, vol. 27(5), pages 791-868, October.
    • Handle: RePEc:spr:joheur:v:27:y:2021:i:5:d:10.1007_s10732-021-09477-x
    DOI: 10.1007/s10732-021-09477-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10732-021-09477-x
    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/s10732-021-09477-x?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. M Labbé & I Rodríguez-Martin & J J Salazar-González, 2004. "A branch-and-cut algorithm for the plant-cycle location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 513-520, May.
    2. Mauro Cardoso Lopes & Thiago Alves de Queiroz & Carlos Eduardo de Andrade & FlávioKeidi Miyazawa, 2015. "Solving a Variant of the Hub Location-Routing Problem," Springer Books, in: Zhenji Zhang & Zuojun Max Shen & Juliang Zhang & Runtong Zhang (ed.), Liss 2014, edition 127, pages 395-400, Springer.
    3. 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.
    4. Kuby, Michael J. & Gray, Robert Gordon, 1993. "The hub network design problem with stopovers and feeders: The case of Federal Express," Transportation Research Part A: Policy and Practice, Elsevier, vol. 27(1), pages 1-12, January.
    5. 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.
    6. 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)

    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. 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.
    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. 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.
    4. 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).
    5. 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.
    6. 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.
    7. 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.
    8. Chen, Dongxu & Yang, Zhongzhen, 2018. "Systematic optimization of port clusters along the Maritime Silk Road in the context of industry transfer and production capacity constraints," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 174-189.
    9. 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.
    10. 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.
    11. 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.
    12. W. B. Yates & E. C. Keedwell, 2019. "An analysis of heuristic subsequences for offline hyper-heuristic learning," Journal of Heuristics, Springer, vol. 25(3), pages 399-430, June.
    13. 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.
    14. Ivan Contreras & Moayad Tanash & Navneet Vidyarthi, 2017. "Exact and heuristic approaches for the cycle hub location problem," Annals of Operations Research, Springer, vol. 258(2), pages 655-677, November.
    15. 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.
    16. Hall, Randolph W. & Lo, Shih-Che, 2002. "Truck Scheduling for Ground to Air Connectivity: Final Report," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt85v0x577, Institute of Transportation Studies, UC Berkeley.
    17. Michael F. Gorman & John-Paul Clarke & Amir Hossein Gharehgozli & Michael Hewitt & René de Koster & Debjit Roy, 2014. "State of the Practice: A Review of the Application of OR/MS in Freight Transportation," Interfaces, INFORMS, vol. 44(6), pages 535-554, December.
    18. Hüseyin Güden, 2021. "New complexity results for the p-hub median problem," Annals of Operations Research, Springer, vol. 298(1), pages 229-247, March.
    19. Surafel Luleseged Tilahun & Mohamed A. Tawhid, 2019. "Swarm hyperheuristic framework," Journal of Heuristics, Springer, vol. 25(4), pages 809-836, October.
    20. Grunert, Tore & Sebastian, Hans-Jurgen, 2000. "Planning models for long-haul operations of postal and express shipment companies," European Journal of Operational Research, Elsevier, vol. 122(2), pages 289-309, April.

    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:joheur:v:27:y:2021:i:5:d:10.1007_s10732-021-09477-x. 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.