A metaheuristic for the multiple minimum latency problem with the min-max objective
by Ha-Bang Ban
International Journal of Operational Research (IJOR), Vol. 48, No. 4, 2023

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.

Online publication date: Fri, 15-Dec-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com