On the Performance of the Subtour Elimination Constraints Approach for the p -Regions Problem: A Computational Study

2017 ◽  
Vol 50 (1) ◽  
pp. 32-52 ◽  
Author(s):  
Juan Carlos Duque ◽  
Mario C. Vélez-Gallego ◽  
Laura Catalina Echeverri
Keyword(s):  
Computational Study ◽  
Subtour Elimination

scholarly journals A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem

DYNA ◽  
2015 ◽  
Vol 82 (191) ◽  
pp. 42-50 ◽  
Author(s):  
Makswell Seyiti Kawashima ◽  
Socorro Rangel ◽  
Igor Litvinchev ◽  
Luis Infante
Keyword(s):  
Traveling Salesman Problem ◽  
Execution Time ◽  
Computational Study ◽  
Traveling Salesman ◽  
Commodity Flow ◽  
Asymmetric Traveling Salesman Problem ◽  
Subtour Elimination ◽  
The Traveling Salesman Problem ◽  
Dual Bounds

<p class="ADYNAAbstrac"><span lang="EN-US">In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the literature that computes the Lagrangean multipliers associated to the subtour elimination constraints preserving the optimality of the multipliers associated to the assignment constraints. The results obtained by the computational study are encouraging and show that the proposed algorithm generated good dual bounds for the ATSP with a low execution time.</span></p>

Sign in / Sign up

Export Citation Format

Share Document