Paper
2 February 1993 Modification of simulated annealing method for solving combinatorial optimization problems
Boris S. Kiselyov, Nickolay Yu Kulakov, Andrei L. Mikaelian
Author Affiliations +
Abstract
Proposed is a modification of simulated annealing method to minimize the cost function in combinatorial optimization problems. The modification differs from the traditional method in that, first, a random fluctuation of the cost function feasible at the given effective temperature is evaluated, and then, a few random rearrangements of system elements are executed. Accepted are those rearrangements for which the real change in the cost function does not exceed this random fluctuation. As shown, the probability of finding an optimal or near-optimal solution is improved by increasing the number of rearrangements for one fluctuation, the annealing time being the same. The proposed method is more adapted to parallel computing devices.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Boris S. Kiselyov, Nickolay Yu Kulakov, and Andrei L. Mikaelian "Modification of simulated annealing method for solving combinatorial optimization problems", Proc. SPIE 1773, Photonics for Computers, Neural Networks, and Memories, (2 February 1993); https://doi.org/10.1117/12.983196
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Annealing

Neural networks

Chemical elements

Computer simulations

Neurons

Optimization (mathematics)

Back to Top