Thumbnail
Access Restriction
Subscribed

Author Hyeon-loong Cho ♦ Se-Young Oh ♦ Doo-Hyun Choi
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1998
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Genetic programming ♦ Simulated annealing ♦ Costs ♦ Electronics cooling ♦ Traveling salesman problems ♦ Temperature distribution ♦ Electronic mail ♦ Scheduling algorithm ♦ Adaptive scheduling ♦ Solids
Abstract 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.
Description Author affiliation: Dept. of Electr. Eng., Pohang Univ. of Sci. & Technol., South Korea (Hyeon-loong Cho)
ISBN 0780348699
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1998-05-04
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 499.46 kB
Page Count 5
Starting Page 598
Ending Page 602


Source: IEEE Xplore Digital Library