The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization
- 248 Downloads
The berth scheduling problem deals with the assignment of vessels to berth space in a container terminal. Defining berth schedules in container terminal operations translates in meeting different objectives that are often non-commensurable and gaining an improvement on one objective often causes degrading performance on the others. In this paper the discrete space and dynamic arrival berth scheduling problem is studied and formulated for the first time via a hierarchical optimization framework, using two levels of hierarchy that differentiate between two conflicting objectives terminal operators face when defining vessel to berth assignments. For the resolution of this problem an interactive algorithm is developed based on the k-th best algorithm for the case where multi-objective functions are considered in the upper level. Computational examples showed that the proposed algorithm gives optimal or near optimal solutions that are comparable to the ones obtained by its single level formulation counterpart.
KeywordsContainer terminal operations Berth scheduling Multi-objective optimization Hierarchical optimization Bi-level k-th best algorithm
Unable to display preview. Download preview PDF.
- 4.Bialas W, Karwan M (1978) Multilevel linear programming. Technical Report 78-1, State University of New York at Buffalo. Operations Research ProgramGoogle Scholar
- 5.Boile M, Theofanis S, Golias MM (2008) A λ-opt based heuristic for the discrete berth scheduling problem. In proceedings of the 10th International Conference on Application of Advanced Technologies in Transportation. Athens, GreeceGoogle Scholar
- 6.Chankong V, Haimes YY (1983) Multi-objective decision making theory and methodology. North-Holland AmsterdamGoogle Scholar
- 14.Golias MM (2007) The discrete and continuous berth allocation problem: models and algorithms. Dissertation, Rutgers UniversityGoogle Scholar
- 15.Golias MM, Theofanis S, Boile M, Taboada HA (2009) A multi-objective decision and analysis approach for the berth scheduling problem. Int. J. Inf Technol Project Manage (Forthcoming)Google Scholar
- 16.Golias MM, Boile M, Theofanis S (2009) An adaptive time window partitioning based algorithm for the discrete and dynamic berth scheduling problem. J Transp Res Rec (Forthcoming)Google Scholar
- 21.Hooker NJ (1998) Constraint satisfaction methods for generating valid cuts. Available Online as: http://citeseer.ist.psu.edu/163317.html.
- 32.Pardalos MP, Du D-Z (1998) Handbook of combinatorial optimization: Vol: 1–3, Springer, New YorkGoogle Scholar
- 36.Rao JR, Papalambros PY (1989) A non-linear programming continuation strategy for one parameter design optimization problems. Proceedings of ASME Design Automation Conference, Montreal, Quebec, Canada, Sept. 17-20: 77-89.Google Scholar
- 37.Remde S, Cowling P, Dahal K, Colledge N (2007) Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling. Evolutionary Computation in Combinatorial Optimization. Springer Berlin/Heidelberg, pp.188–197Google Scholar
- 42.Taboada HA (2007) Multi-objective optimization algorithms considering objective preferences and solution clusters. Dissertation, Rutgers UniversityGoogle Scholar
- 43.Theofanis S, Boile M, Golias MM (2009) Container terminal berth planning: critical review of research approaches and practical challenges. J Transp Res RecGoogle Scholar
- 45.Xia H, Iz PH, Shi X (1996) Bi-level group decision and negotiation based on multi-criteria optimization and game theory, IEEE 2029-2034.Google Scholar