Back to Search

The attractive traveling salesman problem

Title	The attractive traveling salesman problem
Author	Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.
Publication Date:	2010-05-16
Publication Place	- Elsevier
Subject	Traveling Salesman Problem, Demand attraction, Demand allocation, Linearization, Branch-and-cut, Tabu search
Type	Periodical
Language	English
Digital	Yes
Manuscript	No
Library:	Özyeğin University
Library Asset ID	0377-2217
Record ID	b580c45c-c7b0-4574-9545-b13d4ae954a3
Library Location	Industrial Engineering
Date	2010-05-16
Notes	Due to copyright restrictions, the access to the full text of this article is only available via subscription.
Sample Text	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.
DOI	10.1016/j.ejor.2009.06.029
Cilt	203

View in source Özyeğin University Özyeğin University - Historical works, archives, and periodicals search engine

Özyeğin University

The attractive traveling salesman problem

Author Erdoğan, Güneş, Cordeau, J.-F., Laporte, G.

Publication Date 2010-05-16

Publication Place - Elsevier

Subject Traveling Salesman Problem, Demand attraction, Demand allocation, Linearization, Branch-and-cut, Tabu search

Type Periodical

Language English

Digital Yes

Manuscript No

Library Özyeğin University

Library Asset ID 0377-2217

Record ID b580c45c-c7b0-4574-9545-b13d4ae954a3

Library Location Industrial Engineering

Date 2010-05-16

Notes Due to copyright restrictions, the access to the full text of this article is only available via subscription.

Sample Text 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.

DOI 10.1016/j.ejor.2009.06.029

Cilt 203