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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.