A corridor method-based algorithm for the pre-marshalling problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5484 LNCS, Issue , 2009, Pages 788-797

  Caserta, Marco ^a   Voß, Stefan ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTAINER TERMINAL; LOADING SEQUENCE; META-HEURISTIC APPROACH;

CARGO HANDLING; COMPUTER SCIENCE; SHIPS;

LOADING;

EID: 67650685263     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-01129-0_89     Document Type: Conference Paper

References (14)

1. Sniedovich, M., Voß, S.: The Corridor Method: a Dynamic Programming Inspired Metaheuristic. Control and Cybernetics 35(3), 551-578 (2006)
2. Ergun, Ö., Orlin, J.B.: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discrete Optimization 3, 78-85 (2006) (Pubitemid 43276319)
3. Potts, C., van de Velde, S.: Dynasearch-iterative local improvement by dynamic programming. Technical report, University of Twente (1995)
4. Steenken, D., Voß, S., Stahlbock, R.: Container terminal operations and operations research-a classification and literature review. OR Spectrum 26, 3-49 (2004) (Pubitemid 40549578)
5. Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectrum 30, 1-52 (2008)
6. Lee, Y., Chao, S.-L.: A Neighborhood Search Heuristic for Pre-marshalling Export Containers. European Journal of Operational Research (2008), doi:10.1016/j.ejor.2008.03.011
7. Lee, Y., Hsu, N.Y.: An optimization model for the container pre-marshalling problem. Computers & Operations Research 34, 3295-3313 (2007) (Pubitemid 46517858)
8. Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: An empirical study. Operations Research Letters 6, 107-114 (1987)
9. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. Technical report, AT&T Labs Research (2004)
10. Binato, S., Hery, W.J., Loewenstern, D., Resende, M.G.C.: A greedy randomized adaptive search procedure for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and surveys in metaheuristics, pp. 58-79. Kluwer Academic Publishers, Boston (2002)
11. Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing 12, 164-176 (2000)
12. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
13. Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33, 940-954 (2006) (Pubitemid 41492058)
14. Caserta, M., Voß, S., Sniedovich, M.: An algorithm for the blocks relocation problem. Working Paper, Institute of Information Systems, University of Hamburg (2008)