Optimization of Container Selection and Stowage Planning in a Circular Route

The results of a project intending to design and develop a microcomputer-based, interactive graphics decision support system for containership stowage planning are presented. The objective was to create a working prototype that would automate data management tasks and provide computational capabilities to allow the stowage planner to continuously assess vessel trim, stability, and strength characteristics. The paper provides a complete description of the decision support system developed to meet this objective, including a definition of the containership stowage problem, and details on the design and development of the Automated Stowage Plan Generation Routine (ASPGR). The paper concludes with a discussion of issues relevant to the implementation of the system in the maritime industry.

Download Full-text

Solution of the 3D Stochastic Stowage Planning for Con-tainer Ships through Representation by Rules

Procedings of the Fourth International Workshop on Knowledge Discovery, Knowledge Management and Decision Support ◽

10.2991/.2013.15 ◽

2013 ◽

Author(s):

Anibal Tavares de Azevedo ◽

Edilson Fernandes de Arruda ◽

Luiz Leduino de Salles Neto ◽

Antonio Augusto Chaves ◽

Antonio Carlos Moretti

Keyword(s):

Stowage Planning

Download Full-text

Study on Bay-filling Problem in Stowage Planning of Export Containers

Information Technology Journal ◽

10.3923/itj.2013.5967.5974 ◽

2013 ◽

Vol 12 (21) ◽

pp. 5967-5974 ◽

Cited By ~ 1

Author(s):

Zhao Ning ◽

Shen Yifan ◽

Chai Jiaqi ◽

Mi Chao ◽

Mi Weijian

Keyword(s):

Stowage Planning ◽

Filling Problem

Download Full-text

Joint Optimization of Multi-Port Container Selection and Stowage Planning

2019 IEEE 3rd Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC) ◽

10.1109/imcec46724.2019.8983968 ◽

2019 ◽

Author(s):

Ning Wang ◽

Xiaoyu Li ◽

Bo Wang

Keyword(s):

Joint Optimization ◽

Stowage Planning

Download Full-text

An adaptive large neighborhood search heuristic for the planar storage location assignment problem: application to stowage planning for Roll-on Roll-off ships

Journal of Heuristics ◽

10.1007/s10732-020-09451-z ◽

2020 ◽

Vol 26 (6) ◽

pp. 885-912

Author(s):

Jone R. Hansen ◽

Kjetil Fagerholt ◽

Magnus Stålhane ◽

Jørgen G. Rakke

Keyword(s):

Programming Model ◽

Mixed Integer ◽

Neighborhood Search ◽

Large Neighborhood Search ◽

Network Graph ◽

Adaptive Large Neighborhood Search ◽

Large Neighborhood ◽

Storage Location ◽

Stowage Planning ◽

Stowage Plan

Abstract This paper considers a generalized version of the planar storage location problem arising in the stowage planning for Roll-on/Roll-off ships. A ship is set to sail along a predefined voyage where given cargoes are to be transported between different port pairs along the voyage. We aim at determining the optimal stowage plan for the vehicles stored on a deck of the ship so that the time spent moving vehicles to enable loading or unloading of other vehicles (shifting), is minimized. We propose a novel mixed integer programming model for the problem, considering both the stowage and shifting aspect of the problem. An adaptive large neighborhood search (ALNS) heuristic with several new destroy and repair operators is developed. We further show how the shifting cost can be effectively evaluated using Dijkstra’s algorithm by transforming the stowage plan into a network graph. The computational results show that the ALNS heuristic provides high quality solutions to realistic test instances.

Download Full-text