Atjaunināt sīkdatņu piekrišanu

Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings 1st ed. 2016 [Mīkstie vāki]

Edited by , Edited by , Edited by , Edited by , Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 223 pages, height x width: 235x155 mm, weight: 3635 g, 70 Illustrations, black and white; XII, 223 p. 70 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 9668
  • Izdošanas datums: 24-May-2016
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319396358
  • ISBN-13: 9783319396354
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
Hybrid Metaheuristics: 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016, Proceedings 1st ed. 2016Palielināt
  • Formāts: Paperback / softback, 223 pages, height x width: 235x155 mm, weight: 3635 g, 70 Illustrations, black and white; XII, 223 p. 70 illus., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 9668
  • Izdošanas datums: 24-May-2016
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3319396358
  • ISBN-13: 9783319396354
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783319396354.html
Keywords:
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.

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.-