THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE

Authors
FRANCA PM GENDREAU M LAPORTE G MULLER FM
Citation
Pm. Franca et al., THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE, Transportation science, 29(3), 1995, pp. 267-275
Citations number
23
Categorie Soggetti
Transportation,Transportation
Journal title
Transportation science → ACNP
ISSN journal
00411655
Volume
29
Issue
3
Year of publication
1995
Pages
267 - 275
Database
ISI
SICI code
0041-1655(1995)29:3<267:TMSPWM>2.0.ZU;2-6
Abstract
This article proposes algorithms for the Minmax version of the m-Trave ling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search sc hemes are developed. Problems involving up to 50 vertices are solved t o optimality.