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

Authors: Ha-Bang Ban

Addresses: Computer Science Department, School of Information and Communication Technology, Ha Noi University of Science and Technology, Vietnam

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.

DOI: 10.1504/IJOR.2023.135493

International Journal of Operational Research, 2023 Vol.48 No.4, pp.529 - 561

Received: 18 Dec 2019
Accepted: 08 Mar 2021
Published online: 15 Dec 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article