By Topic

Applying the genetic approach to simulated annealing in solving some NP-hard problems

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)
Feng-Tse Lin ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Cheng-Yan Kao ; Ching-Chi Hsu

A stochastic approach called the annealing-genetic algorithm is presented for solving some well-known combinatorial optimization problems. This approach incorporates genetic algorithms into simulated annealing to improve the performance of simulated annealing. The authors' approach can be viewed as a simulated annealing algorithm with population-based state transition and with genetic-operator-based quasi-equilibrium control and as a genetic algorithm with the Boltzmann-type selection operator. The goals of efficiency in the algorithm are (1) the gap between final solution and the optimal solution should be around 3% or less, and (2) the computation time should be bounded by a polynomial function of the problem size. Empirically, the error rate of the proposed annealing-genetic algorithm for solving the multiconstraint zero-one knapsack problem is less than 1%, for solving the set partitioning problem is less than 0.1%, and for solving the traveling salesman problem is around 3%

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:23 ,  Issue: 6 )