EconPapers    
Economics at your fingertips  
 

Mathematical modelling of container transfers and storage locations at seaport terminals

Erhan Kozan () and Peter Preston ()
Additional contact information
Erhan Kozan: Queensland University of Technology
Peter Preston: Queensland University of Technology

A chapter in Container Terminals and Cargo Systems, 2007, pp 87-105 from Springer

Abstract: Abstract This paper models the seaport system with the objective of determining the optimal storage strategy and container-handling schedule. It presents an iterative search algorithm that integrates a container-transfer model with a container-location model in a cyclic fashion to determine both optimal locations and corresponding handling schedule. A genetic algorithm (GA), a tabu search (TS) and a tabu search/genetic algorithm hybrid are used to solve the problem. The implementation of these models and algorithms are capable of handling the very large problems that arise in container terminal operations. Different resource levels are analysed and a comparison with current practise at an Australian port is done.

Keywords: Scheduling; Heuristics; Containers; Seaports; Genetic algorithms; Tabu search (search for similar items in EconPapers)
Date: 2007
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-49550-5_5

Ordering information: This item can be ordered from
http://www.springer.com/9783540495505

DOI: 10.1007/978-3-540-49550-5_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-23
Handle: RePEc:spr:sprchp:978-3-540-49550-5_5