Pyramidal tours and multiple objectives

Pyramidal tours and multiple objectives

0.00 Avg rating0 Votes
Article ID: iaor20107612
Volume: 48
Issue: 4
Start Page Number: 569
End Page Number: 582
Publication Date: Dec 2010
Journal: Journal of Global Optimization
Authors: ,
Keywords: programming: travelling salesman
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.