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