Convergence of an annealing algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3656855 (Why is no real title available?)
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 3793743 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3800811 (Why is no real title available?)
- scientific article; zbMATH DE number 3388861 (Why is no real title available?)
- Non-negative matrices and Markov chains. 2nd ed
- On the number of iterations of local improvement algorithms
- Optimization by simulated annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Cited in
(only showing first 100 items - show all)- Approximate solution of a resource-constrained scheduling problem
- GRASP and path relinking for the max-min diversity problem
- Probabilistic exchange algorithms and Euclidean traveling salesman problems
- On the convergence of stationary distributions in simulated annealing algorithms
- An application of simulated annealing to the cutting stock problem
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- A method of spatial reasoning based on qualitative trigonometry
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Optimal design of LAN-WAN internetworks: An approach using simulated annealing
- The afforestation problem: A heuristic method based on simulated annealing
- Simulated annealing applied to the process allocation problem
- Cell formation in manufacturing systems through simulated annealing: An experimental evaluation
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- A statistical foundation for machine learning, with application to Go- Moku
- An SA/TS mixture algorithm for the scheduling tardiness problem
- A simulated annealing heuristic for the one-dimensional cutting stock problem
- Optimizing simulated annealing schedules with genetic programming
- Some experiments with simulated annealing techniques for packing problems
- Simulated annealing for resource-constrained scheduling
- Convective cooling and optimal placement of electronic components with variable ambient temperature. I: The linear model
- Simulated annealing and the mapping problem: A computational study
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing
- Unrelated parallel machine scheduling using local search
- Simulated annealing and tabu search: Lessons from a line search
- Constructing efficient simulated annealing algorithms
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing
- Convergence rates for annealing diffusion processes
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
- A systematic procedure for setting parameters in simulated annealing algorithms
- Placement by thermodynamic simulated annealing
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- SSTT: Efficient local search for GSI global routing
- On simulated annealing and nested annealing.
- Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
- Multi-mode resource availability cost problem with recruitment and release dates for resources
- A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
- On the convergence of biogeography-based optimization for binary problems
- Revisiting simulated annealing: a component-based analysis
- Monte Carlo hyper-heuristics for examination timetabling
- A theoretical study on the behavior of simulated annealing leading to a new cooling schedule
- On the depth of combinatorial optimization problems
- Some new results on simulated annealing applied to the job shop scheduling problem
- Formulating and solving production planning problems
- Solving the medium newspaper production/distribution problem
- On efficient use of simulated annealing in complex structural optimization problems
- Determination of optimal path under approach and exit constraints
- A comparison of local search methods for flow shop scheduling
- Metaheuristics: A bibliography
- On the classification of NP-complete problems in terms of their correlation coefficient
- Location of facility based on simulated annealing and ``ZKW algorithms
- Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules
- Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution
- Curve approximation by adaptive neighborhood simulated annealing and piecewise Bézier curves
- A landscape-based analysis of fixed temperature and simulated annealing
- Resource constrained project scheduling subject to due dates: preemption permitted with penalty
- Stopping and restarting strategy for stochastic sequential search in global optimization
- Some notes on concordance between optimization and statistics
- The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads
- The multiobjective equilibrium network design problem revisited: A simulated annealing approach
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- Solving the multi-objective nurse scheduling problem with a weighted cost function
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- A new genetic algorithm
- A theoretical framework for simulated annealing
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- Non-productive tool path optimisation for four-axis milling using the simulated annealing algorithm
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload
- A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots
- A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
- scientific article; zbMATH DE number 4042991 (Why is no real title available?)
- Simulated annealing: An introduction
- scientific article; zbMATH DE number 37745 (Why is no real title available?)
- A simulated annealing hyper-heuristic methodology for flexible decision support
- scientific article; zbMATH DE number 978135 (Why is no real title available?)
- État de l'art des méthodes “d'optimisation globale”
- Design method using hybrid of line-type and circular-type routes for transit network system optimization
- A COMPARATIVE STUDY OF MODEL SELECTION METHODS FOR NONLINEAR TIME SERIES
- Simulated Simulated Annealing
- Computational Experience with Generalized Simulated Annealing Over Continuous Variables
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
- scientific article; zbMATH DE number 1874282 (Why is no real title available?)
- CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION
- Convergence of a random algorithm for function optimization
- Fine-grained parallel genetic algorithm:a global convergence criterion
- A primer on the application of neural networks to covering array generation
- Why does large batch training result in poor generalization? A comprehensive explanation and a better strategy from the viewpoint of stochastic optimization
- A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Convergence of Simulated Annealing with Feedback Temperature Schedules
- Local Search Algorithms for the Maximal Planar Layout Problem
- Convergence in Probability of Compressed Annealing
- Optimization of resource location in hierarchical computer networks
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- Indistinguishable states. I: Pefect model scenario.
- Local search heuristics for two-stage flow shop problems with secondary criterion
- Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches
This page was built for publication: Convergence of an annealing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3703588)
