Metaheuristics
Progress in Complex Systems Optimization (Operations Research/Computer Science Interfaces Series)
Our rough guess is there are 102,500 words in this book.
At a pace averaging 250 words per minute, this book will take 6 hours and 50 minutes to read. With a half hour per day, this will take 14 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Karl F. Doerner (Editor) - Contributor
- Michel Gendreau (Editor) - Contributor
- Peter Greistorfer (Editor) - Contributor
- Walter Gutjahr (Editor) - Contributor
- Richard F. Hartl (Editor) - Contributor
and 1 more
- Marc Reimann (Editor) - Contributor
Publication
2007-08-23 - Springer
Language
English
Word Count
102,500 words, Guess
Page Count
410 pages
Identifiers
- Internet Archivemetaheuristicspr00alka_365
- Internet Archivemetaheuristicspr00alka
- Internet Archivemetaheuristicspr00doer
- Internet Archivemetaheuristicspr0000unse
- Internet Archivespringer_10.1007-978-0-387-71921-4
and 8 more
- ISBN-100387719199
- ISBN-139780387719191
- LibraryThing4448407
- Goodreads1972854
- Library of Congress Control Number2007928813
- OCLC Control Number154711893
- Better World Books9780387719191
- Open LibraryOL7447871M
Classifications
- LCCQA402 .M4715 2007
- LCCQA402.5-402.6
Description
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>
Subjects
Other Editions
- Metaheuristics: Progress in Complex Systems Optimization (Operations Research/Computer Science Interfaces Series)
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!