A beam search algorithm for minimizing crane times in premarshalling problems

The premarshalling problem consists of sorting the containers placed in a bay of the container yard so that they can be retrieved in the order in which they will be required. We study the premarshalling problem with crane time minimization objective and develop a beam search algorithm, with some new...

ver descrição completa

Detalhes bibliográficos
Autores: Parreño Torres, Consuelo, Álvarez Valdés, Ramón, Parreño Torres, Francisco
Formato: artículo
Fecha de publicación:2022
País:España
Recursos:Universidad de Castilla-La Mancha
Repositorio:RUIdeRA. Repositorio Institucional de la UCLM
OAI Identifier:oai:ruidera.uclm.es:10578/33908
Acesso em linha:https://hdl.handle.net/10578/33908
Access Level:acceso abierto
Palavra-chave:Beam search
Container premarshalling
Crane time
Logistics
id ES_7af090c2fd096be15ea327df403c4ced
oai_identifier_str oai:ruidera.uclm.es:10578/33908
network_acronym_str ES
network_name_str España
repository_id_str
spelling A beam search algorithm for minimizing crane times in premarshalling problemsParreño Torres, ConsueloÁlvarez Valdés, RamónParreño Torres, FranciscoBeam searchContainer premarshallingCrane timeLogisticsThe premarshalling problem consists of sorting the containers placed in a bay of the container yard so that they can be retrieved in the order in which they will be required. We study the premarshalling problem with crane time minimization objective and develop a beam search algorithm, with some new elements adapted to the characteristics of the problem, to solve it. We propose various evaluation criteria, depending on the type of container movement, for its local evaluation; a new heuristic algorithm including local search for blue its global evaluation; and several new dominance rules. The computational study shows the contribution of each new element. The performance of the complete algorithm is tested on well-known benchmarks. The beam search algorithm matches all known optimal solutions, improves on the known suboptimal solutions, and obtains solutions for the largest instances, for which no solution had previously been found.Elsevier202420242022info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://hdl.handle.net/10578/33908reponame:RUIdeRA. Repositorio Institucional de la UCLMinstname:Universidad de Castilla-La ManchaInglésRTI2018-094940-B100SBPLY/17/180501/000282BU056P20info:eu-repo/semantics/openAccessoai:ruidera.uclm.es:10578/339082026-05-27T07:36:41Z
dc.title.none.fl_str_mv A beam search algorithm for minimizing crane times in premarshalling problems
title A beam search algorithm for minimizing crane times in premarshalling problems
spellingShingle A beam search algorithm for minimizing crane times in premarshalling problems
Parreño Torres, Consuelo
Beam search
Container premarshalling
Crane time
Logistics
title_short A beam search algorithm for minimizing crane times in premarshalling problems
title_full A beam search algorithm for minimizing crane times in premarshalling problems
title_fullStr A beam search algorithm for minimizing crane times in premarshalling problems
title_full_unstemmed A beam search algorithm for minimizing crane times in premarshalling problems
title_sort A beam search algorithm for minimizing crane times in premarshalling problems
dc.creator.none.fl_str_mv Parreño Torres, Consuelo
Álvarez Valdés, Ramón
Parreño Torres, Francisco
author Parreño Torres, Consuelo
author_facet Parreño Torres, Consuelo
Álvarez Valdés, Ramón
Parreño Torres, Francisco
author_role author
author2 Álvarez Valdés, Ramón
Parreño Torres, Francisco
author2_role author
author
dc.subject.none.fl_str_mv Beam search
Container premarshalling
Crane time
Logistics
topic Beam search
Container premarshalling
Crane time
Logistics
description The premarshalling problem consists of sorting the containers placed in a bay of the container yard so that they can be retrieved in the order in which they will be required. We study the premarshalling problem with crane time minimization objective and develop a beam search algorithm, with some new elements adapted to the characteristics of the problem, to solve it. We propose various evaluation criteria, depending on the type of container movement, for its local evaluation; a new heuristic algorithm including local search for blue its global evaluation; and several new dominance rules. The computational study shows the contribution of each new element. The performance of the complete algorithm is tested on well-known benchmarks. The beam search algorithm matches all known optimal solutions, improves on the known suboptimal solutions, and obtains solutions for the largest instances, for which no solution had previously been found.
publishDate 2022
dc.date.none.fl_str_mv 2022
2024
2024
dc.type.none.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/10578/33908
url https://hdl.handle.net/10578/33908
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv RTI2018-094940-B100
SBPLY/17/180501/000282
BU056P20
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RUIdeRA. Repositorio Institucional de la UCLM
instname:Universidad de Castilla-La Mancha
instname_str Universidad de Castilla-La Mancha
reponame_str RUIdeRA. Repositorio Institucional de la UCLM
collection RUIdeRA. Repositorio Institucional de la UCLM
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869411477333475328
score 15,300719

Registos relacionados