This book constitutes the refereed proceedings of the 5th International Conference on Parallel Problem Solving from Nature, PPSN V, held in Amsterdam, The Netherlands, in September 1998.
The 101 papers included in their revised form were carefully reviewed and selected from a total of 185 submissions. The book is divided into topical sections on convergence theory; fitness landscape and problem difficulty; noisy and non-stationary objective functions; multi-criteria and constrained optimization; representative issues; selection, operators, and evolution schemes; coevolution and learning; cellular automata, fuzzy systems, and neural networks; ant colonies, immune systems, and other paradigms; TSP, graphs, and satisfiability; scheduling, partitioning, and packing; design and telecommunications; and model estimations and layout problems.
Author(s): Alexandru Agapie (auth.), Agoston E. Eiben, Thomas Bäck, Marc Schoenauer, Hans-Paul Schwefel (eds.)
Series: Lecture Notes in Computer Science 1498
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1998
Language: English
Pages: 1585
Tags: Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Processor Architectures; Programming Techniques; Artificial Intelligence (incl. Robotics)
Modelling genetic algorithms: From Markov chains to dependence with complete connections....Pages 3-12
On the optimization of unimodal functions with the (1+1) evolutionary algorithm....Pages 13-22
A timing analysis of convergence to fitness sharing equilibrium....Pages 23-33
Where elitists start limping evolution strategies at ridge functions....Pages 34-43
A bit-wise epistasis measure for binary search spaces....Pages 47-56
Inside GA dynamics: Ground basis for comparison....Pages 57-66
The effect of spin-flip symmetry on the performance of the simple GA....Pages 67-76
Fitness distance correlation and Ridge functions....Pages 77-86
Accelerating the convergence of evolutionary algorithms by fitness landscape approximation....Pages 87-96
Modeling building-block interdependency....Pages 97-106
Mutate large, but inherit small! On the analysis of rescaled mutations in ( $$\tilde 1,\tilde \lambda$$ )-ES with noisy fitness data....Pages 109-118
Creating robust solutions by means of evolutionary algorithms....Pages 119-128
Analytic curve detection from a noisy binary edge map using genetic algorithm....Pages 129-138
A comparison of dominance mechanisms and simple mutation on non-stationary problems....Pages 139-148
Adaptation to a changing environment by means of the feedback thermodynamical genetic algorithm....Pages 149-158
Optimization with noisy function evaluations....Pages 159-168
On risky methods for local selection under noise....Pages 169-177
Polygenic inheritance — A haploid scheme that can outperform diploidy....Pages 178-187
Averaging efficiently in the presence of noise....Pages 188-197
Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function....Pages 201-210
Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms....Pages 211-220
Landscape changes and the performance of Mapping Based Constraint handling methods....Pages 221-229
A decoder-based evolutionary algorithm for constrained parameter optimization problems....Pages 231-240
A spatial predator-prey approach to multi-objective optimization: A preliminary study....Pages 241-249
Selective breeding in a multiobjective genetic algorithm....Pages 250-259
Niching and elitist models for MOGAs....Pages 260-269
Parallel evolutionary optimisation with constraint propagation....Pages 270-279
Methods to evolve legal phenotypes....Pages 280-291
Multiobjective optimization using evolutionary algorithms — A comparative case study....Pages 292-301
Utilizing dynastically optimal forma recombination in hybrid genetic algorithms....Pages 305-314
Further experimentations on the scalability of the GEMGA....Pages 315-324
Indexed memory as a generic protocol for handling vectors of data in genetic programming....Pages 325-334
On genetic algorithms and lindenmayer systems....Pages 335-344
Genome length as an evolutionary self-adaptation....Pages 345-353
Restart scheduling for genetic algorithms....Pages 357-366
A comparative study of global and local selection in evolution strategies....Pages 367-377
UEGO, an abstract niching technique for global optimization....Pages 378-387
Development of problem-specific evolutionary algorithms....Pages 388-397
The effects of control parameters and restarts on search stagnation in evolutionary programming....Pages 398-407
Accelerating the evolutionary-gradient-search procedure: Individual step sizes....Pages 408-417
Extending population-based incremental learning to continuous search spaces....Pages 418-427
Multi-parent recombination in genetic algorithms with search space boundary extension by mirroring....Pages 428-437
Selective crossover in genetic algorithms: An empirical study....Pages 438-447
Line-breeding schemes for combinatorial optimization....Pages 448-457
Finding regions of uncertainty in learned models: An application to face detection....Pages 461-470
On ZCS in multi-agent environments....Pages 471-480
Empirical analysis of the factors that affect the Baldwin effect....Pages 481-490
Promoting generalisation of learned behaviours in genetic programming....Pages 491-500
Generalization in Wilson's classifier system....Pages 501-510
Symbiotic coevolution of artificial neural networks and training data sets....Pages 511-520
Information-theoretic analysis of a mobile agent's learning in a discrete state space....Pages 521-529
The coevolution of antibodies for concept learning....Pages 530-539
Does data-model co-evolution improve generalization performance of evolving learners?....Pages 540-549
A corporate classifier system....Pages 550-559
Applying diffusion to a cooperative coevolutionary model....Pages 560-569
Studying parallel evolutionary algorithms: The cellular programming case....Pages 573-582
Learning to avoid moving obstacles optimally for mobile robots using a genetic-fuzzy approach....Pages 583-592
Evolutionary neural networks for nonlinear dynamics modeling....Pages 593-602
Hybrid distributed real-coded genetic algorithms....Pages 603-612
Mechanisms of emergent computation in cellular automata....Pages 613-622
Towards designing neural network ensembles by evolution....Pages 623-632
Selection of training data for neural networks by a genetic algorithm....Pages 633-642
Discovery with genetic algorithm scheduling strategies for cellular automata....Pages 643-652
Simple + parallel + local = cellular computing....Pages 653-662
Evolution, learning and speech recognition in changing acoustic environments....Pages 663-670
Ant colonies for adaptive routing in packet-switched communications networks....Pages 673-682
The stud GA: A mini revolution?....Pages 683-691
An island model based ant system with lookahead for the shortest supersequence problem....Pages 692-701
Parameter-free Genetic Algorithm inspired by “disparity theory of evolution”....Pages 702-711
Immune network dynamics for inductive problem solving....Pages 712-721
Parallelization strategies for Ant Colony Optimization....Pages 722-731
Self-organising pattern formation: Fruit flies and cell phones....Pages 732-741
A new genetic local search algorithm for graph coloring....Pages 745-754
Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions....Pages 755-764
Memetic algorithms and the fitness landscape of the graph bi-partitioning problem....Pages 765-774
Investigating evolutionary approaches to adaptive database management against various quality of service metrics....Pages 775-784
Genetic algorithm behavior in the MAXSAT domain....Pages 785-794
An adaptive mutation scheme for a penalty-based graph-colouring GA....Pages 795-802
Inver-over operator for the TSP....Pages 803-812
Repair and brood selection in the traveling salesman problem....Pages 813-822
The Traveling Salesrep Problem, Edge Assembly Crossover, and 2-opt....Pages 823-832
Load balancing in parallel circuit testing with annealing-based and genetic algorithms....Pages 835-844
A heuristic combination method for solving job-shop scheduling problems....Pages 845-854
Reduction of air traffic congestion by genetic algorithms....Pages 855-864
Timetabling the classes of an entire university with an evolutionary algorithm....Pages 865-874
Genetic algorithms for the Multiple Container Packing Problem....Pages 875-884
Buffer memory optimization in DSP applications: An evolutionary approach....Pages 885-894
The Breeder Genetic Algorithm for frequency assignment....Pages 897-906
A permutation based Genetic Algorithm for minimum span frequency assignment....Pages 907-916
Comparison of Evolutionary Algorithms for design optimization....Pages 917-926
Aspects of digital evolution: Evolvability and architecture....Pages 927-936
Integrated facility design using an evolutionary approach with a subordinate network algorithm....Pages 937-946
An evolutionary algorithm for synthesizing optical thin-film designs....Pages 947-956
Implementing genetic algorithms with sterical constraints for protein structure prediction....Pages 959-967
Optimal placements of flexible objects: An adaptive simulated annealing approach....Pages 968-977
Encapsulated Evolution strategies for the determination of group contribution model parameters in order to predict thermodynamic properties....Pages 978-987
Recombination operators for evolutionary graph drawing....Pages 988-997
Optimisation of density estimation models with evolutionary algorithms....Pages 998-1007
Genetic algorithm in parameter estimation of nonlinear dynamic systems....Pages 1008-1017
Optimizing web page layout using an annealed genetic algorithm as client-side script....Pages 1018-1027
Solving the capacitor placement problem in a radial distribution system using an adaptive genetic algorithm....Pages 1028-1037