General Remarks.- Exact Optimization Algorithms for Simple Problems.- Exact Optimization Algorithms for Complex Problems.- Monte Carlo.- Overview of Optimization Heuristics.- Implementation of Constraints.-Parallelization Strategies.- Construction Heuristics.- Markovian Improvement Heuristics.- Local Search.- Ruin & Recreate.- Simulated Annealing.- Threshold Accepting and Other Algorithms Related to Simulated Annealing.- Changing The Energy Landscape.- Estimation of Expectation Values.- Cooling Techniques.- Estimation of the Calculation Time Needed.- Weakening the Pure Markovian Approach.-Neural Networks.- Genetic Algorithms and Evolution Strategies.- Optimization Algorithms Inspired by Social Animals.- Optimization Algorithms Based on Multi Agent Systems.- Tabu Search.- Histogram Algorithms.- Searching for Backbones.- The Travelling Salesman Problem.- Extensions of the Traveling Salesman Problem.- Application of Construction Heuristics of theTSP.- Local Search Concepts Applied to the TSP.- Next Larger Moves Applied to the TSP.- Ruin and Recreate Applied to the TSP.- Application of Simulated Annealing to the TSP.-Dependencies of the SA-Results on the Moves and the Cooling Process.- Applicaton of Algorithms. Related to Simulated Annealing to the TSP.-Application of Search Space Smoothing to the TSP.-Further Techniques Changing the Energy Landscape of a TSP.- Applicaton of Neural Networks to the TSP. Application of Genetic Algorithms to the TSP.- Social Animal Algorithms Applied to the TSP.- Simulated Trading Applied to the TSP.- Tabu Search Applied to the TSP.- Application of History Algorithms to the TSP.- Application of Searching for Backbones to the TSP.- Simulating Various Types of Government With Searching for Backbones.- The Constraint Satisfaction Problem.- Construction Heuristics for the CSP.- Random Local Iterative Search Heuristics.- Belief Propagation and Survey Propagation.- Outlook for the Future of the Optimization Business.
(source: Nielsen Book Data)
The search for optimal solutions pervades our daily lives. From the scientific point of view, optimization procedures play an eminent role whenever exact solutions to a given problem are not at hand or a compromise has to be sought, e.g. to obtain a sufficiently accurate solution within a given amount of time. This book addresses stochastic optimization procedures in a broad manner, giving an overview of the most relevant optimization philosophies in the first part. The second part deals with benchmark problems in depth, by applying in sequence a selection of optimization procedures to them. While having primarily scientists and students from the physical and engineering sciences in mind, this book addresses the larger community of all those wishing to learn about stochastic optimization techniques and how to use them. (source: Nielsen Book Data)