114,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Gebundenes Buch

Companies deal with many problems that seem difficult to solve at first:
- In which order should customers be delivered to so that the distance travelled by a delivery fleet is minimal?
- How can a portfolio of shares be improved with limited financial resources?
- Where should warehouses be located?
- Which streets should be covered by which mailman? In which order?
Real problems are too complex/large to solve using traditional mathematical programming methods. A new collection of methods (metaheuristics) have been developed that can find "good enough" solutions in reasonable
…mehr

Produktbeschreibung
Companies deal with many problems that seem difficult to solve at first:

- In which order should customers be delivered to so that the distance travelled by a delivery fleet is minimal?

- How can a portfolio of shares be improved with limited financial resources?

- Where should warehouses be located?

- Which streets should be covered by which mailman? In which order?

Real problems are too complex/large to solve using traditional mathematical programming methods. A new collection of methods (metaheuristics) have been developed that can find "good enough" solutions in reasonable time.

This book presents the main metaheuristic methods - tabu search, simulated annealing and genetic algorithms - and discusses their pros and cons. It includes program codes showing how each method is designed, used, evaluated and improved.

An ideal introduction for students; the inclusion of advanced topics also makes it of use to researchers as well as engineers and managers who will apply these methods to real problems.
Autorenporträt
All three authors are researchers, doing active research into the topic of metaheuristics. All three teach courses on the subject in universities at undergraduate and graduate levels. They have also been involved in some industrial projects, where we have implemented metaheuristics for real optimisation problems. Marc Sevaux is a Professor at the University of South-Brittany (Lorient, France). He is a member of the LESTER Laboratory, a CNRS-affiliated laboratory (FRE 2734). He teaches undergraduate and graduate courses in Operational Research and Computer Science at the Faculty of Science and Technology. He is a former member of the department of Production Systems of the LAMIH. He received his Ph.D. degree in 1998 from the Pierre and Marie Curie University (Paris VI) and conducted his doctoral research at the Ecole des Mines de Nantes in the Department of Automatic Control and Production Engineering. He defended his Habilitation in July 2004 at the University of Valenciennes in the LAMIH laboratory, Production Systems department. Prof. Sevaux is primarily interested in combinatorial optimization research, particularly production planning, scheduling and routing problems. He is currently working on robustness in scheduling and also on multi-objective routing problems. He is also interested in linear and integer programming to solve various industrial problems.