Pyramidal Tours and Multiple Objectives

dc.contributor.author Özpeynirci, Özgür
dc.contributor.author Koksalan, Murat
dc.date.accessioned 2023-06-16T12:47:59Z
dc.date.available 2023-06-16T12:47:59Z
dc.date.issued 2010
dc.description.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. en_US
dc.identifier.doi 10.1007/s10898-009-9505-0
dc.identifier.issn 0925-5001
dc.identifier.issn 1573-2916
dc.identifier.uri https://doi.org/10.1007/s10898-009-9505-0
dc.identifier.uri https://hdl.handle.net/20.500.14365/924
dc.language.iso en en_US
dc.publisher Springer en_US
dc.relation.ispartof Journal of Global Optımızatıon en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject Keywords Pyramidal tour en_US
dc.subject Polynomially solvable en_US
dc.subject Multiple objectives en_US
dc.subject TSP en_US
dc.subject BTSP en_US
dc.subject Traveling Salesman Problem en_US
dc.subject Tsp en_US
dc.subject Van en_US
dc.title Pyramidal Tours and Multiple Objectives en_US
dc.type Article en_US
dspace.entity.type Publication
gdc.author.id Koksalan, Murat M/0000-0002-5423-3905
gdc.author.id Özpeynirci, Özgür/0000-0002-3695-6587
gdc.author.wosid Koksalan, Murat M/A-9116-2016
gdc.author.wosid Özpeynirci, Özgür/A-2796-2009
gdc.bip.impulseclass C5
gdc.bip.influenceclass C5
gdc.bip.popularityclass C5
gdc.coar.access metadata only access
gdc.coar.type text::journal::journal article
gdc.collaboration.industrial false
gdc.description.department İzmir Ekonomi Üniversitesi en_US
gdc.description.departmenttemp [Özpeynirci, Özgür] Izmir Univ Econ, Dept Logist Management, TR-35330 Izmir, Turkey; [Koksalan, Murat] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey en_US
gdc.description.endpage 582 en_US
gdc.description.issue 4 en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q2
gdc.description.startpage 569 en_US
gdc.description.volume 48 en_US
gdc.description.wosquality Q2
gdc.identifier.openalex W2059438022
gdc.identifier.wos WOS:000283223700004
gdc.index.type WoS
gdc.oaire.diamondjournal false
gdc.oaire.impulse 2.0
gdc.oaire.influence 3.1403602E-9
gdc.oaire.isgreen false
gdc.oaire.keywords Combinatorial optimization
gdc.oaire.keywords BTSP
gdc.oaire.keywords polynomially solvable
gdc.oaire.keywords TSP
gdc.oaire.keywords Multi-objective and goal programming
gdc.oaire.popularity 1.1236833E-9
gdc.oaire.publicfunded false
gdc.oaire.sciencefields 0211 other engineering and technologies
gdc.oaire.sciencefields 0102 computer and information sciences
gdc.oaire.sciencefields 02 engineering and technology
gdc.oaire.sciencefields 01 natural sciences
gdc.openalex.collaboration National
gdc.openalex.fwci 0.6549
gdc.openalex.normalizedpercentile 0.71
gdc.opencitations.count 7
gdc.plumx.crossrefcites 7
gdc.plumx.mendeley 7
gdc.plumx.scopuscites 7
gdc.virtual.author Özpeynirci, Özgür
gdc.wos.citedcount 7
relation.isAuthorOfPublication c6a6133d-234b-4203-8221-22b84c80ed5d
relation.isAuthorOfPublication.latestForDiscovery c6a6133d-234b-4203-8221-22b84c80ed5d
relation.isOrgUnitOfPublication c9b8b195-ae12-421f-b46a-ed1f01ed1cb8
relation.isOrgUnitOfPublication d61c5ef4-1ebc-4355-bc4f-dfa76978271b
relation.isOrgUnitOfPublication e9e77e3e-bc94-40a7-9b24-b807b2cd0319
relation.isOrgUnitOfPublication.latestForDiscovery c9b8b195-ae12-421f-b46a-ed1f01ed1cb8

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
924.pdf
Size:
239.41 KB
Format:
Adobe Portable Document Format