Hybrid metaheuristics : 10th International Workshop, HM 2016, Plymouth, UK, June 8-10, 2016. Proceedings / Maria J. Blesa, Christian Blum, Angelo Cangelosi, Vincenzo Cutello, Alessandro Di Nuovo, Mario Pavone, El-Ghazali Talbi (eds.).
By: (10th : HM (Workshop) (10th : 2016 : Plymouth, England)
Contributor(s): Blesa, María J [editor.] | Blum, Christian [editor.] | Cangelosi, Angelo [editor.] | Cutello, Vincenzo [editor.] | Di Nuovo, Alessandro G [editor.] | Pavone, Mario (Professor of Computer Science) [editor.] | Talbi, El-Ghazali [editor.]Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 9668.; LNCS sublibrary: Publisher: Switzerland : Springer, 2016Description: 1 online resource (x, 199 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783319396361; 3319396366; 3319396358; 9783319396354Subject(s): Heuristic programming -- Congresses | Mathematical optimization -- Congresses | Computers -- Programming -- Algorithms | Computers -- Machine Theory | Computers -- Data Processing | Mathematics -- Logic | Mathematical theory of computation | Algorithms & data structures | User interface design & usability | Discrete mathematics | Computers -- Intelligence (AI) & Semantics | Artificial intelligence | Heuristic programming | Mathematical optimizationGenre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Hybrid metaheuristics.DDC classification: 006.3 LOC classification: T57.84Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
International conference proceedings.
Includes author index.
Online resource; title from PDF title page (SpringerLink, viewed June 9, 2016).
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.-
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.