This introductory text describes types of heuristic procedures for solving large combinatorial problems. Some of the techniques covered include simulated annealing and tabu search, Lagrangian relaxation, genetic algorithms and artificial neural networks.
Auflage
Sprache
Verlagsort
Verlagsgruppe
McGraw-Hill Education - Europe
Zielgruppe
Für höhere Schule und Studium
Editions-Typ
Illustrationen
Maße
Höhe: 0 mm
Breite: 0 mm
Dicke: 0 mm
Gewicht
ISBN-13
978-0-07-709239-9 (9780077092399)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Introduction: Combinatorial Problems. Local and Global Optima. Heuristics. Simulated Annealing: Basic Method. Enhancements and Modifications. Applications. Tabu Search: Framework. Broader Aspects of Intensification and Diversification. Tabu Search Applications. Connections. Genetic Algorithms: Basic Concepts; Simple Example. Extensions and Modifications. Applications. Artificial Neural Networks: Neural Networks. Combinatorial Optimisation Problems. Graph Bisection Problem. Graph Partition Problem. The Travelling Salesman Problem. Scheduling Problems. Deformable Templates. Inequality Constraints. Lagrangian Relaxation: Basic Methodology. Lagrangian Heuristics and Problem Reduction. Determination of Legrange Multipliers. Dual Ascent. Tree Search. Application. Evaluation Of Heuristic Performance: Analytical Methods. Empirical Testing. Statistical Inference.
