Skip to main content
Erschienen in: OR Spectrum 2/2013

01.03.2013 | Regular Article

Simultaneous berth allocation and yard planning at tactical level

verfasst von: M. P. M. Hendriks, E. Lefeber, J. T. Udding

Erschienen in: OR Spectrum | Ausgabe 2/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We present a simultaneous berth allocation and yard planning problem at tactical level, since the berth allocation has a great impact on the yard planning and vice versa. This problem is solved by means of an alternating berth and yard planning heuristic approach. The alternating heuristic quickly converges to a local minimum which heavily depends on the starting point. Therefore, we formulate another optimization problem for generating a suitable starting point. A real size case study provided by PSA Antwerp shows that our approach to simultaneously solve both problems might reduce the total straddle carrier travel distance considerably as compared with a representative allocation.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202:615–627CrossRef Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202:615–627CrossRef
Zurück zum Zitat Brimberg J, Hansen P, Mladenović N, Salhi S (2008) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5:1–12 Brimberg J, Hansen P, Mladenović N, Salhi S (2008) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5:1–12
Zurück zum Zitat Cooper L (1964) The transportation-location problem. SIAM Rev 6:37–53CrossRef Cooper L (1964) The transportation-location problem. SIAM Rev 6:37–53CrossRef
Zurück zum Zitat Cordeau J-F, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur J Oper Res 176:1167–1184CrossRef Cordeau J-F, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur J Oper Res 176:1167–1184CrossRef
Zurück zum Zitat Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39:526–538CrossRef Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39:526–538CrossRef
Zurück zum Zitat Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B 44:232–245CrossRef Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B 44:232–245CrossRef
Zurück zum Zitat Han Y, Lee LH, Chew EP, Tan KC (2008) A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr 30:697–720CrossRef Han Y, Lee LH, Chew EP, Tan KC (2008) A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr 30:697–720CrossRef
Zurück zum Zitat Hendriks MPM (2009) Multi-step optimization of logistics networks strategic, tactical, and operational descisions. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands. Hendriks MPM (2009) Multi-step optimization of logistics networks strategic, tactical, and operational descisions. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
Zurück zum Zitat Hendriks MPM, Armbruster D, Laumanns M, Lefeber E, Udding JT (2012) Strategic allocation of cyclically calling vessels for multi-terminal container operators. Flex Serv Manuf J 24:248–273 Hendriks MPM, Armbruster D, Laumanns M, Lefeber E, Udding JT (2012) Strategic allocation of cyclically calling vessels for multi-terminal container operators. Flex Serv Manuf J 24:248–273
Zurück zum Zitat Hendriks MPM, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectr 32:501–517CrossRef Hendriks MPM, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectr 32:501–517CrossRef
Zurück zum Zitat Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179:579–593CrossRef Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179:579–593CrossRef
Zurück zum Zitat Imai A, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39:199–221CrossRef Imai A, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39:199–221CrossRef
Zurück zum Zitat Kim KH, Park KT (2003a) Dynamic space allocation for temporary storage. Int J Syst Sci 34:11–20CrossRef Kim KH, Park KT (2003a) Dynamic space allocation for temporary storage. Int J Syst Sci 34:11–20CrossRef
Zurück zum Zitat Kim KH, Park KT (2003b) A note on a dynamic space-allocation method for outbound containers. Eur J Oper Res 148:92–101CrossRef Kim KH, Park KT (2003b) A note on a dynamic space-allocation method for outbound containers. Eur J Oper Res 148:92–101CrossRef
Zurück zum Zitat Kim KH, Park Y-M, Jin M-J (2008) An optimal layout of container yards. OR Spectr 30:675–695CrossRef Kim KH, Park Y-M, Jin M-J (2008) An optimal layout of container yards. OR Spectr 30:675–695CrossRef
Zurück zum Zitat Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Trans Res Part B 37:541–560CrossRef Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Trans Res Part B 37:541–560CrossRef
Zurück zum Zitat Lee LH, Chew EP, Tan KC, Han Y (2006) An optimization model for storage yard management in transshipment hubs. OR Spectr 28:539–561CrossRef Lee LH, Chew EP, Tan KC, Han Y (2006) An optimization model for storage yard management in transshipment hubs. OR Spectr 28:539–561CrossRef
Zurück zum Zitat Moccia L, Cordeau J-F, Monaco MF, Sammarra M (2009) A column generation heuristic for a dynamic generalized assignment problem. Comput Oper Res 36:2670–2681CrossRef Moccia L, Cordeau J-F, Monaco MF, Sammarra M (2009) A column generation heuristic for a dynamic generalized assignment problem. Comput Oper Res 36:2670–2681CrossRef
Zurück zum Zitat Monaco MF, Sammarra M (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Trans Sci 41:265–280CrossRef Monaco MF, Sammarra M (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Trans Sci 41:265–280CrossRef
Zurück zum Zitat Moorthy R, Teo C-P (2006) Berth management in container terminal: the template design problem. OR Spectr 28:495–518CrossRef Moorthy R, Teo C-P (2006) Berth management in container terminal: the template design problem. OR Spectr 28:495–518CrossRef
Zurück zum Zitat Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131:282–292CrossRef Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131:282–292CrossRef
Zurück zum Zitat Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30:1–52 Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30:1–52
Zurück zum Zitat Wang FW, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42:2186–2196CrossRef Wang FW, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42:2186–2196CrossRef
Zurück zum Zitat Zhang C, Liu J, Wan Y-W, Murthy KG, Linn RJ (2003) Storage space allocation in container terminals. Trans Res Part B 37:883–903CrossRef Zhang C, Liu J, Wan Y-W, Murthy KG, Linn RJ (2003) Storage space allocation in container terminals. Trans Res Part B 37:883–903CrossRef
Metadaten
Titel
Simultaneous berth allocation and yard planning at tactical level
verfasst von
M. P. M. Hendriks
E. Lefeber
J. T. Udding
Publikationsdatum
01.03.2013
Verlag
Springer-Verlag
Erschienen in
OR Spectrum / Ausgabe 2/2013
Print ISSN: 0171-6468
Elektronische ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-012-0305-4

Weitere Artikel der Ausgabe 2/2013

OR Spectrum 2/2013 Zur Ausgabe