Nantilus
Metaheuristics : Progress in Complex Systems Optimization
The aim of METAHEURISTICS: Progress in Complex Systems Optimization is to provide several different kinds of information: a delineation of general metaheuristics methods, a number of state-of-the-art articles from a variety of well-known classical application areas as well as an outlook to modern co...
Enregistré dans:
| Auteurs principaux : | , , , , , |
|---|---|
| Format : | Livre |
| Langue : | anglais |
| Titre complet : | Metaheuristics : Progress in Complex Systems Optimization / edited by Karl F. Doerner, Michel Gendreau, Peter Greistorfer, Walter Gutjahr, Richard F. Hartl, Marc Reimann. |
| Publié : |
New York, NY :
Springer US
, 2007 Cham : Springer Nature |
| Collection : | Operations research, computer science. Interface series (Online) ; 39 |
| Titre de l'ensemble : | Operations Research/Computer Science Interfaces Series vol. 39 |
| Accès en ligne : |
Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr |
| Sujets : | |
| Documents associés : | Autre format:
Metaheuristics Autre format: Metaheuristics Autre format: Metaheuristics |
- Scatter Search
- Experiments Using Scatter Search for the Multidemand Multidimensional Knapsack Problem
- A Scatter Search Heuristic for the Fixed-Charge Capacitated Network Design Problem
- Tabu Search
- Tabu Search-Based Metaheuristic Algorithm for Large-scale Set Covering Problems
- Log-Truck Scheduling with a Tabu Search Strategy
- Nature-inspired methods
- Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms
- Reviewer Assignment for Scientific Articles using Memetic Algorithms
- GRASP and Iterative Methods
- Grasp with Path-Relinking for the Tsp
- Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem
- Dynamic and Stochastic Problems
- 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
- Distributed and Parallel Algorithms
- Embedding a Chained Lin-Kernighan Algorithm into a Distributed Algorithm
- Exploring Grid Implementations of Parallel Cooperative Metaheuristics
- Algorithm Tuning, Algorithm Design and Software Tools
- 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.