A beam search algorithm for minimizing crane times in premarshalling problems
| dc.accrualmethod | CI | es_ES |
| dc.contributor.author | Parreño Torres, Consuelo | |
| dc.contributor.author | Álvarez-Valdés, R. | |
| dc.contributor.author | Parreño, Francisco | |
| dc.date.accessioned | 2023-05-26T10:21:10Z | |
| dc.date.available | 2023-05-27T04:45:06Z | |
| dc.date.issued | 2022 | es_ES |
| dc.description.abstract | 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. | es_ES |
| dc.description.provenance | Submitted 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.provenance | Approved 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.provenance | Made 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: 2022 | en |
| dc.embargo.terms | 0 days | es_ES |
| dc.identifier.citation | Parreñ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.doi | 10.1016/j.ejor.2022.01.038 | es_ES |
| dc.identifier.uri | https://hdl.handle.net/10550/86973 | |
| dc.language.iso | en | es_ES |
| dc.publisher | Elsevier | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.subject | logistics | es_ES |
| dc.subject | container premarshalling | es_ES |
| dc.subject | crane time | es_ES |
| dc.subject | beam search | es_ES |
| dc.subject.unesco | UNESCO::CIENCIAS TECNOLÓGICAS | es_ES |
| dc.title | A beam search algorithm for minimizing crane times in premarshalling problems | es_ES |
| dc.type | journal article | |
| dc.type.hasVersion | VoR | es_ES |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- 1-s2.0-S0377221722000753-main.pdf
- Size:
- 909.56 KB
- Format:
- Adobe Portable Document Format
- Description:

