By Topic

Phone routing using the dynamic memory model

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

2 Author(s)
Bendtsen, C.N. ; Dept. of Comput. Sci., EVALife, Aarhus, Denmark ; Krink, T.

In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony optimization algorithms that are specially designed for this problem

Published in:

Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on  (Volume:1 )

Date of Conference:

12-17 May 2002