Del 13222 - Lecture Notes in Computer Science

Evolutionary Computation in Combinatorial Optimization

22nd European Conference, EvoCOP 2022, Held as Part of EvoStar 2022, Madrid, Spain, April 20–22, 2022, Proceedings

Häftad, Engelska, 2022

Av Leslie Pérez Cáceres, Sébastien Verel, Leslie Perez Caceres, Sebastien Verel

1 449 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2022-04-04
Mått155 x 235 x 13 mm
Vikt347 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor209
FörlagSpringer International Publishing AG
ISBN9783031041471

Tillhör följande kategorier

Systemvetenskap och AI inom Data och it
Programmeringsböcker inom Data och it
Hårdvara inom Data och it
Artificiell intelligens inom Data och it
Referensverk och tvärvetenskap inom Samhalle och politik

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.