The Attractive Traveling Salesman Problem

  title={The Attractive Traveling Salesman Problem},
  author={G{\"u}nes Erdogan and Jean-François Cordeau and Gilbert Laporte},
  journal={European Journal of Operational Research},
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… CONTINUE READING
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS


Publications referenced by this paper.
Showing 1-10 of 29 references

TSPLIB - A Traveling Salesman Problem Library

INFORMS Journal on Computing • 1991
View 5 Excerpts
Highly Influenced

The Gravity p-Median Model

T. Drezner, Z. Drezner
European Journal of Operational Research 179 • 2007
View 3 Excerpts

Multiple Facilities Location in the Plane Using the Gravity Model

T. Drezner, Z. Drezner
Geographical Analysis 38 • 2006
View 3 Excerpts


M. Labbé, G. Laporte
Rodriguez-Mart́ın, and J. J. Salazar González, Locating median cycles in networks, European Journal of Operational Research 160 • 2005

On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set

H. P. Benson
Journal of Optimization Theory and Applications 121 • 2004
View 2 Excerpts

A Note on Applying the Gravity Rule to the Airline Hub Problem

T. Drezner, Z. Drezner
Journal of Regional Science 41 • 2001
View 2 Excerpts

Similar Papers

Loading similar papers…