SciELO - Scientific Electronic Library Online

 
vol.82 número191Intuitionistic fuzzy MOORA for supplier selectionA genetic algorithm to solve a three-echelon capacitated location problem for a distribution center within a solid waste management system in the northern region of Veracruz, Mexico índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


DYNA

versão impressa ISSN 0012-7353

Resumo

KAWASHIMA, Makswell Seyiti; RANGEL, Socorro; LITVINCHEV, Igor  e  INFANTE, Luis. A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem. Dyna rev.fac.nac.minas [online]. 2015, vol.82, n.191, pp.42-50. ISSN 0012-7353.  http://dx.doi.org/10.15446/dyna.v82n191.51144.

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.

Palavras-chave : traveling salesman problem; relax and cut; Lagrangean relaxation.

        · resumo em Espanhol     · texto em Inglês     · Inglês ( pdf )