A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
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 eli...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2015 |
| País: | México |
| Institución: | Universidad Autónoma de Nuevo León |
| Repositorio: | Redalyc-UANL |
| OAI Identifier: | oai:redalyc.org:49639089005 |
| Acceso en línea: | https://www.redalyc.org/articulo.oa?id=49639089005 |
| Access Level: | acceso abierto |
| Palabra clave: | Ingeniería relax and cut Lagrangean relaxation Traveling salesman problem |
| Sumario: | 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. |
|---|