Modeling the Berth Allocation problem in container terminals
暂无分享,去创建一个
Berth Allocation problems are usually studied by using bin-packing method, integer programming method and simulation methods. In this paper, non-Smooth optimization and nonlinear programming approaches are used to formulate the Berth Allocation problem as a general optimization model. The general model is given a nonlinear programming representation and the first-order optimality conditions.
[1] Andrew Lim,et al. The berth planning problem , 1998, Oper. Res. Lett..
[2] Andrew Lim,et al. A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..
[3] Gerald G. Brown,et al. Optimizing Ship Berthing , 1994 .
[4] K. K. Lai,et al. A STUDY OF CONTAINER BERTH ALLOCATION. , 1992 .
[5] Akio Imai,et al. Efficient planning of berth allocation for container terminals in Asia , 1997 .