A cooperative strategy for guiding the corridor method

Studies in Computational Intelligence

Volumn 236, Issue , 2009, Pages 273-286

  Caserta, Marco ^a   Voß, Stefan ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70349982089     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-642-03211-0_23     Document Type: Conference Paper

References (19)

1. Sniedovich, M.,AVoß, 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)
3. Potts, C., van de Velde, S.: Dynasearch - iterative local improvement by dynamic programming. Technical report, University of Twente (1995)
4. Thaler, R.H.: Toward a positive theory of consumer choice. Journal of Economic Behavior & Organization 1(1), 39-60
5. Kahneman, D., Knetsch, J.L., Thaler, R.H.: Experimental tests of the endowment effect and the Coase theorem. The Journal of Political Economy 98(6), 1325-1348 (1990)
6. 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)
7. Kim, K.H., Hong, G.P.: A heuristic rule for relocating blocks. Computers & Operations Research 33, 940-954 (2006)
8. Caserta, M., Voß, S., Sniedovich, M.: An algorithm for the blocks relocation problem. Working Paper, Institute of Information Systems, University of Hamburg (2008)
9. Stahlbock, R., Voß, S.: Operations rAsearch at container terminals: a literature update. OR Spectrum 30, 1-52 (2008)
10. 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)
11. Castilho, B., Daganzo, C.F.: Handling strategies for import containers at marine terminals. Transportation Research B 27(2), 151-166 (1993)
12. Kim, K.H.: Evaluation of the number of rehandles in container yards. Computers & Industrial Engineering 32(4), 701-711 (1997)
13. 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)
14. Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: An empirical study. Operations Research Letters 6, 107-114 (1987)
15. Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP. Technical report, AT&T Labs Research (2004)
16. 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)
17. 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)
18. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
19. Demasar, J.: Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research 7, 1-30 (2006)