Share Email Print

Proceedings Paper

Modification of simulated annealing method for solving combinatorial optimization problems
Author(s): Boris S. Kiselyov; Nickolay Yu Kulakov; Andrei L. Mikaelian
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 2 February 1993
Proc. SPIE 1773, Photonics for Computers, Neural Networks, and Memories, (2 February 1993); doi: 10.1117/12.983196
Show Author Affiliations
Boris S. Kiselyov, Institute of Optical Neural Technologies (Russia)
Nickolay Yu Kulakov, Institute of Optical Neural Technologies (Russia)
Andrei L. Mikaelian, Institute of Optical Neural Technologies (Russia)

Published in SPIE Proceedings Vol. 1773:
Photonics for Computers, Neural Networks, and Memories
Stephen T. Kowel; John A. Neff; William J. Miceli, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?