Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero

Detalhes bibliográficos
Autor(a) principal: Kawashima, Makswell Seyiti [UNESP]
Data de Publicação: 2015
Outros Autores: Rangel, Socorro [UNESP], Litvinchev, Igor, Infante, Luis
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.15446/dyna.v82n191.51144
http://hdl.handle.net/11449/167917
Resumo: 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.
id UNSP_7c1c9e9353ef4c179c4098f8cfb0ac93
oai_identifier_str oai:repositorio.unesp.br:11449/167917
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajeroA relax and cut approach using the multi-commodity flow formulation for the traveling salesman problemLagrangean relaxationRelax and cutTraveling salesman problemIn 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.UNESP -Univ Estadual PaulistaUANL-Universidad Autónoma de Nuevo LeónUNESP -Univ Estadual PaulistaUniversidade Estadual Paulista (Unesp)UANL-Universidad Autónoma de Nuevo LeónKawashima, Makswell Seyiti [UNESP]Rangel, Socorro [UNESP]Litvinchev, IgorInfante, Luis2018-12-11T16:38:51Z2018-12-11T16:38:51Z2015-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article42-50http://dx.doi.org/10.15446/dyna.v82n191.51144DYNA (Colombia), v. 82, n. 191, p. 42-50, 2015.0012-7353http://hdl.handle.net/11449/16791710.15446/dyna.v82n191.511442-s2.0-84937562217Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengDYNA (Colombia)0,167info:eu-repo/semantics/openAccess2021-10-23T17:37:41Zoai:repositorio.unesp.br:11449/167917Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462021-10-23T17:37:41Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
title Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
spellingShingle Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
Kawashima, Makswell Seyiti [UNESP]
Lagrangean relaxation
Relax and cut
Traveling salesman problem
title_short Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
title_full Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
title_fullStr Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
title_full_unstemmed Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
title_sort Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
author Kawashima, Makswell Seyiti [UNESP]
author_facet Kawashima, Makswell Seyiti [UNESP]
Rangel, Socorro [UNESP]
Litvinchev, Igor
Infante, Luis
author_role author
author2 Rangel, Socorro [UNESP]
Litvinchev, Igor
Infante, Luis
author2_role author
author
author
dc.contributor.none.fl_str_mv Universidade Estadual Paulista (Unesp)
UANL-Universidad Autónoma de Nuevo León
dc.contributor.author.fl_str_mv Kawashima, Makswell Seyiti [UNESP]
Rangel, Socorro [UNESP]
Litvinchev, Igor
Infante, Luis
dc.subject.por.fl_str_mv Lagrangean relaxation
Relax and cut
Traveling salesman problem
topic Lagrangean relaxation
Relax and cut
Traveling salesman problem
description 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.
publishDate 2015
dc.date.none.fl_str_mv 2015-01-01
2018-12-11T16:38:51Z
2018-12-11T16:38:51Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.15446/dyna.v82n191.51144
DYNA (Colombia), v. 82, n. 191, p. 42-50, 2015.
0012-7353
http://hdl.handle.net/11449/167917
10.15446/dyna.v82n191.51144
2-s2.0-84937562217
url http://dx.doi.org/10.15446/dyna.v82n191.51144
http://hdl.handle.net/11449/167917
identifier_str_mv DYNA (Colombia), v. 82, n. 191, p. 42-50, 2015.
0012-7353
10.15446/dyna.v82n191.51144
2-s2.0-84937562217
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv DYNA (Colombia)
0,167
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 42-50
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803046222733246464

Registros relacionados