Cantitate/Preț
Produs

Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings: Lecture Notes in Computer Science, cartea 9668

Editat de Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi
en Limba Engleză Paperback – 24 mai 2016
This book constitutes the refereed proceedings of the 10th International Workshop on Hybrid Metaheuristics, HM 2016, held in Plymouth, UK, in June 2016.
The 15 revised full papers presented were carefully reviewed and selected from 43 submissions. The selected papers are of interest for all the researchers working on integrating metaheuristics with other areas for solving both optimization and constraint satisfaction problems. They represent as well a sample of current research demonstrating how metaheuristics can be integrated with integer linear programming and other operational research techniques for tackling difficult and relevant problems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32281 lei

Preț vechi: 40352 lei
-20% Nou

Puncte Express: 484

Preț estimativ în valută:
6178 6417$ 5132£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319396354
ISBN-10: 3319396358
Pagini: 227
Ilustrații: XII, 223 p. 70 illus.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.34 kg
Ediția:1st ed. 2016
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

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.- Construct, Merge, Solve and Adapt: Application to Unbalanced Minimum Common String Partition.- Variable Neighbourhood Descent with Memory: A Hybrid Metaheuristic for Supermarket Resupply.- Hybridization as Cooperative Parallelism for the Quadratic Assignment Problem.- Investigating Edge-Reordering Procedures in a Tabu Search Algorithm for the Capacitated Arc Routing Problem.- Multi-chaotic Approach for Particle Acceleration in PSO.- Districting and Routing for Security Control.- A GRASP/VND Heuristic for a Generalized Ring Star Problem.- Neighborhood Composition Strategies in Stochastic Local Search.- A Hybrid Multi-objective Evolutionary Approach for Optimal Path Planning of a Hexapod Robot: A Preliminary Study.- Hybridization of Chaotic Systems and Success-History Based Adaptive Differential Evolution.- Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem.- The Capacitated m Two-Node Survivable Star Problem: A Hybrid Metaheuristic Approach.- Robust Berth Allocation Using a Hybrid Approach Combining Branch-and-cut and the Genetic Algorithm.- Dealing with the Strategic Level of Decisions Related to Automated Transit Networks: A Hybrid Heuristic Approach.- DEEPSAM: A Hybrid Evolutionary Algorithm for the Prediction of Biomolecules Structure.-

Caracteristici

Includes supplementary material: sn.pub/extras