Novelty in the generation of initial population for genetic algorithms

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

Volumn 3214, Issue , 2004, Pages 268-275

  Karci, Ali ^a  

^a FIRAT UNIVERSITY   (Turkey)

Author keywords

Genetic algorithms; Initial population; Optimization

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; KNOWLEDGE BASED SYSTEMS; OPTIMIZATION; POPULATION STATISTICS;

BENCH-MARK PROBLEMS; COMPUTATIONAL PROCESS; CONTINUOUS VARIABLES; GENETIC ALGORITHM (GAS); GLOBAL NUMERICAL OPTIMIZATIONS; INITIAL POPULATION; PSEUDORANDOM SEQUENCES; UPPER AND LOWER BOUNDS;

GENETIC ALGORITHMS;

EID: 33750542870     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30133-2_35     Document Type: Article

References (17)

1. D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
2. M.A. Stybinski and T.S. Tang, Experiments in Nonconvex Optimization: Stochastic Approximmation and Function Smoothing and Simulated Annealing, Neural Networks, vol.3, pp:467-483, 1990.
3. W.W. Hager, W. Hearn, and P.M. Pardalos, Large Scale of Optimization: State of the Art, Kluwer, 1994.
4. C.A. Floudas, P.M. Pardalos, State of the Art in Global Optimization: Computational Methods and Applications, Kluwer, 1996.
5. Z. Michalewicz Genetic Algorithms+Data Structures=EvoIution Programs, SpringerVerlag, 1996.
6. P.Siany, G.Berthiau, F.Durbin, and J. Haussy, Enhanced Simulated Annealing for Global Minimizing Functions of Many-Continuous Variables, ACM Trans. Math. Software, vol. 23, pp:209-228,1997.
7. A. Karci, A. Çinar, B. Ergen, Genetik Algoritma Kullamlarak Minimum Dügüm Kapsama Probleminin Çözümü, Elektrik-Elektronik-Bilgisayar Mühendisliǧi 8. Ulusal Kongresi, 6-12 Eylül, Gaziantep, Türkiye, 20-23, 1999.
8. A. Karci, A. Arslan,Bidirectional Evolutionary Heuristic for the Minimum Vertex-Cover Problem, Journal of Computer and Electrical Engineering, Elsevier, vol.29, pp:l 11-120, 2003.
9. A. Karci, A. Cinar, Comparison of Uniform Distributed Initial Population Method and Random Initial Population Method in Genetic Search, 15 International Symposium on Computer and Information Sciences, October, 11-13, Istanbul, Turkey, 2000, pp. 159-166.
10. A. Karci, A. Arslan, Genetik Algoritmalarda Düzenli Populasyon, GAP IV: Mühendislik konferansi, 06-08 Haziran 2002, Harran Üniversites!, Şanhurfa.
11. A. Karci, A. Arslan, Uniform Population in Genetic Algorithms, Journal of Electrical and Electronics, Istanbul Ünv. Temmuz, 2002.
12. A. KARCI, Genetik Algoritmalarda Iraksama ve Yerel Coziimde Kalma Problemlerinin Giderilmesi, F. Ü. Fen Bilimleri Enst., 2002.
13. X. Yao, and Y. Liu, Fast Evolution Strategies Evolutionary Programming VI, Springer-Versag,pp.l51-161,1997.
14. P.Siarry, G.Berthiau, F.Durbin, and J.Haussy, Enhanced Simulated Annealing for Globally Minimizing Functions of Many-Continuous Variables, ACM Trans. Math. Software, vol.23, pp.209-228, 1997.
15. P.J.Angeline, Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and Performance Differences, Proc. Evol. Prog. VII, Springer-Verlag, 1998, pp.601-610.
16. K. Chellapilla, Combining Mutation Operators in Evolutionary Programming, IEEE Trans. Evol. Comput. Vol.2, pp.91-96, 1998.
17. Y.-W. Leung, Y. Wang, An Orthogonal Genetic Algorithm with Quantization for Global Numerical Optimization, Evolutionary Computation, MIT Press, vol.5, pp.41-53,2001.