IDEAS home Printed from https://ideas.repec.org/a/hin/jnddns/767429.html
   My bibliography  Save this article

Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem

Author

Listed:
  • Yu Zhou
  • Leishan Zhou
  • Yun Wang

Abstract

High-speed railway is one of the most important ways to solve the long-standing travel difficulty problem in China. However, due to the high acquisition and maintenance cost, it is impossible for decision-making departments to purchase enough EMUs to satisfy the explosive travel demand. Therefore, there is an urgent need to study how to utilize EMU more efficiently and reduce costs in the case of completing a given task in train diagram. In this paper, an EMU circulation scheduling model is built based on train diagram constraints, maintenance constraints, and so forth; in the model solving process, an improved ACA algorithm has been designed. A case study is conducted to verify the feasibility of the model. Moreover, contrast tests have been carried out to compare the efficiency between the improved ACA and the traditional approaches. The results reveal that improved ACA method can solve the model with less time and the quality of each representative index is much better, which means that efficiency of the improved ACA method is higher and better scheduling scheme can be obtained.

Suggested Citation

  • Yu Zhou & Leishan Zhou & Yun Wang, 2014. "Using Improved Ant Colony Algorithm to Investigate EMU Circulation Scheduling Problem," Discrete Dynamics in Nature and Society, Hindawi, vol. 2014, pages 1-13, July.
    • Handle: RePEc:hin:jnddns:767429
    DOI: 10.1155/2014/767429
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2014/767429.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/DDNS/2014/767429.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/767429?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnddns:767429. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.