Pyramidal tours and multiple objectives

Özpeynirci Ö., Köksalan M.

Journal of Global Optimization, cilt.48, sa.4, ss.569-582, 2010 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 48 Sayı: 4
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1007/s10898-009-9505-0
  • Dergi Adı: Journal of Global Optimization
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.569-582
  • Anahtar Kelimeler: BTSP, Multiple objectives, Polynomially solvable, Pyramidal tour, TSP
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.