Abstract
This paper extends the problem of stowing a given set of different type containers in the available slots of a containership, i.e. the so-called master bay plan problem (MBPP), to the multi-port master bay plan problem (MP-MBPP). MP-MBPP considers the whole route of the ship and the different sets of containers which must be loaded at each port of the route for shipping to successive ports. The sequence of alternate unloading and loading operations is relevant for the effectiveness of stowage plans. This paper introduces two exact mixed integer programming (MIP) models for MP-MBPP, aimed to deal with practical and operative aspects of the problem. It also examines some computationally efficient relaxed formulations of the proposed MIP models and reports an extensive computational experimentation performed on real size instances. The results show the effectiveness of the proposed models and the related resolution methods.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
