Multiobjective traveling salesperson problem on Halin graphs

Ozpeynirci O., Koksalan M.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, cilt.196, sa.1, ss.155-161, 2009 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 196 Sayı: 1
  • Basım Tarihi: 2009
  • Doi Numarası: 10.1016/j.ejor.2008.04.011
  • Dergi Adı: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.155-161
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

In this paper, we study traveling salesperson (TSP) and bottleneck traveling salesperson (BTSP) problems on special graphs called Halin graphs. Although both problems are NP-Hard on general graphs, they are polynomially solvable on Halin graphs. We address the multiobjective versions of these problems. We show computational complexities of finding a single nondominated point as well as finding all nondominated points for different objective function combinations. We develop algorithms for the polynomially solvable combinations. (C) 2008 Elsevier B.V. All rights reserved.