The balanced traveling salesman problem

被引：12
|
作者：
Larusic, John [2 ]
Punnen, Abraham P. [1 ]
机构：
[1] Simon Fraser Univ Surrey, Dept Math, Surrey, BC V3T 0A3, Canada
[2] AnalysisWorks Inc, Vancouver, BC V6H 3V9, Canada
来源：
COMPUTERS & OPERATIONS RESEARCH | 2011年 / 38卷 / 05期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Traveling salesman problem; Balanced optimization; Complexity; Heuristics; Experimental analysis; EPSILON-APPROXIMATION SCHEME; UNIFORM SPANNING-TREES; OPTIMIZATION PROBLEMS; SINGLE-MACHINE; CUT PROBLEMS; RANGE; ALGORITHM; DEVIATION; LATENESS; RATIO;
D O I：
10.1016/j.cor.2010.09.016
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper we introduce the balanced traveling salesman problem (BTSP), which can be used to model optimization problems where equitable distribution of resources are important. BTSP is obviously NP-hard. Efficient heuristic algorithms are presented to solve the problem along with extensive computational results using benchmark problems from TSPLIB and random instances. Our algorithms produced provably optimal solutions for several test instances. Application of the model in solving the nozzle guide vane assembly problem related to the maintenance of aircraft engines is also discussed. (C) 2010 Elsevier Ltd. All rights reserved.
引用
收藏
页码：868 / 875
页数：8
相关论文
共 50 条
12345