×

zbMATH — the first resource for mathematics

Berth allocation at indented berths for mega-containerships. (English) Zbl 1114.90004
Summary: This paper addresses the berth allocation problem at a multi-user container terminal with indented berths for fast handling of mega-containerships. In a previous research conducted by the authors, the berth allocation problem at a conventional form of the multi-user terminal was formulated as a nonlinear mathematical programming, where more than one ship are allowed to be moored at a specific berth if the berth and ship lengths restriction is satisfied. In this paper, we first construct a new integer linear programming formulation for easier calculation and then the formulation is extended to model the berth allocation problem at a terminal with indented berths, where both mega-containerships and feeder ships are to be served for higher berth productivity. The berth allocation problem at the indented berths is solved by genetic algorithms. A wide variety of numerical experiments were conducted and interesting findings were explored.

MSC:
90B06 Transportation, logistics and supply chain management
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Brown, G.G.; Lawphongpanich, S.; Thurman, K.P., Optimizing ship berthing, Naval research logistics, 41, 1-15, (1994) · Zbl 0800.90579
[2] Brown, G.G.; Cormican, K.J.; Lawphongpanich, S.; Widdis, D.B., Optimizing submarine berthing with a persistence incentive, Naval research logistics, 44, 301-318, (1997) · Zbl 0889.90106
[3] Guan, Y.; Xiao, W.-Q.; Chueng, R.K.; Li, C.-L., A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis, Operations research letter, 30, 343-350, (2002) · Zbl 1010.90026
[4] Imai, A.; Nagaiwa, K.; Chan, W.T., Efficient planning of berth allocation for container terminals in Asia, Journal of advanced transportation, 31, 75-94, (1997)
[5] Imai, A.; Nishimura, E.; Papadimitriou, S., The dynamic berth allocation problem for a container port, Transportation research part B, 35, 401-417, (2001)
[6] Imai, A.; Nishimura, E.; Papadimitriou, S., Berth allocation with service priority, Transportation research part B, 37, 437-457, (2003)
[7] Imai, A.; Nishimura, E.; Papadimitriou, S., Corrigendum to “the dynamic berth allocation problem for a container port” [transportation research part B 35 (2001) 401-417], Transportation research part B, 39, 197, (2005)
[8] Imai, A.; Sun, X.; Nishimura, E.; Papadimitriou, S., Berth allocation in a container port: using a continuous location space approach, Transportation research part B, 39, 199-221, (2005)
[9] Kim, J.-U.; Kim, Y.-D., Simulated annealing and genetic algorithms for scheduling products with multi-level product structure, Computers and operations research, 23, 857-868, (1996) · Zbl 0859.90087
[10] Kim, K.H.; Moon, K.C., Berth scheduling by simulated annealing, Transportation research part B, 37, 541-560, (2003)
[11] Lai, K.K.; Shih, K., A study of container berth allocation, Journal of advanced transportation, 26, 45-60, (1992)
[12] Li, C.-L.; Cai, X.; Lee, C.-Y., Scheduling with multiple-job-on-one-processor pattern, IIE transactions, 30, 433-445, (1998)
[13] Lim, A., The berth planning problem, Operations research letters, 22, 105-110, (1998) · Zbl 0911.90283
[14] Nishimura, E.; Imai, A.; Papadimitriou, S., Berth allocation planning in the public berth system by genetic algorithms, European journal of operational research, 131, 282-292, (2001) · Zbl 0991.90074
[15] Park, K.T.; Kim, K.H., Berth scheduling for container terminals by using a sub-gradient optimization technique, Journal of the operational research society, 53, 1054-1062, (2002) · Zbl 1139.90330
[16] Park, Y.-M.; Kim, K.H., A scheduling method for berth and quay cranes, OR spectrum, 25, 1-23, (2003) · Zbl 1012.90011
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.