Cantitate/Preț
Produs
Total produse
Vezi coșul
Evolutionary Computation in Combinatorial Optimization: 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15–17, 2020, Proceedings de Luís Paquete

Evolutionary Computation in Combinatorial Optimization: 20th European Conference, EvoCOP 2020, Held as Part of EvoStar 2020, Seville, Spain, April 15–17, 2020, Proceedings: Lecture Notes in Computer Science, cartea 12102

Editat de Luís Paquete, Christine Zarges
en Limba Engleză Paperback – 10 mar 2020
This book constitutes the refereed proceedings of the 20th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, held as part of Evo*2020, in Seville, Spain, in April 2020, co-located with the Evo*2020 events EuroGP, EvoMUSART and EvoApplications.
The 14 full papers presented in this book were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics, to their accurate design and application to combinatorial optimization problems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 31769 lei

Preț vechi: 39711 lei
-20% Nou

Puncte Express: 477
Preț estimativ în valută:
6080€ • 6414$ • 5067£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030436797
ISBN-10: 3030436799
Pagini: 231
Ilustrații: XIV, 231 p. 82 illus., 46 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.35 kg
Ediția:1st ed. 2020
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Optimizing Prices and Periods in Time-of-use Electricity Tariff Design Using Bilevel Programming.- An Algebraic Approach for the Search Space of Permutations with Repetition.- A Comparison of Genetic Representations for Multi-Objective Shortest Path Problems on Multigraphs.- The Univariate Marginal Distribution Algorithm Copes well with Deception and Epistasis.- A Beam Search Approach to the Traveling Tournament Problem.- Cooperative Parallel SAT Local Search with Path Relinking.- Dynamic Compartmental Models for Large Multi-Objective Landscapes and Performance Estimation.- Fitness Landscape Analysis of Automated Machine Learning Search Spaces.- On the Combined Impact of Population Size and Sub-problem Selection in MOEA/D.- A Grouping Genetic Algorithm for Multi Depot Pickup and Delivery Problems with Time Windows and Heterogeneous Vehicle Fleets.- MILPIBEA: Algorithm for Multi-Objective Features Selection in (Evolving) Software Product Lines.- A Group Genetic Algorithm for Resource Allocation in Container-Based Clouds.- The Local Optima Level in Chemotherapy Schedule Optimisation.- Genetic Programming with Adaptive Search Based on the Frequency of Features for Dynamic Flexible Job Shop Scheduling.