Multiobjective Traveling Salesperson Problem on Halin Graphs
| dc.contributor.author | Özpeynirci, Özgür | |
| dc.contributor.author | Koksalan, Murat | |
| dc.date.accessioned | 2023-06-16T12:59:17Z | |
| dc.date.available | 2023-06-16T12:59:17Z | |
| dc.date.issued | 2009 | |
| dc.description.abstract | 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. | en_US |
| dc.identifier.doi | 10.1016/j.ejor.2008.04.011 | |
| dc.identifier.issn | 0377-2217 | |
| dc.identifier.issn | 1872-6860 | |
| dc.identifier.scopus | 2-s2.0-56549106233 | |
| dc.identifier.uri | https://doi.org/10.1016/j.ejor.2008.04.011 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.14365/1182 | |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.ispartof | European Journal of Operatıonal Research | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Traveling salesperson problem | en_US |
| dc.subject | Bottleneck traveling salesperson problem | en_US |
| dc.subject | Multiple objectives | en_US |
| dc.subject | Solvable cases | en_US |
| dc.subject | Halin graphs | en_US |
| dc.subject | Computational complexity | en_US |
| dc.subject | Salesman Problem | en_US |
| dc.title | Multiobjective Traveling Salesperson Problem on Halin Graphs | 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.scopusid | 16402801100 | |
| gdc.author.scopusid | 6701407602 | |
| 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 | [Koksalan, Murat] Middle E Tech Univ, Dept Ind Engn, TR-06531 Ankara, Turkey; [Özpeynirci, Özgür] Izmir Univ Econ, Dept Logist Management, TR-35330 Izmir, Turkey | en_US |
| gdc.description.endpage | 161 | en_US |
| gdc.description.issue | 1 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q1 | |
| gdc.description.startpage | 155 | en_US |
| gdc.description.volume | 196 | en_US |
| gdc.description.wosquality | Q1 | |
| gdc.identifier.openalex | W2070956006 | |
| gdc.identifier.wos | WOS:000262121400014 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 3.0 | |
| gdc.oaire.influence | 3.1849152E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.keywords | Combinatorial optimization | |
| gdc.oaire.keywords | computational complexity | |
| gdc.oaire.keywords | multiple objectives | |
| gdc.oaire.keywords | Halin graphs | |
| gdc.oaire.keywords | traveling salesperson problem | |
| gdc.oaire.keywords | solvable cases | |
| gdc.oaire.keywords | Programming involving graphs or networks | |
| gdc.oaire.keywords | Bottleneck traveling salesperson problem | |
| gdc.oaire.popularity | 8.937311E-10 | |
| 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 | 1.77195295 | |
| gdc.openalex.normalizedpercentile | 0.9 | |
| gdc.opencitations.count | 8 | |
| gdc.plumx.crossrefcites | 8 | |
| gdc.plumx.mendeley | 19 | |
| gdc.plumx.scopuscites | 9 | |
| gdc.scopus.citedcount | 9 | |
| 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
1 - 1 of 1