Pyramidal tours and multiple objectives

Date

2010-12-01

Author

Özpeynirci, Özgür
Köksalan, Mustafa Murat

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

16
views

0
downloads

Cite This

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. © 2009 Springer Science+Business Media, LLC.

Subject Keywords

BTSP, Multiple objectives, Polynomially solvable, Pyramidal tour, TSP

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=78149285667&origin=inward
https://hdl.handle.net/11511/106949

Collections

Department of Industrial Engineering, Article