Metaheuristics

Progress in Complex Systems Optimization

Edición de la obra Metaheuristics

Metaheuristics: Progress in Complex Systems Optimization<br />Author: Karl F. Doerner, Michel Gendreau, Peter Greistorfer, Walter Gutjahr, Richard F. Hartl, Marc Reimann<br /> Published by Springer US<br /> ISBN: 978-0-387-71919-1<br /> DOI: 10.1007/978-0-387-71921-4<br /><br />Table of Contents:<p></p><ul><li>Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem </li><li>A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem </li><li>Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems </li><li>Log-Truck Scheduling with a Tabu Search Strategy </li><li>Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms </li><li>Reviewer Assignment for Scientific Articles using Memetic Algorithms </li><li>Grasp with Path-Relinking for the Tsp </li><li>Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem </li><li>Variable Neighborhood Search for the Probabilistic Satisfiability Problem </li><li>The ACO/F-Race Algorithm for Combinatorial Optimization Under Uncertainty </li><li>Adaptive Control of Genetic Parameters for Dynamic Combinatorial Problems </li><li>A Memetic Algorithm for Dynamic Location Problems </li><li>A Study of Canonical GAs for NSOPs </li><li>Particle Swarm Optimization and Sequential Sampling in Noisy Environments </li><li>Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm </li><li>Exploring Grid Implementations of Parallel Cooperative Metaheuristics </li><li>Using Experimental Design to Analyze Stochastic Local Search Algorithms for Multiobjective Problems </li><li>Distance Measures and Fitness-Distance Analysis for the Capacitated Vehicle Routing Problem </li><li>Tuning Tabu Search Strategies Via Visual Diagnosis </li><li>Solving Vehicle Routing Using IOPT</li></ul>