IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v2y2011i2p21-50.html
   My bibliography  Save this article

Management of Bus Driver Duties Using Data Mining

Author

Listed:
  • Walid Moudani

    (Lebanese University, Lebanon)

  • Félix Mora-Camino

    (Ecole Nationale de l’Aviation Civile, France)

Abstract

This paper presents Bus Driver Allocation Problem (BDAP) which deals with the assignment of the drivers to the scheduled duties so that operations costs are minimized while its solution meets hard constraints resulting from the safety regulations of public transportation authorities as well as from the internal company’s agreements. Another concern in this study is the overall satisfaction of the drivers since it has important consequences on the quality and economic return of the company operations. This study proposes a non-dominated bi-criteria allocation approach of bus drivers to trips while minimizing the operations cost and maximizing the level of satisfaction of drivers. This paper proposes a new mathematical formulation to model the allocation problem. Its complexity has lead to solving the BDAP by using techniques such as: Genetic algorithms in order to assign the drivers with minimal operations cost and Fuzzy Logic and Rough Set techniques in order to fuzzyfied some parameters required for the satisfaction module followed by applying the Rough Set technique to evaluate the degree of satisfaction for the drivers. The application of the proposed approach to a medium size Transport Company Bus Driver Allocation Problem is evaluated.

Suggested Citation

  • Walid Moudani & Félix Mora-Camino, 2011. "Management of Bus Driver Duties Using Data Mining," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 2(2), pages 21-50, April.
  • Handle: RePEc:igg:jamc00:v:2:y:2011:i:2:p:21-50
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/ijamc.2011040102
    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:jamc00:v:2:y:2011:i:2:p:21-50. 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.