IDEAS home Printed from https://ideas.repec.org/a/ids/ijidsc/v11y2019i2p141-162.html
   My bibliography  Save this article

Modelling time complexity of micro-genetic algorithms for online traffic control decisions

Author

Listed:
  • Ghassan Abu-Lebdeh
  • Kenan Hazirbaba
  • Omar Mughieda
  • Bassant Abdelrahman

Abstract

This paper describes an experimental approach to test the suitability of micro-genetic algorithms (m-GAs) to solve large combinatorial traffic control problems and establishes relationships between time to convergence and problem size. A discrete time dynamical traffic control problem with different sizes and levels of complexity was used as a test-bed. Results showed that m-GAs can tackle computationally demanding problems. Upon appropriately sizing the m-GA population, the m-GA converged to a near-optimal solution in a number of generations equal to the string length. Results also demonstrated 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. Results showed that as the size of the optimisation problem grew exponentially, the time requirements of m-GA grew only linearly thus making m-GAs especially suited for optimising large-scale and combinatorial problems for online optimisation.

Suggested Citation

  • Ghassan Abu-Lebdeh & Kenan Hazirbaba & Omar Mughieda & Bassant Abdelrahman, 2019. "Modelling time complexity of micro-genetic algorithms for online traffic control decisions," International Journal of Information and Decision Sciences, Inderscience Enterprises Ltd, vol. 11(2), pages 141-162.
    • Handle: RePEc:ids:ijidsc:v:11:y:2019:i:2:p:141-162
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=101141
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijidsc:v:11:y:2019:i:2:p:141-162. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=306 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.