Front matter
3-12
Modelling genetic algorithms: From Markov chains to dependence with complete connections
Alexandru Agapie
13-22
On the optimization of unimodal functions with the (1+1) evolutionary algorithm
Stefan Droste, Thomas Jansen and Ingo Wegener
23-33
A timing analysis of convergence to fitness sharing equilibrium
Jeffrey Horn and David E. Goldberg
34-43
Where elitists start limping evolution strategies at ridge functions
Ahmet Irfan Oyman, Hans-Georg Beyer and Hans-Paul Schwefel
47-56
A bit-wise epistasis measure for binary search spaces
Cyril Fonlupt, Denis Robilliard and Philippe Preux
57-66
Inside GA dynamics: Ground basis for comparison
Leila Kallel
67-76
The effect of spin-flip symmetry on the performance of the simple GA
Bart Naudts and Jan Naudts
77-86
Fitness distance correlation and Ridge functions
R. J. Quick, V. J. Rayward-Smith and G. D. Smith
87-96
Accelerating the convergence of evolutionary algorithms by fitness landscape approximation
Alain Ratle
97-106
Modeling building-block interdependency
Richard A. Watson, Gregory S. Hornby and Jordan B. Pollack
109-118
Mutate large, but inherit small! On the analysis of rescaled mutations in (
[1\tilde],[(l)\tilde]\tilde 1,\tilde \lambda)-ES with noisy fitness data
Hans-Georg Beyer
119-128
Creating robust solutions by means of evolutionary algorithms
Jürgen Branke
129-138
Analytic curve detection from a noisy binary edge map using genetic algorithm
Samarjit Chakraborty and Kalyanmoy Deb
139-148
A comparison of dominance mechanisms and simple mutation on non-stationary problems
Jonathan Lewis, Emma Hart and Graeme Ritchie
149-158
Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm
Naoki Mori, Hajime Kita and Yoshikazu Nishikawa
159-168
Optimization with noisy function evaluations
Volker Nissen and Jörn Propach
169-177
On risky methods for local selection under noise
Günter Rudolph
178-187
Polygenic inheritance — A haploid scheme that can outperform diploidy
Conor Ryan and J. J. Collins
188-197
Averaging efficiently in the presence of noise
Peter Stagge
201-210
Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function
A. E. Eiben, J. I. van Hemert, E. Marchiori and A. G. Steenbeek
211-220
Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms
S. Kazarlis and V. Petridis
221-229
Landscape changes and the performance of Mapping Based Constraint handling methods
Dae Gyu Kim and Phil Husbands
231-240
A decoder-based evolutionary algorithm for constrained parameter optimization problems
Slawomir Koziel and Zbigniew Michalewicz
241-249
A spatial predator-prey approach to multi-objective optimization: A preliminary study
Marco Laumanns, Günter Rudolph and Hans-Paul Schwefel
250-259
Selective breeding in a multiobjective genetic algorithm
G. T. Parks and I. Miller
260-269
Niching and elitist models for MOGAs
Shigeru Obayashi, Shinichi Takahashi and Yukihiro Takeguchi
270-279
Parallel evolutionary optimisation with constraint propagation
Alvaro Ruiz-Andino, Lourdes Araujo, Jose Ruz and Fernando Sáenz
280-291
Methods to evolve legal phenotypes
Tina Yu and Peter Bentley
292-301
Multiobjective optimization using evolutionary algorithms — A comparative case study
Eckart Zitzler and Lothar Thiele
305-314
Utilizing dynastically optimal forma recombination in hybrid genetic algorithms
Carlos Cotta, Enrique Alba and José M. Troya
315-324
Further experimentations on the scalability of the GEMGA
Hillol Kargupta and Sanghamitra Bandyopadhyay
325-334
Indexed memory as a generic protocol for handling vectors of data in genetic programming
Ik Soo Lim and Daniel Thalmann
335-344
On genetic algorithms and lindenmayer systems
Gabriela Ochoa
345-353
Genome length as an evolutionary self-adaptation
Connie Loggia Ramsey, Kenneth A. De Jong, John J. Grefenstettc, Annie S. Wu and Donald S. Burke
357-366
Restart scheduling for genetic algorithms
Alex S. Fukunaga
367-377
A comparative study of global and local selection in evolution strategies
Martina Gorges-Schleuter
378-387
UEGO, an abstract niching technique for global optimization
Márk Jelasity
388-397
Development of problem-specific evolutionary algorithms
Alexander Leonhardi, Wolfgang Reissenberger, Tim Schmelmer, Karsten Weicker and Nicole Weicker
398-407
The effects of control parameters and restarts on search stagnation in evolutionary programming
K. E. Mathias, J. D. Schaffer, L. J. Eshelman and M. Mani
408-417
Accelerating the evolutionary-gradient-search procedure: Individual step sizes
Ralf Salomon
418-427
Extending population-based incremental learning to continuous search spaces
Michèle Sebag and Antoine Ducoulombier
428-437
Multi-parent recombination in genetic algorithms with search space boundary extension by mirroring
Shigeyoshi Tsutsui
438-447
Selective crossover in genetic algorithms: An empirical study
Kanta Vekaria and Chris Clack
448-457
Line-breeding schemes for combinatorial optimization
Rong Yang
461-470
Finding regions of uncertainty in learned models: An application to face detection
Shumeet Baluja
471-480
On ZCS in multi-agent environments
Larry Bull
481-490
Empirical analysis of the factors that affect the Baldwin effect
Kim W. C. Ku and M. W. Mak
491-500
Promoting generalisation of learned behaviours in genetic programming
Ibrahim Kuscu
501-510
Generalization in Wilson's classifier system
Pier Luca Lanzi
511-520
Symbiotic coevolution of artificial neural networks and training data sets
Helmut A. Mayer
521-529
Information-theoretic analysis of a mobile agent's learning in a discrete state space
Clemens Pötter
530-539
The coevolution of antibodies for concept learning
Mitchell A. Potter and Kenneth A. De Jong
540-549
Does data-model co-evolution improve generalization performance of evolving learners?
J. L. Shapiro
550-559
A corporate classifier system
Andy Tomlinson and Larry Bull
560-569
Applying diffusion to a cooperative coevolutionary model
R. Paul Wiegand
573-582
Studying parallel evolutionary algorithms: The cellular programming case
Mathieu Capcarrère, Andrea Tettamanzi, Marco Tomassini and Moshe Sipper
583-592
Learning to avoid moving obstacles optimally for mobile robots using a genetic-fuzzy approach
Kalyanmoy Deb, Dilip Kumar Pratihar and Amitabha Ghosh
593-602
Evolutionary neural networks for nonlinear dynamics modeling
I. De Falco, A. Iazzetta, P. Natale and E. Tarantino
603-612
Hybrid distributed real-coded genetic algorithms
Francisco Herrera, Manuel Lozano and Claudio Moraga
613-622
Mechanisms of emergent computation in cellular automata
Wim Hordijk, James P. Crutchfield and Melanie Mitchell
623-632
Towards designing neural network ensembles by evolution
Yong Liu and Xin Yao
633-642
Selection of training data for neural networks by a genetic algorithm
Colin R. Reeves and Stewart J. Taylor
643-652
Discovery with genetic algorithm scheduling strategies for cellular automata
Franciszek Seredyński
653-662
Simple + parallel + local = cellular computing
Moshe Sipper
663-670
Evolution, learning and speech recognition in changing acoustic environments
Anne Spalanzani and Harouna Kabré
673-682
Ant colonies for adaptive routing in packet-switched communications networks
Gianni Di Caro and Marco Dorigo
683-691
The stud GA: A mini revolution?
Wael Khatib and Peter J. Fleming
692-701
An island model based ant system with lookahead for the shortest supersequence problem
René Michel and Martin Middendorf
702-711
Parameter-free Genetic Algorithm inspired by “disparity theory of evolution”
Hidefumi Sawai and Sachio Kizu
712-721
Immune network dynamics for inductive problem solving
Vanio Slavov and Nikolay I. Nikolaev
722-731
Parallelization strategies for Ant Colony Optimization
Thomas Stützle
732-741
Self-organising pattern formation: Fruit flies and cell phones
Richard Tateson
745-754
A new genetic local search algorithm for graph coloring
RaphaËl Dorne and Jin-Kao Hao
755-764
Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions
Jens Gottlieb and Nico Voss
765-774
Memetic algorithms and the fitness landscape of the graph bi-partitioning problem
Peter Merz and Bernd Freisleben
775-784
Investigating evolutionary approaches to adaptive database management against various quality of service metrics
Martin J. Oates and David Corne
785-794
Genetic algorithm behavior in the MAXSAT domain
Soraya Rana and Darrell Whitley
795-802
An adaptive mutation scheme for a penalty-based graph-colouring GA
Peter Ross and Emma Hart
803-812
Inver-over operator for the TSP
Guo Tao and Zbigniew Michalewicz
813-822
Repair and brood selection in the traveling salesman problem
Tim Walters
823-832
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt
J. Watson, C. Ross, V. Eisele, J. Denton and J. Bins, et al.
835-844
Load balancing in parallel circuit testing with annealing-based and genetic algorithms
C. Gil, J. Ortega, A. F. Díaz, M. G. Montoya and A. Prieto
845-854
A heuristic combination method for solving job-shop scheduling problems
Emma Hart and Peter Ross
855-864
Reduction of air traffic congestion by genetic algorithms
Sofiane Oussedik and Daniel Delahaye
865-874
Timetabling the classes of an entire university with an evolutionary algorithm
Ben Paechter, R. C. Rankin, Andrew Cumming and Terence C. Fogarty
875-884
Genetic algorithms for the Multiple Container Packing Problem
Günther R. Raidl and Gabriele Kodydek
885-894
Buffer memory optimization in DSP applications: An evolutionary approach
Jürgen Teich, Eckart Zitzler and Shuvra Bhattacharyya
897-906
The Breeder Genetic Algorithm for frequency assignment
Christine Crisan and Heinz Mühlenbein
907-916
A permutation based Genetic Algorithm for minimum span frequency assignment
Christine Valenzuela, Steve Hurley and Derek Smith
917-926
Comparison of Evolutionary Algorithms for design optimization
Wilfried Jakob, Martina Gorges-Schleuter and Ingo Sieber
927-936
Aspects of digital evolution: Evolvability and architecture
Julian F. Miller and Peter Thomson
937-946
Integrated facility design using an evolutionary approach with a subordinate network algorithm
Bryan A. Norman, Alice E. Smith and Rifat Aykut Arapoglu
947-956
An evolutionary algorithm for synthesizing optical thin-film designs
Jinn-Moon Yang and Cheng-Yan Kao
959-967
Implementing genetic algorithms with sterical constraints for protein structure prediction
Eckart Bindewald, Jürgen Hesser and Reinhard Männer
968-977
Optimal placements of flexible objects: An adaptive simulated annealing approach
S. K. Cheung, K. S. Leung, A. Albrecht and C. K. Wong
978-987
Encapsulated Evolution strategies for the determination of group contribution model parameters in order to predict thermodynamic properties
Hannes Geyer, Peter Ulbig and Siegfried Schulz
988-997
Recombination operators for evolutionary graph drawing
Daniel Kobler and Andrea G. B. Tettamanzi
998-1007
Optimisation of density estimation models with evolutionary algorithms
Martin Kreutz, Anja M. Reimetz, Bernhard Sendhoff, Claus Weihs and Werner von Seelen
1008-1017
Genetic algorithm in parameter estimation of nonlinear dynamic systems
E. Paterakis, V. Petridis and A. Kehagias
1018-1027
Optimizing web page layout using an annealed genetic algorithm as client-side script
J. González Peñalver and J. J. Merelo
1028-1037
Solving the capacitor placement problem in a radial distribution system using an adaptive genetic algorithm
Koichi Hatta, Masashige Suzuki, Shin'ichi Wakabayashi and Tetsushi Koide