The attractive traveling salesman problem
dc.contributor.author | Erdoğan, Güneş | |
dc.contributor.author | Cordeau, J.-F. | |
dc.contributor.author | Laporte, G. | |
dc.date.accessioned | 2012-12-06T10:30:42Z | |
dc.date.available | 2012-12-06T10:30:42Z | |
dc.date.issued | 2010-05-16 | |
dc.identifier.issn | 0377-2217 | |
dc.identifier.uri | http://hdl.handle.net/10679/261 | |
dc.identifier.uri | http://www.sciencedirect.com/science/article/pii/S0377221709004986 | |
dc.description | Due to copyright restrictions, the access to the full text of this article is only available via subscription. | |
dc.description.abstract | In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of the facility vertices. Profit is computed through an attraction function: every visited facility vertex attracts a portion of the profit from the customer vertices based on the distance between the facility and customer vertices, and the attractiveness of the facility vertex. A gravity model is used for computing the profit attraction. The problem is formulated as an integer non-linear program. A linearization is proposed and strengthened through the introduction of valid inequalities, and a branch-and-cut algorithm is developed. A tabu search algorithm is also implemented. Computational results are reported. | en_US |
dc.description.sponsorship | Canadian Natural Sciences and Engineering Research Council | |
dc.language.iso | eng | en_US |
dc.publisher | Elsevier | en_US |
dc.relation.ispartof | European Journal of Operational Research | |
dc.rights | restrictedAccess | |
dc.title | The attractive traveling salesman problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0002-2456-3719 & YÖK ID 172715) Erdoğan, Güneş | |
dc.contributor.ozuauthor | Erdoğan, Güneş | |
dc.identifier.volume | 203 | |
dc.identifier.issue | 1 | |
dc.identifier.startpage | 59 | |
dc.identifier.endpage | 69 | |
dc.identifier.wos | WOS:000272073100007 | |
dc.identifier.doi | 10.1016/j.ejor.2009.06.029 | |
dc.subject.keywords | Traveling Salesman Problem | en_US |
dc.subject.keywords | Demand attraction | en_US |
dc.subject.keywords | Demand allocation | en_US |
dc.subject.keywords | Linearization | en_US |
dc.subject.keywords | Branch-and-cut | en_US |
dc.subject.keywords | Tabu search | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-70350567675 | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page