The Theory and Practice of Simulated Annealing
From MaRDI portal
Publication:4452899
DOI10.1007/0-306-48056-5_10zbMATH Open1102.90381OpenAlexW2210692376MaRDI QIDQ4452899FDOQ4452899
Authors: Darrall Henderson, Sheldon H. Jacobson, Alan W. Johnson 
Publication date: 7 March 2004
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/0-306-48056-5_10
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (43)
- Applying functional principal components to structural topology optimization
- Bivariate Conway-Maxwell Poisson distributions with given marginals and correlation
- Analysis of stochastic local search methods for the unrelated parallel machine scheduling problem
- A framework for analyzing sub-optimal performance of local search algorithms
- Adaptive state-dependent diffusion for derivative-free optimization
- Trends in Consensus-Based Optimization
- Analyzing the performance of simultaneous generalized hill climbing algorithms
- Revisiting simulated annealing: a component-based analysis
- Evaluating the convergence of tabu enhanced hybrid quantum optimization
- Minimizing total tardiness in a scheduling problem with a learning effect
- An optimization approach to establish dynamical equivalence for soft and rigid impact models
- Automatic generation of fast algorithms for matrix–vector multiplication
- Performance analysis of cyclical simulated annealing algorithms
- Validating models of sensory conflict and perception for motion sickness prediction
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- Sequential Monte Carlo simulated annealing
- Using an improved bee memory differential evolution algorithm for parameter estimation to simulate biochemical pathways
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Optimal time-profiles of public health intervention to shape voluntary vaccination for childhood diseases
- Finite space Kantorovich problem with an MCMC of table moves
- Two penalized mixed-integer nonlinear programming approaches to tackle multicollinearity and outliers effects in linear regression models
- An effective hybrid honey bee mating optimization algorithm for balancing mixed-model two-sided assembly lines
- Biological invasions: Deriving the regions at risk from partial measurements
- Multi-fleet feeder vehicle routing problem using hybrid metaheuristic
- Title not available (Why is that?)
- Interval type-2 fuzzy sets improved by simulated annealing for locating the electric charging stations
- Metaheuristics in combinatorial optimization
- Solving the robust two-stage capacitated facility location problem with uncertain transportation costs
- Designing optimal aviation baggage screening strategies using simulated annealing
- Swarm-based gradient descent meets simulated annealing
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- A new taxonomy of global optimization algorithms
- Metaheuristics: A Canadian Perspective
- Simulated annealing with penalization for university course timetabling
- Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry
- A Monte Carlo simulation-based simulated annealing algorithm for predicting the minimum staffing requirement at a blood donor centre
- Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
- Interval optimization based line sampling method for fuzzy and random reliability analysis
- Designing patient-specific optimal neurostimulation patterns for seizure suppression
- The location routing problem using electric vehicles with constrained distance
- CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method
- Visiting near-optimal solutions using local search algorithms
This page was built for publication: The Theory and Practice of Simulated Annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452899)
