IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v3y2012i1p13-36.html
   My bibliography  Save this article

Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization

Author

Listed:
  • Sutapa Samanta

    (Maryland State Highway Administration, USA)

  • Manoj K. Jha

    (Morgan State University, USA)

Abstract

The emergence of artificial intelligence (AI)-based optimization heuristics like genetic and ant algorithms is useful in solving many complex transportation location optimization problems. The suitability of such algorithms depends on the nature of the problem to be solved. This study examines the suitability of genetic and ant algorithms in two distinct and complex transportation problems: (1) highway alignment optimization and (2) rail transit station location optimization. A comparative study of the two algorithms is presented in terms of the quality of results. In addition, Ant algorithms (AAs) have been modified to search in a global space for both problems, a significant departure from traditional AA application in local search problems. It is observed that for the two optimization problems both algorithms give almost similar solutions. However, the ant algorithm has the inherent limitation of being effective only in discrete search problems. When applied to continuous search spaces ant algorithm requires the space to be sufficiently discretized. On the other hand, genetic algorithms can be applied to both discrete and continues spaces with reasonable confidence. The application of AA in global search seems promising and opens up the possibility of its application in other complex optimization problems.

Suggested Citation

  • Sutapa Samanta & Manoj K. Jha, 2012. "Applicability of Genetic and Ant Algorithms in Highway Alignment and Rail Transit Station Location Optimization," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 3(1), pages 13-36, January.
    • Handle: RePEc:igg:joris0:v:3:y:2012:i:1:p:13-36
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/joris.2012010102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:igg:joris0:v:3:y:2012:i:1:p:13-36. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    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.