Finding robust solutions using local search

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 1, 2004, Pages 89-103

  Sörensen, Kenneth ^a  

^a UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 18844443448     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000026710.74315.3e     Document Type: Article

References (17)

1. Aizawa, A. N. and Wah, B. W.: Scheduling of genetic algorithms in a noisy environment, Evolutionary Computation 2 (1994), 97-122.
2. Arnold, D. V.: Evolution strategies in noisy environments - a survey of existing work, In: L. Kallel, B. Naudts and A. Rogers (eds), Theoretical Aspects of Evolutionary Computing, Springer, Berlin, 2001, pp. 239-249.
3. I, λ.)-ES optimizing functions disturbed by generalized noise, In: K. A. De Jong, R. Poli and J. Rowe (eds), Foundations of Genetic Algorithms 7 (FOGA 2002), Morgan Kaufmann, San Francisco CA, 2003, pp. 307-328.
4. Branke, J.: Creating robust solutions by means of evolutionary algorithms, In: A. E. Eiben, T. Back, M. Schoenauer, and H.-P. Schwefel (eds), Parallel Problem Solving from Nature V, Lecture Notes in Comput. Sci. 1498, Springer, Berlin, 1998, pp. 119-128.
5. Branke, J.: Evolutionary Optimization in Dynamic Environments, Kluwer Acad. Publ., Dordrecht, 2001.
6. Branke, J.: Reducing the sampling variance when searching for robust solutions, In: L. Spector et al. (eds), GECCO 2001 - Proceedings of the Genetic and Evolutionary Computation Conference, Morgan Kaufmann, 2001, pp. 235-242.
7. Fitzpatrick, J. M. and Grefenstette, J. J.: Genetic algorithms in noisy environments, Machine Learning 3 (1988), 101-120.
8. Glover, F. and Hanafi, S.: Tabu search and finite convergence, Technical Report HCES-04-99, Hearin Centre for Entreprise Research, 1999.
9. Hunter, D.: An upper bound for the probability of a union, J. Appl. Probab. 13 (1976), 597-603.
10. Parmee, I. C.: The maintenance of search diversity for effective design space decomposition using cluster oriented genetic algorithms (COGAs) and multi-agent strategies (GAANT), In: I. C. Parmee (eds), Proceedings of Adaptive Computing in Engineering Design and Control, Plymouth, 1996, pp. 128-138.
11. Reeves, C. R.: A genetic algorithm approach to stochastic flowshop sequencing. In: Proceedings of the IEE Colloquium on Genetic Algorithms for Control and Systems Engineering, volume Digest No. 1992/106, London, 1992, pp. 131-134.
12. Sedgewick, R.: Algorithms, Addison-Wesley, New York, 1988.
13. Stagge, P.: Averaging efficiently in the presence of noise, In: A. E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel (eds), Parallel Problem Solving from Nature V, Lecture Notes in Comput. Sci. 1498, Springer, Berlin, 1998, pp. 188-197.
14. Tsutsui, S.: A comparative study on the effects of adding perturbations to phenotypic parameters in genetic algorithms with a robust solution searching scheme, In: Proceedings of the 1999 IEEE Systems, Man, and Cybernetics Conference (SMC'99 Tokyo), 1999, pp. III-585-591.
15. Tsutsui, S. and Ghosh, A.: Genetic algorithms with a robust solution searching scheme, IEEE Trans. Evolutionary Comput. 1 (1997), 201-208.
16. Tsutsui, S., Ghosh, A. and Fujimoto, Y.: A robust solution searching scheme in genetic search, In: H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-P. Schwefel (eds), Parallel Problem Solving from Nature - PPSNIV, Vol. 10, Springer, Berlin, 1996, pp. 543-552.
17. Wiesmann, D., Hammel, U. and Back, T.: Robust design of multilayer optical coatings by means of evolutionary algorithms, IEEE Trans. Evolutionary Comput. 2 (1998), 162-167.