Improved Tabu search heuristics for the dynamic space allocation problem

2008 ◽  
Vol 35 (10) ◽  
pp. 3347-3359 ◽  
Author(s):  
Alan R. McKendall Jr.
2012 ◽  
Vol 39 (3) ◽  
pp. 671-677 ◽  
Author(s):  
Geiza Cristina da Silva ◽  
Laura Bahiense ◽  
Luiz Satoru Ochi ◽  
Paulo Oswaldo Boaventura-Netto

2005 ◽  
Vol 39 (4) ◽  
pp. 526-538 ◽  
Author(s):  
Jean-François Cordeau ◽  
Gilbert Laporte ◽  
Pasquale Legato ◽  
Luigi Moccia

2003 ◽  
Vol 35 (6) ◽  
pp. 515-526 ◽  
Author(s):  
Sadan Kulturel-Konak ◽  
Alice E. Smith ◽  
David W. Coit

Author(s):  
Gamal Abd El-Nasser A. Said ◽  
El-Sayed M. El-Horbaty

Seaport container terminals are essential nodes in sea cargo transportation networks. In container terminal, one of the most important performance measures in container terminals is the service time. Storage space allocation operations contribute to minimizing the vessel service time. Storage space allocation problem at container terminals is a combinatorial optimization NP-hard problem. This chapter proposes a methodology based on Genetic Algorithm (GA) to optimize the solution for storage space allocation problem. A new mathematical model that reflects reality and takes into account the workload balance among different types of storage blocks to avoid bottlenecks in container yard operations is proposed. Also the travelling distance between vessels berthing positions and storage blocks at container yard is considered in this research. The proposed methodology is applied on a real case study data of container terminal in Egypt. The computational results show the effectiveness of the proposed methodology.


Sign in / Sign up

Export Citation Format

Share Document