New Bounds for Large Container Relocation Instances using Grasp
2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016)
| dc.creator | Díaz-Cifuentes, Camila Milagros | |
| dc.creator | Riff-Rojas, María Cristina | |
| dc.date | 2021-08-23T22:57:26Z | |
| dc.date | 2022-07-07T02:40:36Z | |
| dc.date | 2021-08-23T22:57:26Z | |
| dc.date | 2022-07-07T02:40:36Z | |
| dc.date | 2016 | |
| dc.date.accessioned | 2023-08-21T23:51:42Z | |
| dc.date.available | 2023-08-21T23:51:42Z | |
| dc.identifier | 1151456 | |
| dc.identifier | 1151456 | |
| dc.identifier | https://hdl.handle.net/10533/252052 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/8297594 | |
| dc.description | The Container Relocation Problem consists in finding the minimum number of moves to load a set of stacked container on a ship according to a given loading sequence. This is crucial problem for every commercial ports in the world. Minimizing the number of container relocation allows to minimize the operational costs (trucks cost and time). In this paper, we propose a Grasp algorithm to solve this problem. We have obtained new near-optimal solutions for this problem. | |
| dc.description | Regular 2015 | |
| dc.description | FONDECYT | |
| dc.description | FONDECYT | |
| dc.language | eng | |
| dc.relation | handle/10533/111557 | |
| dc.relation | handle/10533/111541 | |
| dc.relation | handle/10533/108045 | |
| dc.relation | https://doi.org/10.1109/ICTAI.2016.56 | |
| dc.rights | Atribución-NoComercial-SinDerivadas 3.0 Chile | |
| dc.rights | http://creativecommons.org/licenses/by-nc-nd/3.0/cl/ | |
| dc.rights | info:eu-repo/semantics/article | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.title | New Bounds for Large Container Relocation Instances using Grasp | |
| dc.title | 2016 IEEE 28TH INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2016) | |
| dc.type | Articulo | |
| dc.type | info:eu-repo/semantics/publishedVersion |