THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE

被引：60

作者：

FRANCA, PM

GENDREAU, M

LAPORTE, G

MULLER, FM

机构：

[1] UNIV MONTREAL,CTR RECH TRANSPORTS,MONTREAL,PQ H3C 3J7,CANADA

[2] UNIV FED SANTA MARIA,DEPT ELETRON & COMPUTACAO,SANTA MARIA,RS,BRAZIL

来源：

TRANSPORTATION SCIENCE | 1995年 / 29卷 / 03期

关键词：

D O I：

10.1287/trsc.29.3.267

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This article proposes algorithms for the Minmax version of the m-Traveling Salesman Problem in which the objective is to minimize the length of the longest route. A tabu search heuristic and two exact search schemes are developed. Problems involving up to 50 vertices are solved to optimality.

引用

页码：267 / 275

页数：9