Fr. 82.00

Evolutionary Computation in Combinatorial Optimization - 25th European Conference, EvoCOP 2025, Held as Part of EvoStar 2025, Trieste, Italy, April 23-25, 2025, Proceedings

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

This book constitutes the referred proceedings of the 25th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2025, held as part of EvoStar 2025, in Trieste, Italy, during April 23 25, 2025.
The 16 full papers presented in this book were carefully reviewed and selected from 43 submissions. These papers cover a variety of topics, ranging from benchmark creation, over genetic programming, heuristics for real-world and NP-hard problems, as well as the foundations of evolutionary computation algorithms and other search heuristics, to both mixed-binary and multi-objective optimization.

List of contents

.- A Runtime Analysis of the Multi-Valued Compact Genetic Algorithm on Generalized LeadingOnes.
.- Evolutionary Anytime Algorithms.
.- Studies on Survival Strategies to Protect Expert Knowledge in Evolutionary Algorithms for Interactive Role Mining.
.- Diversification through Candidate Sampling for a Non-Iterated Lin-Kernighan-Helsgaun Algorithm.
.- Instance Space Analysis and Algorithm Selection for a Parallel Batch Scheduling Problem.
.- Meta-learning of Univariate Estimation-of-Distribution Algorithms for Pseudo-Boolean Problems.
.- A Selective Vehicle Routing Problem for the Bloodmobile System.
.- A Genetic Approach to the Operational Freight-on-Transit problem.
.- LON/D Sub-problem Landscape Analysis in Decomposition-based Multi-objective Optimization.
.- Visualizing Pseudo-Boolean Functions: Feature Selection and Regularization for Machine Learning.
.- Mixed-Binary Problems Optimized with Fast Discrete Solver.
.- Feature-based Evolutionary Diversity Optimization of Discriminating Instances for Chance-constrained Optimization Problems.
.- Adaptive neighborhood search based on landscape learning: a TSP study.
.- Healthcare Facility Location Problem and Fitness Landscape Analysis.
.- Generating (Semi-)Active Schedules for Dynamic Multi-mode Project Scheduling Using Genetic Programming Hyper-heuristics.
.- Price-and-branch Heuristic for Vector Bin Packing.

Summary

This book constitutes the referred proceedings of the 25th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2025, held as part of EvoStar 2025, in Trieste, Italy, during April 23–25, 2025.
The 16 full papers presented in this book were carefully reviewed and selected from 43 submissions. These papers cover a variety of topics, ranging from benchmark creation, over genetic programming, heuristics for real-world and NP-hard problems, as well as the foundations of evolutionary computation algorithms and other search heuristics, to both mixed-binary and multi-objective optimization.

Product details

Assisted by Martin S. Krejca (Editor), Martin S Krejca (Editor), Wagner (Editor), Markus Wagner (Editor)
Publisher Springer, Berlin
 
Original title Evolutionary Computation in Combinatorial Optimization
Languages English
Product format Paperback / Softback
Released 16.04.2025
 
EAN 9783031868481
ISBN 978-3-0-3186848-1
No. of pages 268
Illustrations XIV, 268 p. 65 illus., 53 illus. in color.
Series Lecture Notes in Computer Science
Subjects Natural sciences, medicine, IT, technology > IT, data processing > IT

Künstliche Intelligenz, Artificial Intelligence, Netzwerk-Hardware, Theoretische Informatik, Theory of Computation, Runtime Analysis, Computer Communication Networks, Mathematics of Computing, swarm intelligence, metaheuristics, Evolutionary Algorithms, Hybrid Methods, Local Search Methods, Combinatorial Optimization Problems, Automatic Algorithm Configuration and Design

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.