Erdoğan, GüneşCordeau, J.-F.Laporte, G.2012-12-062012-12-062010-05-160377-2217http://hdl.handle.net/10679/261https://doi.org/10.1016/j.ejor.2009.06.029Due to copyright restrictions, the access to the full text of this article is only available via subscription.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.engrestrictedAccessarticle2031596900027207310000710.1016/j.ejor.2009.06.029Traveling Salesman ProblemDemand attractionDemand allocationLinearizationBranch-and-cutTabu search2-s2.0-70350567675