The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach

References

• Cordeau J.-F., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth allocation problem. Transportation Sci. (2005) 39:526–538Link, Google Scholar
• Fisher M. L. The Lagrangian relaxation method for solving integer programming problems. Management Sci. (1981) 27(1):1–18Link, Google Scholar
• Guang Y., Cheung R. K. The berth allocation problem: Models and solution methods. Oper. Res. Spectrum (2004) 26:75–92Crossref, Google Scholar
• Holguín-Veras J., Jara-Díaz S. Optimal pricing for priority service and space allocation in container ports. Transportation Res. Part B (1999) 33:81–106Crossref, Google Scholar
• Imai A., Nagaiawa K., Tat C. W. Efficient planning of berth allocation for container terminals in Asia. J. Advanced Transportation (1997) 31:75–94Crossref, Google Scholar
• Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Res. Part B (2001) 35:401–417Crossref, Google Scholar
• Imai A., Nishimura E., Papadimitriou S. Berth allocation problem with service priority. Transportation Res. Part B (2003) 37:437–457Crossref, Google Scholar
• Imai A., Sun X., Nishimura E., Papadimitriou S. Berth allocation problem in container port: Using a continuous space location approach. Transportation Res. Part B (2005) 39:129–121Crossref, Google Scholar
• Kim K. H., Moon K. C. Berth scheduling by simulated annealing. Transportation Res. Part B (2003) 37:541–560Crossref, Google Scholar
• Legato P., Monaco M. F., Sammarra M. Il problema del berth allocation. (2003) . Technical report, Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende (CS), ItalyGoogle Scholar
• Lim A. The berth planning problem. Oper. Res. Lett. (1998) 22:105–110Crossref, Google Scholar
• Lirn T. C., Thanopoulou H. A., Beynon M. J., Beresford A. K. C. An application of AHP on transhipment port selection: Global perspective. Transportation Res. Part A (2004) 6:70–91Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley and Sons, New York) Crossref, Google Scholar
• Nishimura E., Imai A., Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. Eur. J. Oper. Res. (2001) 131:282–292Crossref, Google Scholar
• Padberg M.Linear Optimization and Extensions (1995) (Springer, Berlin, Germany) Google Scholar
• Pinedo M.Scheduling—Theory, Algorithms and Systems (1995) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Queyranne M., Schulz A. Polyhedral approaches to machine scheduling. (1994) . Preprint 408/1994, Department of Mathematics, Technical University of Berlin, Berlin, Germany. citeseer.ist.psu.edu/queyranne94polyhedral.htmlGoogle Scholar
• Tongzon J., Heng W. Port privatization, efficiency and competitiveness: Some empirical evidence from container ports (terminals). Transportation Res. Part A (2005) 39:405–424Google Scholar
• United Nations Conference on Trade and Development (UNCTAD) Review of maritime transportation. (2004) . Technical report, New YorkGoogle Scholar