Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Comparison of a genetic algorithm with a simulated annealing algorithm for the design of an ATM network

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
$31 $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

2 Author(s)
Thompson, D.R. ; Dept. of Comput. Sci., Arkansas Univ., Fayetteville, AR, USA ; Bilbro, G.L.

The genetic algorithm (GA) and simulated annealing algorithm (SA) are empirically compared for the problem of optimizing the topological design of a network. In addition to the usual problem of optimizing only the placement of links, in this paper the number and placement of concentrators are also decision variables for a class of problems using a real set of concentrators, links, and traffic. The average GA solution cost less than the average SA solution.

Published in:

Communications Letters, IEEE  (Volume:4 ,  Issue: 8 )