Journal ArticleDOI
Optimization by Simulated Annealing: Quantitative Studies
Reads0
Chats0
TLDR
Experimental studies of the simulated annealing method are presented and its computational efficiency when applied to graph partitioning and traveling salesman problems are presented.Abstract:
Simulated annealing is a stochastic optimization procedure which is widely applicable and has been found effective in several problems arising in computeraided circuit design. This paper derives the method in the context of traditional optimization heuristics and presents experimental studies of its computational efficiency when applied to graph partitioning and traveling salesman problems.read more
Citations
More filters
BookDOI
Handbook of Markov Chain Monte Carlo
TL;DR: A Markov chain Monte Carlo based analysis of a multilevel model for functional MRI data and its applications in environmental epidemiology, educational research, and fisheries science are studied.
Journal ArticleDOI
Greedy Randomized Adaptive Search Procedures
TL;DR: This paper defines the various components comprising a GRASP and demonstrates, step by step, how to develop such heuristics for combinatorial optimization problems.
Journal ArticleDOI
The Ant Lion Optimizer
TL;DR: The results of the test functions prove that the proposed ALO algorithm is able to provide very competitive results in terms of improved exploration, local optima avoidance, exploitation, and convergence, showing that this algorithm has merits in solving constrained problems with diverse search spaces.
Journal ArticleDOI
Multi-Verse Optimizer: a nature-inspired algorithm for global optimization
TL;DR: This paper proposes a novel nature-inspired algorithm called Multi-Verse Optimizer, based on three concepts in cosmology: white hole, black hole, and wormhole, which outperforms the best algorithms in the literature on the majority of the test beds.
Journal ArticleDOI
Soft Margins for AdaBoost
TL;DR: It is found that ADABOOST asymptotically achieves a hard margin distribution, i.e. the algorithm concentrates its resources on a few hard-to-learn patterns that are interestingly very similar to Support Vectors.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Journal ArticleDOI
Equation of state calculations by fast computing machines
TL;DR: In this article, a modified Monte Carlo integration over configuration space is used to investigate the properties of a two-dimensional rigid-sphere system with a set of interacting individual molecules, and the results are compared to free volume equations of state and a four-term virial coefficient expansion.
Journal ArticleDOI
An efficient heuristic procedure for partitioning graphs
Brian W. Kernighan,Shou-De Lin +1 more
TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Journal ArticleDOI
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
S. Lin,Brian W. Kernighan +1 more
TL;DR: This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Journal ArticleDOI
Computer solutions of the traveling salesman problem
TL;DR: Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.