Metaheuristics Progress in Complex Systems Optimization /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Doerner, Karl F. (Επιμελητής έκδοσης), Gendreau, Michel (Επιμελητής έκδοσης), Greistorfer, Peter (Επιμελητής έκδοσης), Gutjahr, Walter (Επιμελητής έκδοσης), Hartl, Richard F. (Επιμελητής έκδοσης), Reimann, Marc (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US, 2007.
• Σειρά: Operations Research/Computer Science Interfaces Series, 39
• Θέματα: Mathematics.; Operations research.; Decision making.; Computers.; Mathematical models.; Mathematical optimization.; Management science.; Optimization.; Operation Research/Decision Theory.; Operations Research, Management Science.; Computing Methodologies.; Mathematical Modeling and Industrial Mathematics.; Theory of Computation.

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

Πίνακας περιεχομένων:

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