Beam-ACO for the travelling salesman problem with time windows

The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method that combines ant colo...

Descripción completa

Detalles Bibliográficos
Autores: López Ibáñez, Manuel, Blum, Christian
Tipo de recurso: informe técnico
Fecha de publicación:2009
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/88010
Acceso en línea:https://hdl.handle.net/2117/88010
Access Level:acceso abierto
Palabra clave:Ant colony optimization
Beam search
Hybridization
Travelling salesman
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_1f8a7d2c1aedf39b6f72cb910e56c57f
oai_identifier_str oai:upcommons.upc.edu:2117/88010
network_acronym_str ES
network_name_str España
repository_id_str
spelling Beam-ACO for the travelling salesman problem with time windowsLópez Ibáñez, ManuelBlum, ChristianAnt colony optimizationBeam searchHybridizationTravelling salesmanÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaThe travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method that combines ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and computationally inexpensive bounding information for differentiating between partial solutions. This work uses stochastic sampling as a useful alternative. An extensive experimental evaluation on seven benchmark sets from the literature shows that the proposed Beam-ACO algorithm is currently a state-of-the-art technique for the travelling salesman problem with time windows under travel-cost optimization.20092009-07-0120162016-06-15reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/88010reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/880102026-05-27T15:37:01Z
dc.title.none.fl_str_mv Beam-ACO for the travelling salesman problem with time windows
title Beam-ACO for the travelling salesman problem with time windows
spellingShingle Beam-ACO for the travelling salesman problem with time windows
López Ibáñez, Manuel
Ant colony optimization
Beam search
Hybridization
Travelling salesman
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Beam-ACO for the travelling salesman problem with time windows
title_full Beam-ACO for the travelling salesman problem with time windows
title_fullStr Beam-ACO for the travelling salesman problem with time windows
title_full_unstemmed Beam-ACO for the travelling salesman problem with time windows
title_sort Beam-ACO for the travelling salesman problem with time windows
dc.creator.none.fl_str_mv López Ibáñez, Manuel
Blum, Christian
author López Ibáñez, Manuel
author_facet López Ibáñez, Manuel
Blum, Christian
author_role author
author2 Blum, Christian
author2_role author
dc.subject.none.fl_str_mv Ant colony optimization
Beam search
Hybridization
Travelling salesman
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Ant colony optimization
Beam search
Hybridization
Travelling salesman
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description The travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper proposes a Beam-ACO algorithm, which is a hybrid method that combines ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and computationally inexpensive bounding information for differentiating between partial solutions. This work uses stochastic sampling as a useful alternative. An extensive experimental evaluation on seven benchmark sets from the literature shows that the proposed Beam-ACO algorithm is currently a state-of-the-art technique for the travelling salesman problem with time windows under travel-cost optimization.
publishDate 2009
dc.date.none.fl_str_mv 2009
2009-07-01
2016
2016-06-15
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/88010
url https://hdl.handle.net/2117/88010
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869404406406971392
score 15,300724

Similares en LA Referencia