返回
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
DOI:10.1016/j.cor.2021.105383.png)
摘要
En 中文
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.
Keyword:
Container ship
Multiport stowage
Mathematical models
Matheuristics
Planning
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Multi-Port Stowage Planning for Inland Container Liner Shipping Considering Weight Uncertainties考虑重量不确定性的内河集装箱班轮运输多港口计划
IEEE ACCESS
IF3.6
Tactical production and distribution planning with dependency issues on the production process具有对生产过程的依赖性问题的战术生产和分配计划
Intracellular free Ca2+ concentration in fowl spermatozoa and its relationship to motility and respiration in spermatozoa
Reproduction
IF0


