Application Oriented Variable Fixing Methods for the Multiple Depot Vehicle Scheduling Problem

被引：5
|
作者：
David, Balazs [1 ]
Kresz, Miklos [1 ]
机构：
[1] Univ Szeged, Szeged, Hungary
来源：
ACTA CYBERNETICA | 2013年 / 21卷 / 01期
关键词：
vehicle scheduling; variable fixing;
D O I：
10.14232/actacyb.21.1.2013.5
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this article, we present heuristic methods for the vehicle scheduling problem that solve it by reducing the problem size using different variable fixing approaches. These methods are constructed in a way that takes some basic driver requirements into consideration as well. We show the efficiency of the methods on real-life and random data instances too. We also give an improved way of generating random input for the vehicle scheduling problem.
引用
收藏
页码：53 / 73
页数：21
相关论文
共 50 条
  • [1] Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
    Dauer, Armando Teles
    Prata, Bruno de Athayde
    [J]. OPTIMIZATION LETTERS, 2021, 15 (01) : 153 - 170
  • [2] Variable fixing heuristics for solving multiple depot vehicle scheduling problem with heterogeneous fleet and time windows
    Armando Teles Dauer
    Bruno de Athayde Prata
    [J]. Optimization Letters, 2021, 15 : 153 - 170
  • [3] HEURISTIC ALGORITHMS FOR THE MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM
    DELLAMICO, M
    FISCHETTI, M
    TOTH, P
    [J]. MANAGEMENT SCIENCE, 1993, 39 (01) : 115 - 125
  • [4] A benchmark dataset for the multiple depot vehicle scheduling problem
    Kulkarni, Sarang
    Krishnamoorthy, Mohan
    Ranade, Abhiram
    Ernst, Andreas T.
    Patil, Rahul
    [J]. DATA IN BRIEF, 2019, 22 : 484 - 487
  • [5] A study of neighborhood structures for the multiple depot vehicle scheduling problem
    Laurent, Benoit
    Hao, Jin-Kao
    [J]. ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 197 - +
  • [6] Iterated local search for the multiple depot vehicle scheduling problem
    Laurent, Benoit
    Hao, Jin-Kao
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 57 (01) : 277 - 286
  • [7] A BRANCH AND BOUND ALGORITHM FOR THE MULTIPLE DEPOT VEHICLE SCHEDULING PROBLEM
    CARPANETO, G
    DELLAMICO, M
    FISCHETTI, M
    TOTH, P
    [J]. NETWORKS, 1989, 19 (05) : 531 - 548
  • [8] A comparison of five heuristics for the multiple depot vehicle scheduling problem
    Pepin, Ann-Sophie
    Desaulniers, Guy
    Hertz, Alain
    Huisman, Dennis
    [J]. JOURNAL OF SCHEDULING, 2009, 12 (01) : 17 - 30
  • [9] A comparison of five heuristics for the multiple depot vehicle scheduling problem
    Ann-Sophie Pepin
    Guy Desaulniers
    Alain Hertz
    Dennis Huisman
    [J]. Journal of Scheduling, 2009, 12 : 17 - 30
  • [10] THE SINGLE DEPOT VEHICLE SCHEDULING PROBLEM
    FERLAND, JA
    [J]. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 87 : 99 - 112
12345