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

Venkatesh Pandiri () and Alok Singh ()
Additional contact information
Venkatesh Pandiri: University of Hyderabad
Alok Singh: University of Hyderabad

Journal of Heuristics, 2021, vol. 27, issue 5, No 3, 868 pages

Abstract: 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.

Keywords: Hub location-routing problem; Heuristic; Hyper-heuristic; Combinatorial optimization (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10732-021-09477-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joheur:v:27:y:2021:i:5:d:10.1007_s10732-021-09477-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10732

DOI: 10.1007/s10732-021-09477-x

Access Statistics for this article

Journal of Heuristics is currently edited by Manuel Laguna

More articles in Journal of Heuristics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().