Cantitate/Preț
Produs

Evolutionary Computation in Combinatorial Optimization: 24th European Conference, EvoCOP 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3–5, 2024, Proceedings: Lecture Notes in Computer Science, cartea 14632

Editat de Thomas Stützle, Markus Wagner
en Limba Engleză Paperback – 4 mai 2024
This book constitutes the referred proceedings of the 24th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2024, held as part of EvoStar 2024, in Aberystwyth, UK, during April 3–5, 2024.
The 12 full papers presented in this book were carefully reviewed and selected from 28 submissions. They cover a variety of topics, ranging from constructive algorithms, machine learning techniques ranging from neural network based guidance to sparse surrogate models for optimization problems, the foundation of evolutionary computation algorithms and other search heuristics, to multi-objective optimization problems. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 30576 lei

Preț vechi: 38220 lei
-20% Nou

Puncte Express: 459

Preț estimativ în valută:
5852 6140$ 4855£

Carte tipărită la comandă

Livrare economică 25-31 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031577116
ISBN-10: 3031577116
Ilustrații: XI, 194 p. 41 illus.
Dimensiuni: 155 x 235 mm
Ediția:2024
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

A Neural Network Based Guidance for a BRKGA: An Application to the Longest Common Square Subsequence Problem.- Sparse Surrogate Model for Optimization: Example of the Bus Stops Spacing Problem.- Emergence of new local search algorithms with neuro-evolution.- Q-learning Based Framework for Solving the Stochastic E-waste Collection Problem.- A memetic algorithm with adaptive operator selection for graph coloring.- Studies on Multi-objective Role Mining in ERP Systems.- Greedy heuristic guided by lexicographic excellence.- Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination.- Where the Really Hard Quadratic Assignment Problems Are: the QAP-SAT instances.- Hardest Monotone Functions for Evolutionary Algorithms.- A Theoretical Investigation Of Termination Criteria For Evolutionary Algorithms.- Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings.