Models and Tabu Search Heuristics for the Berth-Allocation Problem

References

• Christiansen M., Fagerholt K., Ronen D. Ship routing and scheduling: Status and perspectives. Transportation Sci. (2004) 38:1–18Link, Google Scholar
• Cordeau J.-F., Gendreau M., Laporte G. A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks (1997) 30:105–119Crossref, Google Scholar
• Cordeau J.-F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. (2001) 52:928–936Crossref, Google Scholar
• Daganzo C. F. The productivity of multipurpose seaport terminals. Transportation Sci. (1990) 24:205–216Link, Google Scholar
• De Castilho B., Daganzo C. F. Handling strategies for import containers at marine terminals. Transportation Res. B (1993) 27:151–166Crossref, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability: A Guide to the Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Glover F. Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. (1986) 13:533–549Crossref, Google Scholar
• Imai A., Nagaiwa K., Chan W. T. 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. B (2001) 35:401–417Crossref, Google Scholar
• Imai A., Nishimura E., Papadimitriou S. Berth allocation with service priority. Transportation Res. B (2003) 37:437–457Crossref, Google Scholar
• Kim K. H., Moon K. C. Berth scheduling by simulated annealing. Transportation Res. B (2003) 37:541–569Crossref, Google Scholar
• Legato P., Monaco F., Sammarra M. Il problema del berth allocation. (2002) . Technical Report 2, Laboratorio di Logistica, Università della Calabria, ItalyGoogle Scholar
• Legato P., Monaco F., Tigani N. Berth planning at Gioia Tauro’s maritime terminal by logistic distribution models. Annual Conf. (2001) (AIRO, Cagliari, Italy) Google Scholar
• Lim A. The berth planning problem. Oper. Res. Lett. (1998) 22:105–110Crossref, 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
• Papadimitriou C. H., Steiglitz K.Combinatorial Optimization: Algorithms and Complexity (1982) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Park Y. M., Kim K. H. A scheduling method for berth and quay cranes. OR Spectrum (2003) 25:1–23Crossref, Google Scholar
• Pinedo M.Scheduling: Theory, Algorithms and Systems (1995) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Taleb-Ibrahimi M., Castilho B. D., Daganzo C. F. Storage space versus handling work in container terminals. Transportation Res. B (1993) 27:13–32Crossref, Google Scholar
• UNCTAD Review of maritime transport. (2004) . Technical report, United Nations, New York and GenevaGoogle Scholar
• Vis I. F. A., Koster R. D. Transshipment of containers at a container terminal: An overview. Eur. J. Oper. Res. (2003) 147:1–16Crossref, Google Scholar