How to solve it: modern heuristics.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Approximation methods and heuristics in mathematical programming (90C59)
For a review of the first edition (2000) see Zbl 0943.90002. Publisher's description: This book is the only source that provides comprehensive, current, and correct information on problem solving using modern heuristics. It covers classic methods of optimization, including dynamic programming, the simplex method, and gradient techniques, as well as recent innovations such as simulated annealing, tabu search, and evolutionary computation. Integrated into the discourse is a series of problems and puzzles to challenge the reader. The book is written in a lively, engaging style and is intended for students and practitioners alike. Anyone who reads and understands the material in the book will be armed with the most powerful problem solving tools currently known. This second edition contains two new chapters, one on coevolutionary systems and one on multicriterial decision-making. Also some new puzzles are added and various subchapters are revised.
- Planning of complex supply chains: a performance comparison of three meta-heuristic algorithms
- Parameter estimation in rainfall-runoff modelling using distributed versions of particle swarm optimization algorithm
- Energy management for stationary electric energy storage systems: a systematic literature review
- Staff and machine shift scheduling in a German potash mine
- Simulated annealing approach to nurse rostering benchmark and real-world instances
- A direct search algorithm for global optimization
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- Heuristic optimisation in financial modelling
- Fast identification of cracks using higher-order topological sensitivity for 2-D potential problems
- Bee-inspired algorithms applied to vehicle routing problems: a survey and a proposal
- TCMI: a non-parametric mutual-dependence estimator for multivariate continuous distributions
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
- Solution procedures for block selection and sequencing in flat-bedded potash underground mines
- Smart dispatching and metaheuristic swarm flow algorithm
- Differential evolution and combinatorial search for constrained index-tracking
- Development of metaheuristic interval minimization methods for optimal program control design
- Searching the landscape of flux vacua with genetic algorithms
- A comparison of selected modifications of the particle swarm optimization algorithm
- Topological sensitivity for 3D elastodynamic and acoustic inverse scattering in the time domain
- Robust estimations of the region of attraction using invariant sets
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- Machine scheduling in underground mining: an application in the potash industry
- Backcalculating pavement structural properties using a Nelder-Mead simplex search
- Recursively Generated Evolutionary Turing Machines and Evolutionary Automata
- Memory and learning in metaheuristics
- Methodology for the reduction of parameters in the inverse transformation of Schwarz-Christoffel applied to electromagnetic devices with axial geometry
- The parallel structure of mathematical reasoning
- A new methodology to calculate Carter factor using genetic algorithms
- A comparison of metaheurisitics for the problem of solving parametric interval linear systems
- Parameter-less algorithm for evolutionary-based optimization: for continuous and combinatorial problems
- Preprocessing composite cutting procedure: an approach to the integer model
- Static resource allocation for heterogeneous computing environments with tasks having dependencies, priorities, deadlines, and multiple versions
- Topological sensitivity and FMM-accelerated BEM applied to 3D acoustic inverse scattering
- Graph clustering
- How to solve it: Modern heuristics
- Computation of bifurcation margins based on robust control concepts
- A robust multiquadric method for digital elevation model construction
- A new metaheuristic optimization method: the algorithm of the innovative gunner (AIG)
- Some feasibility sampling procedures in interval methods for constrained global optimization
- Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems
- Metaheuristics -- the metaphor exposed
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Ranking-based black-box complexity
- Customized crossover in evolutionary sets of safe ship trajectories
- Higher-order topological sensitivity for 2-D potential problems. Application to fast identification of inclusions
- The secret life of keys: on the calculation of mechanical lock systems
- Evolving Heterotic Gauge Backgrounds: Genetic Algorithms versus Reinforcement Learning
- Cosmic Inflation and Genetic Algorithms
- Fairer comparisons for travelling salesman problem solutions using hash functions
- Modeling the Emergency Service Network of Police Special Forces Units for High-Risk Law Enforcement Operations
- Design of modern heuristics. Principles and application.
- Evolutionary algorithms and dynamic programming
- Survival of the flexible: explaining the recent popularity of nature-inspired optimization within a rapidly evolving world
- Constructing Two-Level Designs by Concatenation of Strength-3 Orthogonal Arrays
- On scheduling around large restrictive common due windows
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms
- USPEX-evolutionary crystal structure prediction
- Optimized network structure for full-synchronization
- On the genetic algorithm with adaptive mutation rate and selected statistical applications
- Optimizing Two-Arm Clinical Trials for Personalized Medicine Using Integer Programming and Heuristic Algorithms
- SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications
- A grasp-knapsack hybrid for a nurse-scheduling problem
- Location coverage models with demand originating from nodes and paths: Application to cellular network design
- Speeding up continuous GRASP
- Distributed optimisation of a portfolio's omega
This page was built for publication: How to solve it: modern heuristics.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3157878)
