IDEAS home Printed from https://ideas.repec.org/p/upf/upfgen/547.html
   My bibliography  Save this paper

The crew-scheduling module in the GIST system

Author

Abstract

The public transportation is gaining importance every year basically due the population growth, environmental policies and, route and street congestion. Too able an efficient management of all the resources related to public transportation, several techniques from different areas are being applied and several projects in Transportation Planning Systems, in different countries, are being developed. In this work, we present the GIST Planning Transportation Systems, a Portuguese project involving two universities and six public transportation companies. We describe in detail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and genetic algorithm to solve the bus-driver-scheduling problem. The metaheuristics have been successfully incorporated in the GIST Planning Transportation Systems and are actually used by several companies.

Suggested Citation

  • Helena Ramalhinho-Lourenço, 2001. "The crew-scheduling module in the GIST system," Economics Working Papers 547, Department of Economics and Business, Universitat Pompeu Fabra.
    • Handle: RePEc:upf:upfgen:547
    as

    Download full text from publisher

    File URL: https://econ-papers.upf.edu/papers/547.pdf
    File Function: Whole Paper
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Beasley, J. E., 1987. "An algorithm for set covering problem," European Journal of Operational Research, Elsevier, vol. 31(1), pages 85-93, July.
    2. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    3. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    2. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    3. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    4. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    5. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
    6. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    7. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    8. Grossman, Tal & Wool, Avishai, 1997. "Computational experience with approximation algorithms for the set covering problem," European Journal of Operational Research, Elsevier, vol. 101(1), pages 81-92, August.
    9. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    10. Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
    11. Chunyan Liu & Hejiao Huang & Hongwei Du & Xiaohua Jia, 2017. "Optimal RSUs placement with delay bounded message dissemination in vehicular networks," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1276-1299, May.
    12. Bautista, Joaquín & Pereira, Jordi, 2006. "Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona," Omega, Elsevier, vol. 34(6), pages 617-629, December.
    13. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    14. F J Vasko & P J Knolle & D S Spiegel, 2005. "An empirical study of hybrid genetic algorithms for the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1213-1223, October.
    15. Dimitris Bertsimas & Dan A. Iancu & Dmitriy Katz, 2013. "A New Local Search Algorithm for Binary Optimization," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 208-221, May.
    16. Christian Prins & Caroline Prodhon & Roberto Calvo, 2006. "Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem," Annals of Operations Research, Springer, vol. 147(1), pages 23-41, October.
    17. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    18. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    19. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    20. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.

    More about this item

    Keywords

    Integrated transportation systems; crew scheduling; metaheuristics;
    All these keywords.

    JEL classification:

    • L92 - Industrial Organization - - Industry Studies: Transportation and Utilities - - - Railroads and Other Surface Transportation
    • M12 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Personnel Management; Executives; Executive Compensation
    • D83 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Search; Learning; Information and Knowledge; Communication; Belief; Unawareness

    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:upf:upfgen:547. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: the person in charge (email available below). General contact details of provider: http://www.econ.upf.edu/ .

    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.