Convergence of an annealing algorithm
From MaRDI portal
Publication:3703588
DOI10.1007/BF01582166zbMath0581.90061MaRDI QIDQ3703588
No author found.
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
global optimizationstochastic optimizationconvergence ratetravelling salesmanSteiner treeslocal improvementannealing algorithmhill climbingNP-hard combinatorial problemsmetropolis method
Related Items (only showing first 100 items - show all)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Probabilistic exchange algorithms and Euclidean traveling salesman problems ⋮ Optimizing termination decision for meta-heuristic search techniques that converge to a static objective-value distribution ⋮ Balancing mixed-model assembly lines: a computational evaluation of objectives to smoothen workload ⋮ État de l'art des méthodes “d'optimisation globale” ⋮ The multiobjective equilibrium network design problem revisited: A simulated annealing approach ⋮ Unrelated parallel machine scheduling using local search ⋮ Simulated annealing and tabu search: Lessons from a line search ⋮ Metaheuristics for solving a multimodal home-healthcare scheduling problem ⋮ Multi-mode resource availability cost problem with recruitment and release dates for resources ⋮ On the convergence of stationary distributions in simulated annealing algorithms ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ A theoretical framework for simulated annealing ⋮ A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop ⋮ Simulation optimization for revenue management of airlines with cancellations and overbooking ⋮ Curve approximation by adaptive neighborhood simulated annealing and piecewise Bézier curves ⋮ CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION ⋮ Constructing efficient simulated annealing algorithms ⋮ A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation ⋮ Optimization of the quadratic assignment problem using an ant colony algorithm ⋮ A landscape-based analysis of fixed temperature and simulated annealing ⋮ A semi-infinite programming model for earliness/tardiness production planning with simulated annealing ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ 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 ⋮ 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 ⋮ A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem ⋮ A simulated annealing hyper-heuristic methodology for flexible decision support ⋮ Placement by thermodynamic simulated annealing ⋮ Non-productive tool path optimisation for four-axis milling using the simulated annealing algorithm ⋮ Solving the continuous flow-shop scheduling problem by metaheuristics. ⋮ Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data ⋮ SSTT: Efficient local search for GSI global routing ⋮ The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem ⋮ Simulated annealing: A tool for operational research ⋮ Design method using hybrid of line-type and circular-type routes for transit network system optimization ⋮ A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles ⋮ On the convergence of biogeography-based optimization for binary problems ⋮ On the classification of NP-complete problems in terms of their correlation coefficient ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information ⋮ Modelling the dynamics of stochastic local search on \(k\)-SAT ⋮ A scheduling framework for large-scale, parallel, and topology-aware applications ⋮ Solving the multi-objective nurse scheduling problem with a weighted cost function ⋮ Simulated annealing simulated ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ Location of facility based on simulated annealing and ``ZKW algorithms ⋮ Optimal design of LAN-WAN internetworks: An approach using simulated annealing ⋮ The afforestation problem: A heuristic method based on simulated annealing ⋮ Resource constrained project scheduling subject to due dates: preemption permitted with penalty ⋮ Simulated annealing applied to the process allocation problem ⋮ A hybrid SAGA algorithm for the construction of \(E(s^2)\)-optimal cyclic supersaturated designs ⋮ Simulated annealing: An introduction ⋮ A comparative study of non-traditional methods for vehicle crashworthiness and NVH optimization ⋮ Good solutions to discrete noxious location problems via metaheuristics ⋮ A COMPARATIVE STUDY OF MODEL SELECTION METHODS FOR NONLINEAR TIME SERIES ⋮ \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing ⋮ Cell formation in manufacturing systems through simulated annealing: An experimental evaluation ⋮ Monte Carlo hyper-heuristics for examination timetabling ⋮ Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms ⋮ A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound ⋮ Stopping and restarting strategy for stochastic sequential search in global optimization ⋮ Estimating the convergence of a simulated annealing algorithm for the problem of constructing multiprocessor schedules ⋮ A theoretical study on the behavior of simulated annealing leading to a new cooling schedule ⋮ Optimization of resource location in hierarchical computer networks ⋮ A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse ⋮ On the depth of combinatorial optimization problems ⋮ Approximate solution of a resource-constrained scheduling problem ⋮ Some notes on concordance between optimization and statistics ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ Formulating and solving production planning problems ⋮ Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic ⋮ Using a vision cognitive algorithm to schedule virtual machines ⋮ Solving the medium newspaper production/distribution problem ⋮ A statistical foundation for machine learning, with application to Go- Moku ⋮ On efficient use of simulated annealing in complex structural optimization problems ⋮ An SA/TS mixture algorithm for the scheduling tardiness problem ⋮ An improved annealing scheme for the QAP ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem ⋮ Optimizing simulated annealing schedules with genetic programming ⋮ Simulated annealing and quantum detailed balance ⋮ A model for the convective cooling of electronic components with application to optimal placement ⋮ The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads ⋮ GRASP and path relinking for the max-min diversity problem ⋮ Simulated Simulated Annealing ⋮ Computational Experience with Generalized Simulated Annealing Over Continuous Variables ⋮ A new genetic algorithm ⋮ Determination of optimal path under approach and exit constraints ⋮ 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 ⋮ Efficient simulated annealing on fractal energy landscapes ⋮ Simulated annealing and the mapping problem: A computational study ⋮ Best-so-far vs. where-you-are: Implications for optimal finite-time annealing ⋮ Optimal exact experimental designs with correlated errors through a simulated annealing algorithm
Cites Work
This page was built for publication: Convergence of an annealing algorithm
