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

A Model for Bus Crew Scheduling Problem with Multiple Duty Types

Author

Listed:
  • Mingming Chen
  • Huimin Niu

Abstract

This paper presents an approach for solving the bus crew scheduling problem which considers early, day, and late duty modes with time shift and work intensity constraints. Furthermore, the constraint with the least crew number of a certain duty (e.g., day duty) has also been considered. An optimization model is formulated as a 0-1 integer programming problem to improve the efficiency of crew scheduling at the minimum expense of total idle time of crew for a circle bus line. Correspondingly, a heuristic algorithm utilizing the tabu search algorithm has been proposed to solve the model. Finally, the proposed model and algorithm are successfully tested by a case study.

Suggested Citation

  • Mingming Chen & Huimin Niu, 2012. "A Model for Bus Crew Scheduling Problem with Multiple Duty Types," Discrete Dynamics in Nature and Society, Hindawi, vol. 2012, pages 1-11, September.
    • Handle: RePEc:hin:jnddns:649213
    DOI: 10.1155/2012/649213
    as

    Download full text from publisher

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

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jing Wang & Heqi Wang & Ande Chang & Chen Song, 2022. "Collaborative Optimization of Vehicle and Crew Scheduling for a Mixed Fleet with Electric and Conventional Buses," Sustainability, MDPI, vol. 14(6), pages 1-17, March.

    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:649213. 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.