Multiple depot vehicle and crew scheduling with time windows for scheduled trips

被引:0
|
作者
Natalia Kliewer
Bastian Amberg
Boris Amberg
机构
[1] Freie Universität Berlin,Chair of Information Systems
[2] University of Paderborn,Decision Support & OR Lab and International Graduate School of Dynamic Intelligent Systems
关键词
Multiple depot scheduling; Integrated vehicle and crew scheduling; Time windows; Time-space-network; Public transportation;
D O I
10.1007/s12469-011-0049-6
中图分类号
学科分类号
摘要
This paper examines time windows for scheduled trips in multiple depot vehicle and crew scheduling problems that arise in public bus transportation. In practice, the two planning tasks vehicle scheduling and crew scheduling are traditionally solved sequentially with the implicit understanding that the scheduled time for timetabled trips remains fixed. In order to improve cost efficiency two concepts have been developed over the last years: In order to obtain better flexibility when scheduling crews, vehicle and crew scheduling problems are tackled simultaneously. In order to extend flexibility while scheduling vehicles, variable trip departure and arrival times are considered. Obviously the combination of both concepts promises the largest savings, but probably leads to bursting computational times due to growing problem complexity.
引用
收藏
页码:213 / 244
页数:31
相关论文
共 50 条
  • [21] A vehicle scheduling problem with fixed trips and time limitations
    Eliiyi, Deniz Tuersel
    Ornek, Arslan
    Karakutuk, Sadik Serhat
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2009, 117 (01) : 150 - 161
  • [22] Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time
    Ricard, Lea
    Desaulniers, Guy
    Lodi, Andrea
    Rousseau, Louis -Martin
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2024, 127
  • [23] Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
    Horvath, Marko
    Kis, Tamas
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2019, 27 (01) : 39 - 67
  • [24] Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price
    Markó Horváth
    Tamás Kis
    Central European Journal of Operations Research, 2019, 27 : 39 - 67
  • [25] VEHICLE-ROUTING AND SCHEDULING WITH TIME WINDOWS
    DESROSIERS, J
    SOUMIS, F
    DESROCHERS, M
    SAUVE, M
    MATHEMATICAL PROGRAMMING STUDY, 1986, 26 : 249 - 251
  • [26] Iterated local search for the multiple depot vehicle scheduling problem
    Laurent, Benoit
    Hao, Jin-Kao
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (01) : 277 - 286
  • [27] A study of neighborhood structures for the multiple depot vehicle scheduling problem
    Laurent, Benoit
    Hao, Jin-Kao
    ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 197 - +
  • [28] A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
    Lucci, Mauro
    Severin, Daniel
    Zabala, Paula
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2023, 30 (02) : 970 - 1001
  • [29] A BRANCH AND BOUND ALGORITHM FOR THE MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM
    CARPANETO, G
    DELLAMICO, M
    FISCHETTI, M
    TOTH, P
    NETWORKS, 1989, 19 (05) : 531 - 548
  • [30] Set partitioning approach to the Multiple Depot Vehicle Scheduling Problem
    Bianco, L.
    Mingozzi, A.
    Ricciardelli, S.
    Optimization Methods and Software, 1994, 3 (1-3) : 163 - 194