Article ID: | iaor20082705 |
Country: | United Kingdom |
Volume: | 58 |
Issue: | 9 |
Start Page Number: | 1203 |
End Page Number: | 1213 |
Publication Date: | Sep 2007 |
Journal: | Journal of the Operational Research Society |
Authors: | Kozan E., Casey B. |
Keywords: | programming: integer, heuristics, simulation: applications |
Multimodal container terminals (MMCTs) are very complex and consequently require synchronization and balancing of container transfers at each node. The problem being investigated is the minimization of ship delays at the port by considering handling and travelling time of containers from the time the ship arrives at port until all the containers from that ship leave the port. When dealing with export containers, the problem would be that of the handling and travelling time of the containers from when they first arrive at the port until the ship carrying the containers departs from the port. Owing to the dynamic nature of the environment, a large number of timely decisions have been reviewed in accordance with the changing conditions of the MMCTs. The model has been run and tested with a small-size problem using CPLEX. A more realistic model is extremely difficult to solve and is in fact proven to be computationally intractable (NP-hard). Metaheuristics have been developed to deal with the intractability so that near-optimal solutions could be obtained in reasonable time.