学术探索
学术期刊
新闻热点
数据分析
智能评审

THE M-TRAVELING SALESMAN PROBLEM WITH MINMAX OBJECTIVE

被引：58
作者：
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
相关论文
共 23 条
[1]   SOME NEW BRANCHING AND BOUNDING CRITERIA FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM [J].
CARPANETO, G ;
TOTH, P .
MANAGEMENT SCIENCE, 1980, 26 (07) :736-743
[2]  
Christofides N., 1976, 388 CARN MELL U GRAD
[3]  
Dell'Amico M., 1995, ORSA Journal on Computing, V7, P191, DOI 10.1287/ijoc.7.2.191
[4]   A COMPOSITE HEURISTIC FOR THE IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM WITH MINIMUM MAKESPAN OBJECTIVE [J].
FRANCA, PM ;
GENDREAU, M ;
LAPORTE, G ;
MULLER, FM .
COMPUTERS & OPERATIONS RESEARCH, 1994, 21 (02) :205-210
[5]   APPROXIMATION ALGORITHMS FOR SOME ROUTING PROBLEMS [J].
FREDERICKSON, GN ;
HECHT, MS ;
KIM, CE .
SIAM JOURNAL ON COMPUTING, 1978, 7 (02) :178-193
[6]   A TABU SEARCH HEURISTIC FOR THE VEHICLE-ROUTING PROBLEM [J].
GENDREAU, M ;
HERTZ, A ;
LAPORTE, G .
MANAGEMENT SCIENCE, 1994, 40 (10) :1276-1290
[7]  
GENDREAU M, 1992, OPER RES, V40, P1986
[8]  
GIUST E, 1992, THESIS FACULTES U NO
[9]  
Glover F., 1993, Annals of Operations Research, V41, P3
[10]  
Glover F., 1993, MODERN HEURISTIC TEC
123