Corridor selection and fine tuning for the corridor method

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

Volumn 5851 LNCS, Issue , 2009, Pages 163-175

  Caserta, Marco ^a   Voß, Stefan ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL RESULTS; CONTAINER TERMINAL; FINE TUNING; HYBRID ALGORITHMS; INPUT SIZE; KEY PARAMETERS; METAHEURISTIC; PARAMETER VALUES; RELOCATION PROBLEM; RESPONSE SURFACE METHODOLOGY; SEARCH PROCESS; SPECIFIC PROBLEMS;

ALGORITHMS; BENCHMARKING; OPTIMIZATION; RELOCATION;

TUNING;

EID: 72449199072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11169-3_12     Document Type: Conference Paper

References (17)

1. Sniedovich, M., Voß, S.: The corridor method: a dynamic programming inspired metaheuristic. Control and Cybernetics 35(3), 551-578 (2006)
2. Caserta, M., Voß, S.: A cooperative strategy for guiding the corridor method. In: Kacprzyk, J. (ed.) Studies in Computational Intelligence. Springer, Heidelberg (2009)
3. Ergun, O., Orlin, J.: A dynamic programming methodology in very large scale neighborhood search applied to the traveling salesman problem. Discrete Optimization 3, 78-85 (2006)
4. Potts, C., van de Velde, S.: Dynasearch - iterative local improvement by dynamic programming. Technical report, University of Twente (1995)
5. Yang, J.H., Kim, K.H.: A grouped storage method for minimizing relocations in block stacking systems. Journal of Intelligent Manufacturing 17, 453-463 (2006)
6. Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33, 940-954 (2006)
7. Caserta, M., Voß, S., Sniedovich, M.: An algorithm for the blocks relocation problem. Working Paper, Institute of Information Systems, University of Hamburg (2008)
8. Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectrum 30, 1-52 (2008)
9. Watanabe, I.: Characteristics and analysis method of efficiencies of container terminal: an approach to the optimal loading/unloading method. Container Age 3, 36-47 (1991)
10. Castilho, B., Daganzo, C.: Handling strategies for import containers at marine terminals. Transportation Research B 27(2), 151-166 (1993)
11. Kim, K.H.: Evaluation of the number of rehandles in container yards. Computers & Industrial Engineering 32(4), 701-711 (1997)
12. Kim, K.H., Park, Y.M., Ryu, K.R.: Deriving decision rules to locate export containers in container yards. European Journal of Operational Research 124, 89-101 (2000)
13. Hart, J., Shogan, A.: Semi-greedy heuristics: an empirical study. Operations Research Letters 6, 107-114 (1987)
14. Festa, P., Resende, M.: An annotated bibliography of GRASP. Technical report, AT&T Labs Research (2004)
15. Box, G., Wilson, K.: On the experimental attainment of optimum conditions. Journal of the Royal Statistical Society Series B - 13, 1-45 (1951)
16. Caserta, M., Quiñonez, E.: A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times. Computers & Operations Research 36(2), 530-548 (2009)
17. Demšar, J.: Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7, 1-30 (2006)