Umfang:
1 Online-Ressource(XIV, 209 p. 46 illus., 28 illus. in color.)
Ausgabe:
1st ed. 2022.
ISBN:
9783031041488
Serie:
Lecture Notes in Computer Science 13222
Inhalt:
On Monte Carlo Tree Search for Weighted Vertex Coloring -- A RNN-based Hyper-heuristic for combinatorial problems -- Algorithm Selection for the Team Orienteering Problem -- Performance evaluation of a parallel ant colony optimization for the real-time train routing selection problem in large instances -- Deep Infeasibility Exploration Method for Vehicle Routing Problems -- Evolutionary Algorithms for the Constrained Two-Level Role Mining Problem -- Simplifying Dispatching Rules in Genetic Programming for Dynamic Job Shop Scheduling -- Novelty-Driven Binary Particle Swarm Optimisation for Truss Optimisation Problems -- A Beam Search for the Shortest Common Supersequence Problem Guided by an Approximate Expected Length Calculation -- Modeling the Costas Array Problem in QUBO for Quantum Annealing -- Penalty Weights in QUBO formulations: Permutation Problems -- PUBOi: a tunable benchmark with variable importance -- Stagnation Detection meets Fast Mutation.
Inhalt:
This book constitutes the refereed proceedings of the 22nd European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2022, held as part of Evo*2022, in Madrid, Spain, during April 20-21, 2022, co-located with the Evo*2022 events: EvoMUSART, EvoApplications, and EuroGP. The 13 revised full papers presented in this book were carefully reviewed and selected from 28 submissions. They present recent theoretical and experimental advances in combinatorial optimization, evolutionary algorithms, and related research fields.
Weitere Ausg.:
ISBN 9783031041471
Weitere Ausg.:
ISBN 9783031041495
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe ISBN 9783031041471
Weitere Ausg.:
Erscheint auch als Druck-Ausgabe ISBN 9783031041495
Sprache:
Englisch
DOI:
10.1007/978-3-031-04148-8
