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 optimization; stochastic optimization; convergence rate; travelling salesman; Steiner trees; local improvement; annealing algorithm; hill climbing; NP-hard combinatorial problems; metropolis method
Related Items
État de l'art des méthodes “d'optimisation globale”, A COMPARATIVE STUDY OF MODEL SELECTION METHODS FOR NONLINEAR TIME SERIES, Simulated Simulated Annealing, Computational Experience with Generalized Simulated Annealing Over Continuous Variables, CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION, Convergence of a random algorithm for function optimization, Fine-grained parallel genetic algorithm:a global convergence criterion, Convergence of Simulated Annealing with Feedback Temperature Schedules, Local Search Algorithms for the Maximal Planar Layout Problem, 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, Optimization of resource location in hierarchical computer networks, Simulated annealing simulated, Good solutions to discrete noxious location problems via metaheuristics, A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound, An improved annealing scheme for the QAP, Simulated annealing and quantum detailed balance, A model for the convective cooling of electronic components with application to optimal placement, Efficient simulated annealing on fractal energy landscapes, Simulation optimization for revenue management of airlines with cancellations and overbooking, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, Optimization of the quadratic assignment problem using an ant colony algorithm, 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, 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, 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, Optimal exact experimental designs with correlated errors through a simulated annealing algorithm, 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, The multiobjective equilibrium network design problem revisited: A simulated annealing approach, Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data, A new genetic algorithm, A theoretical framework for simulated annealing, Simulated annealing: An introduction
Cites Work
