Genetic algorithms: No panacea, but a valuable tool for the operations researcher

INFORMS Journal on Computing

Volumn 9, Issue 3, 1997, Pages 263-265

  Reeves, Colin R ^a  

^a Institute for Clean Growth and Future Mobility   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0013632272     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.9.3.263     Document Type: Article

References (18)

1. C.C. AGGARWAL, J.B. ORLIN, and R.P. TAI, 1997. Optimized Crossover for the Independent Set Problem, Operations Research 45, 226-234.
2. M. BEHE, 1996. Darwin's Black Box: The Biochemical Challenge to Evolution, Free Press, New York.
3. K.D. BOESE, A.B. KAHNG, and S. MUDDU, 1994. A New Adaptive Multi-start Technique for Combinatorial Global Optimizations, Operations Research Letters 16, 101-113.
4. P. CHARDAIRE, J.L. LUTTON, and A. SUTTER, 1995. Thermostatistical Persistency: A Powerful Improving Concept for Simulated Annealing Algorithms, European Journal of Operational Research 86, 565-579.
5. J.C. CULBERSON, 1995. Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions, Evolutionary Computation 2, 279-311.
6. R. DAWKINS, 1986. The Blind Watchmaker, Longman, London.
7. L.J. ESHELMAN and J.D. SCHAFFER, 1995. Crossover's Niche, in Proceedings of 5th International Conference on Genetic Algorithms, S. Forrest (ed.), Morgan Kaufmann, San Mateo, CA, 9-14.
8. B. GOODWIN, 1995. How the Leopard Changed Its Spots, Weidenfeld and Nicholson, London.
9. C. HÖHN and C.R. REEVES, 1996. Graph Partitioning using Genetic Algorithms, in Proceedings of the 2nd Conference on Massively Parallel Computing Systems, G.R. Sechi (ed.), IEEE Computer Society, Los Alamitos, CA, 31-38.
10. C. HÖHN and C.R. REEVES, 1996. The Crossover Landscape for the onemax Problem, in Proceedings of the 2nd Nordic Workshop on Genetic Algorithms and their Applications, J. Alander (ed.), University of Vaasa Press, Vaasa, Finland, 27-43.
11. C. HÖHN and C.R. REEVES, 1996. Are Long Path Problems Hard for Genetic Algorithms? in Parallel Problem-Solving from Nature - PPSN IV, H-M. Voigt, W. Ebeling, I. Rechenberg, and H-P. Schwefel (eds.), Springer-Verlag, Berlin, 134-143.
12. S. KAUFFMAN, 1995. At Home in the Universe, Penguin, London.
13. K. MATHIAS and D. WHITLEY, 1993. Remapping Hyperspace during Genetic Search: Canonical Delta Folding, in Foundations of Genetic Algorithms 2, D. Whitley (ed.), Morgan Kaufmann, San Mateo, CA, 167-186.
14. V.J. RAYWARD-SMITH, 1995. A Unified Approach to Tabu Search, Simulated Annealing and Genetic Algorithms, in Applications of Modern Heuristic Techniques, V.J. Rayward-Smith (ed.), Alfred Waller, Henley-on-Thames, UK, 17-38.
15. C.R. REEVES, 1997. Landscapes, Operators and Heuristic Search, to appear in Annals of Operations Research.
16. C.R. REEVES, 1994. Genetic Algorithms and Neighbourhood Search, in Evolutionary Computing: AISB Workshop, Leeds, UK, April 1994; Selected Papers, T.C. Fogarty (ed.), Springer-Verlag, Berlin, 115-130.
17. D. WHITLEY, 1997. Personal communication.
18. T. YAMADA and R. NAKANO, 1996. Job-Shop Scheduling, in Genetic Algorithms in Engineering Systems, P.J. Fleming and A. Zalzala (eds.), Peter Peregrinus, London.