3ImaiA., Sun X., Nishimura E., Papadimitriou S.. Berth allocation in a container port: using a continuous location space approach [J]. Transportation ResearchPartB, 2005, 39: 199- 221.
4Imai A., Nishimura E., Papadimitriou S.. The dynamic berth allocation problem for a container port[J]. Transportation Research Part B, 2001, 35(4): 401-417.
5Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority [J]. Transportation Research Part B, 2003, 37(5): 437-457.
6Cordeau J., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem [J]. Transportation Science, 2005, 39(4): 526-538.
7Monaco M., Sammarra M. The berth allocation problem: a strong formulation solved by a lagrangian approach [J]. Transportation Science, 2007, 41(2): 265-280.
8IMAI A, NISHIMURA E, PAPADIMITRIOUS S. Berth allocation at indented berths for mega-container ships[ J]. Eur J Operational Res, 2007, 179(2) : 579-593.
9CHEN C Y, HSIEH T W. A time space network model for the berth allocation problem[ C]//19th IFIPC7 Conf on Syst Modelling & Optimization, Cambridge, UK, 1999.
10GUAN Y, CHEUNG R K. The Berth allocation problem: models and solution methods[J]. OR Spectrum, 2004, 26(1 ) : 75-92.
