By Topic

Near optimal solutions to the grid connection problem

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)
S. Vedantham ; Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA ; S. Das ; S. S. Iyengar

Stochastic optimization using simulated annealing has found wide applications in combinatorial optimization of NP-complete problems in recent years, especially in VLSI related problems. The grid connection problem is a combinatorial optimization problem that is proven to be NP-complete. In this paper the simulated annealing algorithm has been applied to the grid connection problem. The authors also propose an algorithm for the grid connection problem based on certain heuristics. Results of the authors' simulations show that while both algorithms do yield good solutions, those of the simulated annealing are superior to those of the heuristic algorithm, with rare exceptions

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:7 )

Date of Conference:

27 Jun-2 Jul 1994