Pyramidal tours and multiple objectives

被引:7
作者
Ozpeynirci, Ozgur [1 ]
Koksalan, Murat [2 ]
机构
[1] Izmir Univ Econ, Dept Logist Management, TR-35330 Izmir, Turkey
[2] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey
关键词
Keywords Pyramidal tour; Polynomially solvable; Multiple objectives; TSP; BTSP; TRAVELING SALESMAN PROBLEM; TSP; VAN;
D O I
10.1007/s10898-009-9505-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In this study, we work on the traveling salesperson problems and bottleneck traveling salesperson problems that have special matrix structures and lead to polynomially solvable cases. We extend the problems to multiple objectives and investigate the properties of the nondominated points. We develop a pseudo-polynomial time algorithm to find a nondominated point for any number of objectives. Finally, we propose an approach to generate all nondominated points for the biobjective case.
引用
收藏
页码:569 / 582
页数:14
相关论文
共 16 条