A heuristic for retrieving containers from a yard

Computers and Operations Research

Volumn 37, Issue 6, 2010, Pages 1139-1147

  Lee, Yusin ^a   Lee, Yen Ju ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Container retrieval; Container terminal; Integer programming; Neighborhood search

Indexed keywords

BINARY INTEGERS; CONTAINER TERMINAL; LOWER BOUNDS; MIXED-INTEGER PROGRAMS; NEIGHBORHOOD SEARCH; NUMERICAL TESTING; REAL-WORLD APPLICATION; SECOND PHASE; WORKING TIME;

CONTAINERS; CONTROL THEORY; CRANES; DYNAMIC PROGRAMMING; HEURISTIC METHODS; PORT TERMINALS; RAILROAD YARDS AND TERMINALS;

INTEGER PROGRAMMING;

EID: 71749087908     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.10.005     Document Type: Article

References (7)

1. Kim K.H., Park Y.M., and Ryu K.-R. Deriving decision rules to locate export containers in container yards. European Journal of Operational Research 124 1 (2000) 89-101
2. Steenken D., Vo S., and Stahlbock R. Container terminal operation and operations research-a classification and literature review. OR Spektrum 26 1 (2004) 3-49
3. Kim K.H., and Bae J.W. Re-marshaling export containers in port container terminals. Computers & Industrial Engineering 35 3-4 (1998) 655-658
4. Lee Y., and Hsu N.-Y. An optimization model for the container pre-marshalling problem. Computers & Operations Research 34 11 (2007) 3295-3313
5. Lee Y, Chao S-L. A neighborhood search heuristic for pre-marshalling export containers. European Journal of Operational Research 2009;196(2):468-75
6. Kim K.H., and Hong G.-P. A heuristic rule for relocating blocks. Computers & Operations Research 33 4 (2006) 940-954
7. Avriel M., Penn M., Shpirer N., and Witteboon S. Stowage planning for container ships to reduce the number of shifts. Annals of Operations Research 76 (1998) 55-71