The attractive traveling salesman problem
The attractive traveling salesman problem
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
59-69
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Cordeau, Jean-Francois
e9482d91-4f26-49c0-b9e1-16ffd8f0c665
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
16 May 2010
Erdogan, Gunes
468310a1-5c36-4c3d-8b39-079bd621b34b
Cordeau, Jean-Francois
e9482d91-4f26-49c0-b9e1-16ffd8f0c665
Laporte, Gilbert
b8210b8f-e942-4c5c-98b1-b55bd916aa70
Erdogan, Gunes, Cordeau, Jean-Francois and Laporte, Gilbert
(2010)
The attractive traveling salesman problem.
European Journal of Operational Research, 203 (1), .
(doi:10.1016/j.ejor.2009.06.029).
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
This record has no associated files available for download.
More information
e-pub ahead of print date: 4 July 2009
Published date: 16 May 2010
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 204819
URI: http://eprints.soton.ac.uk/id/eprint/204819
ISSN: 0377-2217
PURE UUID: 0c8af47f-0007-44ff-ad51-01b864d6b20d
Catalogue record
Date deposited: 02 Dec 2011 09:19
Last modified: 14 Mar 2024 04:32
Export record
Altmetrics
Contributors
Author:
Gunes Erdogan
Author:
Jean-Francois Cordeau
Author:
Gilbert Laporte
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics