title: Combinatorial optimization with use of guided evolutionary simulated annealing.
abstract: Feasible approaches to the task of solving NP-complete problems usually entails the incorporation of heuristic procedures so as to increase the efficiency of the methods used. We propose a new technique, which incorporates the idea of simulated annealing into the practice of simulated evolution, in place of arbitrary heuristics. The proposed technique is called guided evolutionary simulated annealing (GESA). We report on the use of GESA approach primarily for combinatorial optimization. In addition, we report the case of function optimization, treating the task as a search problem. The traveling salesman problem is taken as a benchmark problem in the first case. Simulation results are reported. The results show that the GESA approach can discover a very good near optimum solution after examining an extremely small fraction of possible solutions. A very complicated function with many local minima is used in the second case. The results in both cases indicate that the GESA technique is a practicable method which yields consistent and good near optimal solutions, superior to simulated evolution.
authors.affiliation: Dept. of Electr. Eng. and Appl. Phys., Case Western Reserve Univ., Cleveland, OH.
authors.forename: P C
authors.initials: PC
authors.lastname: Yip
authors.forename: Y H
authors.initials: YH
authors.lastname: Pao