Recordeu que es poden pujar les aportacions als sexennis de l'ANECA al repositori institucional, sense necessitat d’esperar que s’òbriga la convocatòria. Fer-ho amb antelació pot evitar imprevistos tècnics i facilitar la gestió. Articles: S’han de dipositar mitjançant la passarel·la GREC/RODERIC. Llibres, capítols de llibre o dades de recerca: S’han de dipositar directament a través de RODERIC. ________________________________________ Recordad que se pueden subir las aportaciones a los sexenios de la ANECA al repositorio institucional, sin necesidad de esperar a que se abra la convocatoria. Hacerlo con tiempo puede evitar imprevistos técnicos y facilitar la gestión. Artículos: Deben depositarse mediante la pasarela GREC/RODERIC. Libros, capítulos de libro o datos de investigación: Deben depositarse directamente a través de RODERIC

A beam search algorithm for minimizing crane times in premarshalling problems

dc.accrualmethodCIes_ES
dc.contributor.authorParreño Torres, Consuelo
dc.contributor.authorÁlvarez-Valdés, R.
dc.contributor.authorParreño, Francisco
dc.date.accessioned2023-05-26T10:21:10Z
dc.date.available2023-05-27T04:45:06Z
dc.date.issued2022es_ES
dc.description.abstractThe 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.es_ES
dc.description.provenanceSubmitted by Yolanda Benlloch (yolanda.benlloch@uv.es) on 2023-05-25T13:49:24Z No. of bitstreams: 1 1-s2.0-S0377221722000753-main.pdf: 931385 bytes, checksum: be1311db96dfd2b2de5db9489986d358 (MD5)en
dc.description.provenanceApproved for entry into archive by M. Dolores Javega (m.dolores.javega@uv.es) on 2023-05-26T10:21:10Z (GMT) No. of bitstreams: 1 1-s2.0-S0377221722000753-main.pdf: 931385 bytes, checksum: be1311db96dfd2b2de5db9489986d358 (MD5)en
dc.description.provenanceMade available in DSpace on 2023-05-26T10:21:10Z (GMT). No. of bitstreams: 1 1-s2.0-S0377221722000753-main.pdf: 931385 bytes, checksum: be1311db96dfd2b2de5db9489986d358 (MD5) Previous issue date: 2022en
dc.embargo.terms0 dayses_ES
dc.identifier.citationParreño-Torres, C., Alvarez-Valdes, R., Parreño, F. (2022). A beam search algorithm for minimizing crane times in premarshalling problems. European Journal of Operational Research, 302 (3), 1063-1078.es_ES
dc.identifier.doi10.1016/j.ejor.2022.01.038es_ES
dc.identifier.urihttps://hdl.handle.net/10550/86973
dc.language.isoenes_ES
dc.publisherElsevieres_ES
dc.rights.accessRightsopen accesses_ES
dc.subjectlogisticses_ES
dc.subjectcontainer premarshallinges_ES
dc.subjectcrane timees_ES
dc.subjectbeam searches_ES
dc.subject.unescoUNESCO::CIENCIAS TECNOLÓGICASes_ES
dc.titleA beam search algorithm for minimizing crane times in premarshalling problemses_ES
dc.typejournal article
dc.type.hasVersionVoRes_ES

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
1-s2.0-S0377221722000753-main.pdf
Size:
909.56 KB
Format:
Adobe Portable Document Format
Description: