Abstract
The stowage stack minimization problem with zero rehandle constraint (SSMP-ZR) aims to find a minimum number of stacks to accommodate all the containers in a multi-port voyage without occurring container rehandles. In this paper, we first give the integer models of the SSMP-ZR (with uncapacitated and capacitated stack height). Next, heuristic algorithms are proposed to construct solutions to the SSMP-ZR. The theoretical performance guarantee of the algorithms is then discussed. To evaluate the actual performance of the algorithms, we conduct experiments on a set of instances with practical size. The results demonstrate that our heuristic approaches can generate very promising solutions compared with the random loading solutions and integer programming solutions by CPLEX.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ambrosino, D., Anghinolfi, D., Paolucci, M., Sciomachen, A.: A new three-step heuristic for the Master Bay Plan Problem. Maritime Economics & Logistics 11(1), 98–120 (2009)
Avriel, M., Penn, M., Shpirer, N.: Container ship stowage problem: Complexity and connection to the coloring of circle graphs. Discrete Applied Mathematics 103(1), 271–279 (2000)
Avriel, M., Penn, M., Shpirer, N., Witteboon, S.: Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76, 55–71 (1998)
Dubrovsky, O., Levitin, G., Penn, M.: A genetic algorithm with a compact solution encoding for the container ship stowage problem. Journal of Heuristics 8(6), 585–599 (2002)
Garey, M.R., Johnson, D.S., Miller, G.L., Papadimitriou, C.H.: The Complexity of Coloring Circular Arcs and Chords. SIAM Journal Algebraic and Discrete Methods 1(2), 216–227 (1980)
Gavril, F.: Algorithms for a maximum clique and a maximum independent set of a circle graph. Networks 3(3), 261–273 (1973)
Gümüş, M., Kaminsky, P., Tiemroth, E., Ayik, M.: A multi-stage decomposition heuristic for the container stowage problem. In: Proceedings of the MSOM Conference (2008)
Imai, A., Sasaki, K., Nishimura, E., Papadimitriou, S.: Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. European Journal of Operational Research 171(2), 373–389 (2006)
Jensen, R.M.: On the complexity of container stowage planning. Tech. rep. (2010)
Salido, M.A., Sapena, O., Rodriguez, M., Barber, F.: A planning tool for minimizing reshuffles in container terminals. In: IEEE International Conference on Tools with Artificial Intelligence (2009)
Unger, W.: On the k-colouring of circle-graphs. In: Cori, R., Wirsing, M. (eds.) STACS 1988. LNCS, vol. 294, pp. 61–72. Springer, Heidelberg (1988)
Webster, W.C., Van Dyke, P.: Container loading: a container allocation model I and II: introduction, background, stragegy, conclusion. In: Computer-Aided Ship Design Engineering Summer Conference (1970)
Wilson, I.D., Roach, P.A.: Principles of combinatorial optimization applied to container-ship stowage planning. Journal of Heuristics 5(4), 403–418 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, N., Zhang, Z., Lim, A. (2014). The Stowage Stack Minimization Problem with Zero Rehandle Constraint. In: Ali, M., Pan, JS., Chen, SM., Horng, MF. (eds) Modern Advances in Applied Intelligence. IEA/AIE 2014. Lecture Notes in Computer Science(), vol 8482. Springer, Cham. https://doi.org/10.1007/978-3-319-07467-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-07467-2_48
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07466-5
Online ISBN: 978-3-319-07467-2
eBook Packages: Computer ScienceComputer Science (R0)