Over het archief
Het OWA, het open archief van het Waterbouwkundig Laboratorium heeft tot doel alle vrij toegankelijke onderzoeksresultaten van dit instituut in digitale vorm aan te bieden. Op die manier wil het de zichtbaarheid, verspreiding en gebruik van deze onderzoeksresultaten, alsook de wetenschappelijke communicatie maximaal bevorderen.
Dit archief wordt uitgebouwd en beheerd volgens de principes van de Open Access Movement, en het daaruit ontstane Open Archives Initiative.
Basisinformatie over ‘Open Access to scholarly information'.
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
Parreño-Torres, C.; Çalık, H.; Alvarez-Valdes, R.; Ruiz, R. (2021). Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. Computers & Operations Research 133: 105383. https://dx.doi.org/10.1016/j.cor.2021.105383
In: Computers & Operations Research. PERGAMON-ELSEVIER SCIENCE LTD: Oxford. ISSN 0305-0548; e-ISSN 1873-765X, meer
|   |
| Trefwoord |
|
| Author keywords |
Container ship; Multiport stowage; Mathematical models; Matheuristics; Planning |
| Auteurs | | Top |
- Parreño-Torres, C.
- Çalik, H., meer
- Alvarez-Valdes, R.
- Ruiz, R.
|
|
|
| Abstract |
We focus on a simplified container stowage planning problem where containers of different size and weight must be loaded and unloaded at multiple ports while maintaining the stability of the ship. We initially investigate how the difficulty in solving the problem changes with and without the consideration of container sizes and weight constraints. For this purpose, we provide integer programming formulations for the general problem as well as some special cases with identical container size and/or identical weights and evaluate their performance in randomly generated small- and medium-scale instances. We develop a matheuristic procedure, namely, an insert-and-fix heuristic, exploiting the special structure of the proposed formulations. The Insert-and-Fix method, in combination with a constructive algorithm that gives the solver an initial solution in each iteration, provides solutions with a low number of rehandles for instances with up to 5000 TEUs. |
IMIS is ontwikkeld en wordt gehost door het VLIZ.
