Local search operators in fast evolutionary programming

Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999

Volumn 2, Issue , 1999, Pages 1506-1513

  Birru, Hemanth K ^a   Chellapilla, Kumar ^b   Rao, S S ^a  

^a VILLANOVA UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONJUGATE GRADIENT METHOD; OPTIMIZATION;

CAUCHY MUTATION; FAST EVOLUTIONARY PROGRAMMING; FUNCTION OPTIMIZATION PROBLEMS; GAUSSIAN MUTATION; HYBRID METHOD; LOCAL SEARCH METHOD; LOCAL SEARCH OPERATORS; SOLUTION QUALITY;

EVOLUTIONARY ALGORITHMS;

EID: 84901396452     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.1999.782662     Document Type: Conference Paper

References (14)

1. Amin, S., Fernandez-Villacanas J. L. (1997), "Dynamic local search", Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, IEE: UK, pp. 129-132.
2. Bäck (1996), Evolutionary Algorithms in Theory and Practice Oxford Univ. Press.
3. Boscheti, R., Dentith M. C., and List R. D. (1996), "Inversion of seismic refraction data using genetic algorithms" Geophysics, vol. 61, No. 6, Nov.-Dec, pp. 1715-1727.
4. Chellapilla K., Hemanth K. Birru and S. S. Rao, "Effectiveness of Local Search Operators in Evolutionary Programming", Genetic Programming 98, Madi son, WI, Jul. 22-25, 1998.
5. Chellapilla K and Fogel D. B. (1997), "Two new mutation operators for enhanced search and optimization in evolutionary programming", SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, Conference 3165: Applications of Soft Computing, pp. 260-269, SPIE Press.
6. Dengiz B., Altiparmak F., Smith A. E. (1997), "Local search genetic algorithm for optimal design of reliable networks", IEEE Trans, on Evolutionary Computation, Vol. 1, No. 3, Sept. pp. 179-188.
7. Haupt R. L. (1994) "Thinned arrays using genetic algorithms", IEEE Trans, on Antennas and Propagation, vol. 42. no. 7, pp. 993-999.
8. Liang K.-H., Yao X., Liu Y., Newton C, and Hoffman D. (1998), "An experimental investigation of self-adaptation in evolutionary programming", Proc. of the Seventh Annual Conf. on Evolutionary Programming (EP'98), ztforthcoming.
9. Press W. H., Teukolsky S. A., Vetterling W. T., Flannery B. P. (1992), Numerical Recipes in C, NY: Cambridge Univ.
10. Rana, A. S., Zalzala A. M. S. (1997), "Collision-free motion planning of multiarm robots using evolutionary algorithms", Proceedings of the Institution of Mechanical Engineers, Part I: Journal of Systems and Control Engineering, Vol. 211, No. 15, pp. 373-84.
11. H.-P. Schwefel (1995), Evolution and optimum seeking. New York, John Wiley & Sons, Inc.
12. Solis F. J. and Wets R. J.-B. (1981), "Minimization by random search techniques", Mathematical Operations Research, Vol. 6, pp. 19-30.
13. Yao X. and Liu Y. (1996), "Fast evolutionary programming", Proc. of the Fifth Annual Conf. on Evolutionary Programming (EP'96), pp. 451-460, MIT Press.
14. Zi-Jiang Y, Hachino, T., Tsuji T. (1997), "On-line identification of continuous time-delay systems combining leastsquares techniques with a genetic algorithm", International Journal of Control, Vol. 66, No. 1, Jan. pp. 23-42.