Abstract
This paper introduces a generalization of the simulated annealing algorithm for global optimization. Simulated annealing has been successfully applied to a number of combinatorial and continuous optimization problems. The original approach has been significantly improved by introducing adaptive annealing schedules and annealing several copies of the problem in parallel. In this paper we make a further step and propose a generalized simulated annealing algorithm called Demon Algorithm. This algorithm is constructed in analogy to the action of Maxwell's Demon and has been motivated by an information-theoretic analysis of simulated annealing. The algorithm is based on an ensemble of identical systems that are annealed in parallel. The ensemble evolves according to a sequence of target distributions with the aim to end up in a distribution that is concentrated on optimal solutions. The evolution of the ensemble is based on collective moves. The algorithm is implemented for the problem of graph bipartitioning ...
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
