Cart (Loading....) | Create Account
Close category search window
 

Configuring microgenetic algorithms for solving traffic control problems: the case of number of generations

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)
Abu-Lebdeh, G. ; Dept. of Civil & Environ. Eng., Michigan State Univ., East Lansing, MI ; Al-Omari, B.H.

Efficient and successful use of genetic algorithms (GAs) requires careful selection of several parameter values. One such critical parameter is the processing time (or, number of generations) that is sufficient to ensure suitable convergence. Todate there is only limited guidance on this subject, and in most cases detailed knowledge of the structure and properties of the problem is necessary for such guidance to be useable. For real world problems such knowledge may not be readily available. We describe an experimental approach to establish relationships between time to convergence and problem size of microgenetic algorithms (m-GAs). A discrete time dynamical traffic control problem with different sizes and levels of complexity was used as a test bed. The results showed that upon appropriately sizing the m-GA population, the m-GA can converge to a near-optimal solution in a number of generations equal to the string length. The results also demonstrate that with the selection of appropriate number of generations, it is possible to get most of the worth of the theoretically optimal solution but with only a fraction of the computation cost. The results showed that as the size of the optimization problem grew exponentially, the time requirements of m-GA grew only linearly thus making m-GAs especially suited for optimizing large scale and combinatorial problems for online optimization

Published in:

Uncertainty Modeling and Analysis, 2003. ISUMA 2003. Fourth International Symposium on

Date of Conference:

24-24 Sept. 2003

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.