A GRASP algorithm for the container stowage slot planning problem
| Autor: | Francisco Parreño, Ramón Alvarez-Valdés, Dario Pacino |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Engineering
Operations research Heuristic (computer science) Container vessel stowage planning 0211 other engineering and technologies Transportation 02 engineering and technology Management Science and Operations Research SHIPS OPERATIONS NUMBER GRASP 0202 electrical engineering electronic engineering information engineering Heuristic algorithms LOADING PROBLEM Business and International Management Integer programming REDUCE Greedy randomized adaptive search procedure Civil and Structural Engineering Slot planning ECONOMICS 021103 operations research business.industry SHIFTS REACTIVE GRASP ENGINEERING PACKING PROBLEMS Packing problems Container (abstract data type) Stowage Benchmark (computing) 020201 artificial intelligence & image processing business SET |
| Zdroj: | Parreno, F, Pacino, D & Alvarez-Valdes, R 2016, ' A GRASP algorithm for the container stowage slot planning problem ', Transportation Research. Part E: Logistics and Transportation Review, vol. 94, pp. 141-157 . https://doi.org/10.1016/j.tre.2016.07.011 |
| ISSN: | 1366-5545 |
| DOI: | 10.1016/j.tre.2016.07.011 |
| Popis: | This work presents a generalization of the Slot Planning Problem which raises when the liner shipping industry needs to plan the placement of containers within a vessel (stowage planning). State-of-the-art stowage planning relies on a heuristic decomposition where containers are first distributed in clusters along the vessel. For each of those clusters a specific position for each container must be found. Compared to previous studies, we have introduced two new features: the explicit handling of rolled out containers and the inclusion of separations rules for dangerous cargo. We present a novel integer programming formulation and a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the problem. The approach is able to find high-quality solution within 1 s. We also provide comparison with the state-of-the-art on an existing and a new set of benchmark instances. (C) 2016 Elsevier Ltd. All rights reserved. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect