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.

Highlights

  • This paper considers a generalized version of the planar storage location assignment problem (PSLAP), which is a sub-class of the general storage location assignment problem (SLAP)

  • We have considered the two-dimensional RoRo ship stowage problem for one deck (2DRSSP), which is a generalized version of the planar storage location assignment problem

  • In order to keep the time spent on loading and unloading vehicles to a minimum and, reduce the time spent in port, a good stowage plan should minimize unnecessary movement of vehicles

Read more

Summary

Introduction

This paper considers a generalized version of the planar storage location assignment problem (PSLAP), which is a sub-class of the general storage location assignment problem (SLAP). The 2DRSSP is to assign vehicles (incoming products) to locations on the deck (storage zones) in order to minimize the time used on shifting vehicles (undesirable relocations), which means temporarily moving some vehicles to enable loading or unloading of other vehicles. They do not consider shifting as the cargoes can be accessed with a crane from above Another application of packing in maritime transportation is the stowage planning of container ships, see for example (Wei-Ying et al 2005; Tierney et al 2014; Ding and Chou 2015), as well as the survey by Iris and Pacino (2015). While the problem is formulated with respect to its industrial application, the proposed solution method may be applied to PSLAPs arising in other industries, such as the aforementioned assembly block stockyard operations, vehicle yard management (Cordeau et al 2011; Mattfeld and Orth 2006), and general cargo storage (e.g. unstackable pallets).

Problem definition and mathematical formulations
Adaptive large neighborhood search heuristic
Heuristic overview
Construction of an initial solution
Destroy operators
Neighbor removal
Area removal
Port removal
Shifting cost removal
Route removal
Repair operators
Greedy repair
Neighbor repair
Placement repair
Random repair
Shifting cost evaluation
Adaptiveness and acceptance criterion
Computational study
Test instances
Parameter tuning
Comparing solution methods
Extensive testing of the ALNS heuristic
Findings
Concluding remarks
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.