A metaheuristic for the multiple minimum latency problem with the min-max objective

Ha-Bang Ban

International Journal of Operational Research, 2023, vol. 48, issue 4, 529-561

Abstract: The multiple minimum latency problem with the min-max objective (mMLPMM) is an extension of the multiple minimum latency problem (mMLP). The mMLPMM requires to find a tour that aims to equally distribute the latency among routes by minimising the maximum route latency. To solve medium and large size instances, an effective metaheuristic algorithm is introduced, which combines greedy randomised adaptive search procedure (GRASP) for an initial solution construction, and general variable neighbourhood search (GVNS) for solution improvement. The proposed algorithm is tested on the benchmark instances derived from the literature. The results indicate that the GRASP-GVNS can produce efficient and effective solutions for the mMLPMM at a reasonable computation time.

Keywords: multiple minimum latency problem with min-max objective; mMLPMM; greedy randomised adaptive search procedure; GRASP; general variable neighbourhood search; GVNS; metaheuristic. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=135493 (text/html)
Access to full text is restricted to subscribers.

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:ids:ijores:v:48:y:2023:i:4:p:529-561

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().