Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Emergent colonization and graph partitioning
SAB94 Proceedings of the third international conference on Simulation of adaptive behavior : from animals to animats 3: from animals to animats 3
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Tabu Search
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
A Taxonomy of Hybrid Metaheuristics
Journal of Heuristics
Evolutionary approaches to the design and organization of manufacturing systems
Computers and Industrial Engineering
Critical Parallelization of Local Search for MAX-SAT
AI*IA 01 Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Guest Editors' Introduction: Advanced Heuristics in Transportation and Logistics
IEEE Intelligent Systems
A fast hybrid genetic algorithm for the quadratic assignment problem
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
Automatic Creation of Taxonomies of Genetic Programming Systems
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
A survey on metaheuristics for stochastic combinatorial optimization
Natural Computing: an international journal
An Ant Algorithm for the Steiner Tree Problem in Graphs
Proceedings of the 2007 EvoWorkshops 2007 on EvoCoMnet, EvoFIN, EvoIASP,EvoINTERACTION, EvoMUSART, EvoSTOC and EvoTransLog: Applications of Evolutionary Computing
Decomposition, reformulation, and diving in university course timetabling
Computers and Operations Research
Two hybrid differential evolution algorithms for engineering design optimization
Applied Soft Computing
Two hybrid ant algorithms for the general T-colouring problem
International Journal of Bio-Inspired Computation
A new library for evolutionary algorithms
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
A unified view on hybrid metaheuristics
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
Evolutionary algorithm characterization in real parameter optimization problems
Applied Soft Computing
Exploration and exploitation in evolutionary algorithms: A survey
ACM Computing Surveys (CSUR)
Web Portal for Matching Loan Requests and Investment Offers in Peer-To-Peer Lending
International Journal of Web Portals
Metaheuristics for robust graph coloring
Journal of Heuristics
A classification scheme for agent based approaches to dynamic optimization
Artificial Intelligence Review
| Hi-index | 0.00 |
This paper shows how evolutionary algorithms can be described in aconcise, yet comprehensive and accurate way. A classification scheme isintroduced and presented in a tabular form called TEA (Table of EvolutionaryAlgorithms). It distinguishes between different classes of evolutionaryalgorithms (e.g., genetic algorithms, ant systems) by enumerating the fundamental ingredients of each of these algorithms. At the end, possible uses of the TEA are illustrated on classical evolutionary algorithms.