×

zbMATH — the first resource for mathematics

Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. (English) Zbl 1090.90009
Summary: The efficiency of a maritime container terminal primarily depends on the smooth and orderly process of handling containers, especially during the ship’s loading process. The stowage and associated loading plans are mainly determined by two criteria: ship stability and the minimum number of container rehandles required. The latter is based on the fact that most container ships have a cellular structure and that export containers are piled up in a yard. These two basic criteria are often in conflict. This paper is concerned with the ship’s container stowage and loading plans that satisfy these two criteria. The GM, list and trim are taken into account for the stability measurements. The problem is formulated as a multi-objective integer programming. In order to obtain a set of noninferior solutions of the problem, the weighting method is employed. A wide variety of numerical experiments demonstrated that solutions by this formulation are useful and applicable in practice.

MSC:
90B06 Transportation, logistics and supply chain management
90B50 Management decision making, including multiple objectives
90C59 Approximation methods and heuristics in mathematical programming
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Ahuja, R.K.; Orlin, J.B.; Tiwari, A., A greedy genetic algorithm for the quadratic assignment problem, Computers & operations research, 27, 917-934, (2000) · Zbl 0970.90067
[2] Ambrosino, D.; Sciomachen, A.; Tanfani., E., Stowing a containership: the master bay plan problem, Transportation research A, 38, 81-99, (2004)
[3] Amiouny, S.V.; Bartholdi, J.J.; Vande Vate, J.H.; Zhang, J., Balanced loading, Operations research, 40, 238-246, (1992) · Zbl 0825.90792
[4] Avriel, M.; Penn, M., Exact and approximate solutions of the container ship stowage problem, Computers & industrial engineering, 25, 271-274, (1993)
[5] Avriel, M.; Penn, M.; Shpirer, N., Container ship stowage problem: complexity and connection to the coloring of circle graphs, Discrete applied mathematics, 103, 271-279, (2000) · Zbl 0962.90049
[6] 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) · Zbl 0895.90082
[7] Cohon, J.L., Multiobjective programming and planning, (1978), Academic Press New York · Zbl 0462.90054
[8] de Castilho, B.; Daganzo, C.F., Handling strategies for import containers at marine terminals, Transportation research B, 27, 151-166, (1993)
[9] Derrett, D.R., Ship stability for masters and mates, (1999), Butterworth-Heinemann Oxford
[10] Dubrovsky, O.; Levitin, G.; Penn, M., A genetic algorithm with a compact solution encoding for the container ship stowage problem, Journal of heuristics, 8, 585-599, (2002)
[11] Haghani, A., Kaisar, E.I., 2001. A model for designing container loading plans for containerships. Presented in Annual Conference for Transportation Research Board.
[12] Imai, A.; Miki, T., A heuristic algorithm with expected utility for an optimal sequence of loading containers into a containerized ship, Journal of Japan institute of navigation, 80, 117-124, (1989), (in Japanese)
[13] Imai, A., Nishimura, E., Sasaki, K., Papadimitriou, S., 2001. Solution comparisons of algorithms for the containership loading problem. Proceedings of the International Conference on Shipping: Technology and Environment, available on CD-ROM.
[14] Imai, A.; Nishimura, E.; Papadimitriou, S.; Sasaki, K., The containership loading problem, International journal of maritime economics, 4, 126-148, (2002)
[15] Kim, K.H., Analysis of rehandles of transfer crane in a container yard, APORS-conference, 3, 357-365, (1994)
[16] Kim, K.H., Evaluation of the number of rehandles in container yards, Computers & industrial engineering, 32, 701-711, (1997)
[17] Kim, K.H., Kim, D.Y., 1994. Group storage methods at container port terminals. The Materials Handling Engineering Division of 75th Anniversary Commemorative Volume ASME, 15-20.
[18] Kim, K.H.; Park, Y.M.; Ryu, K.-R., Deriving decision rules to locate export containers in container yards, European journal of operational research, 124, 89-101, (2000) · Zbl 0960.90002
[19] Kim, K.H.; Kang, J.S.; Ryu, K.R., A beam search algorithm for the load sequencing of outbound containers in port container terminals, OR spectrum, 26, 93-116, (2004) · Zbl 1161.90410
[20] Martin, G.L.; Randhawa, S.U.; McDowell, E.D., Computerized container-ship load planning: A methodology and evaluation, Computers & industrial engineering, 14, 429-440, (1988)
[21] Martin-Vega, L.A., Aircraft load planning and the computer: description and review, Computers & industrial engineering, 9, 357-369, (1985)
[22] Mathur, K., An integer-programming-based heuristic for the balanced loading problem, Operations research letters, 22, 19-25, (1998) · Zbl 0914.90202
[23] Taleb-Ibrahimi, M.; de Castilho, B.; Daganzo, C.F., Storage space vs handling work in container terminals, Transportation research B, 27, 13-32, (1993)
[24] Todd, D.S.; Sen, P., A multiple criteria genetic algorithm for containership loading, Proceedings of the seventh international conference on genetic algorithms, 674-681, (1997)
[25] Wilson, I.D.; Roach, P.A., Principles of combinatorial optimization applied to container-ship stowage planning, Journal of heuristics, 5, 403-418, (1999) · Zbl 1071.90587
[26] Wilson, I.D.; Roach, P.A., Container stowage planning: A methodology for generating computerised solutions, Journal of the operational research society, 51, 1248-1255, (2000) · Zbl 1107.90318
[27] Wilson, I.D.; Roach, P.A.; Ware, J.A., Container stowage pre-planning: using search to generate solutions, a case study, Knowledge-based systems, 14, 137-145, (2001)
[28] Winter, T., 1999. Online and Real-Time Dispatching Problems, PhD thesis, Technical University of Braunschweig, Germany.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.