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

Improved Genetic Algorithm with Gene Recombination for Bus Crew-Scheduling Problem

Author

Listed:
  • Cuiying Song
  • Wei Guan
  • Jihui Ma
  • Tao Liu

Abstract

This paper presents an improved genetic algorithm (GA) with gene recombination for bus crew-scheduling problem in bus company. Unlike existing methods that rely on designing a fixed potential shift set by software, our new method does not need such a potential shift set information. In our method, satisfied shifts are generated through gene recombination in genetic algorithm. We conduct extensive studies based on real-life instances from Beijing Bus Group. Compared with results generated by the current manual method, ant colony algorithm, and CPLEX, computational results show that our algorithms demonstrated very good computational performances. In our tests, the number of the maximum reducing shifts can be beyond 30, especially when trip number is very large. The high relative percentage deviation demonstrated the effectiveness of the algorithm proposed.

Suggested Citation

  • Cuiying Song & Wei Guan & Jihui Ma & Tao Liu, 2015. "Improved Genetic Algorithm with Gene Recombination for Bus Crew-Scheduling Problem," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-14, September.
    • Handle: RePEc:hin:jnlmpe:719409
    DOI: 10.1155/2015/719409
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2015/719409.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2015/719409.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2015/719409?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:jnlmpe:719409. 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.