Reprint

Evolutionary Computation 2020

Edited by
December 2021
442 pages
  • ISBN978-3-0365-2394-1 (Hardback)
  • ISBN978-3-0365-2395-8 (PDF)

This book is a reprint of the Special Issue Evolutionary Computation 2020 that was published in

Computer Science & Mathematics
Engineering
Physical Sciences
Public Health & Healthcare
Summary

Intelligent optimization is based on the mechanism of computational intelligence to refine a suitable feature model, design an effective optimization algorithm, and then to obtain an optimal or satisfactory solution to a complex problem. Intelligent algorithms are key tools to ensure global optimization quality, fast optimization efficiency and robust optimization performance. Intelligent optimization algorithms have been studied by many researchers, leading to improvements in the performance of algorithms such as the evolutionary algorithm, whale optimization algorithm, differential evolution algorithm, and particle swarm optimization. Studies in this arena have also resulted in breakthroughs in solving complex problems including the green shop scheduling problem, the severe nonlinear problem in one-dimensional geodesic electromagnetic inversion, error and bug finding problem in software, the 0-1 backpack problem, traveler problem, and logistics distribution center siting problem. The editors are confident that this book can open a new avenue for further improvement and discoveries in the area of intelligent algorithms. The book is a valuable resource for researchers interested in understanding the principles and design of intelligent algorithms.

Format
  • Hardback
License
© 2022 by the authors; CC BY-NC-ND license
Keywords
global optimization; cuckoo search algorithm; Q-learning; mutation; self-adaptive step size; evolutionary computation; playtesting; game feature; game simulation; game trees; playtesting metric; validation; Pareto optimality; h-index; ranking; dominance; Pareto-front; multi-indicators; multi-metric; multi-resources; citation; universities ranking; swarm intelligence; simulated annealing; krill herd; particle swarm optimization; quantum; elephant herding optimization; engineering optimization; metaheuristic; constrained optimization; multi-objective optimization; single objective optimization; differential evolution; success-history; premature convergence; turning-based mutation; opposition-based learning; ant colony optimization; opposite path; traveling salesman problems; whale optimization algorithm; WOA; binary whale optimization algorithm; bWOA-S; bWOA-V; feature selection; classification; dimensionality reduction; menu planning problem; evolutionary algorithm; decomposition-based multi-objective optimisation; memetic algorithm; iterated local search; diversity preservation; multi-objective optimization; single-objective optimization; evolutionary algorithm; knapsack problem; travelling salesman problem; seed schedule; many-objective optimization; fuzzing; bug detection; path discovery; evolutionary algorithms (EAs); many-objective optimization; coevolution; dynamic learning; performance indicators; particle swarm optimization; magnetotelluric; one-dimensional inversions; geoelectric model; optimization problem; multi-task optimization; multi-task evolutionary computation; knowledge transfer; evolutionary algorithm; assortative mating; unified search space; quantum computing; differential evolution; grey wolf optimizer; evolutionary algorithm; 0-1 knapsack problem; green shop scheduling; fuzzy hybrid flow shop scheduling; discrete artificial bee colony algorithm; minimize makespan; minimize total energy consumption