By Topic

A new evolutionary programming approach based on simulated annealing with local cooling schedule

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Hyeon-loong Cho ; Dept. of Electr. Eng., Pohang Univ. of Sci. & Technol., South Korea ; Se-Young Oh ; Doo-Hyun Choi

The NPOSA (New Population-Oriented Simulated Annealing) technique is introduced as an efficient global search tool to solve optimization problems. Unlike the conventional simulated annealing or its hybrid algorithms, each individual in the population can intelligently plan its own annealing schedule in an adaptive fashion to the given problem at hand. This not only enhances the search speed but furthermore yields a solution near the global optimum. This technique has been applied to solve the traveling salesman problem (TSP) for combinatorial optimization, as well as a continuous function optimization problem, to demonstrate its validity and effectiveness

Published in:

Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on

Date of Conference:

4-9 May 1998