An overview on vehicle scheduling models

@article{Bunte2009AnOO,
  title={An overview on vehicle scheduling models},
  author={Stefan Bunte and Natalia Kliewer},
  journal={Public Transport},
  year={2009},
  volume={1},
  pages={299-317}
}
The vehicle scheduling problem, arising in public transport bus companies, addresses the task of assigning buses to cover a given set of timetabled trips with consideration of practical requirements such as multiple depots and vehicle types as well as further extensions. An optimal schedule is characterized by minimal fleet size and/or minimal operational costs. Various publications were released as a result of extensive research in the last decades on this topic. Several modeling approaches as… 
View on Springer
wiwi.uni-paderborn.de
210 Citations
Highly Influential Citations
11
Background Citations
68
Methods Citations
20
Results Citations
1

210 Citations

Citation Type

Citation Type

Integrated Vehicle Scheduling and Vehicle Assignment
TLDR
This paper gives a set partitioning model for the multi-depot integrated vehicle scheduling and vehicle assignment problem, and gives a column generation-based solution method, and demonstrates its efficiency on randomly generated test instances.
Vehicle scheduling for suburban public transport
TLDR
A column generation heuristic is proposed to solve the Vehicle Scheduling Problem and two heuristic algorithms are used to provide a set of initial columns, one of them is based on the auction algorithm for Single Depot VSP (SDVSP), which has NP-Hard Complexity.
Optimizing mixed-fleet bus scheduling under range constraint
This paper develops a formulation for the multiple depot (MD) vehicle scheduling problem with multiple vehicle types (MVT), including electric buses (EBs), under range and refueling constraints. A…
A NEW IMPLEMENTATION TO THE VEHICLE TYPE SCHEDULING PROBLEM WITH TIME WINDOWS FOR SCHEDULED TRIPS
Kliewer et al. (2006b, 2011) proposed a time window implementation to the multi-depot vehicle (and crew) scheduling problem using a time-space network (TSN). Based on this approach, we developed a…
A Time-Space Network Approach for the Integrated Vehicle- and Crew-Scheduling Problem with Multiple Depots
TLDR
A new modeling approach is presented that is based on a time-space network representation of the underlying vehicle-scheduling problem that outperforms other methods from the literature for well-known test problems.
Efficient Framework for Resource Allocation in Vehicle Scheduling
TLDR
A genetic algorithm focusing on optimization algorithm with time limitations of total vehicle travel time, tardiness, and fleet size are treated explicitly and its higher efficiency as compared to greedy approaches is shown.
Public transport vehicle scheduling featuring multiple vehicle types
Integrated Line Planning and Vehicle Scheduling for Public Transport
In public transport planning, the operational costs are mainly de-termined by the vehicle schedule. However, in the traditionally sequential planning approach, vehicle scheduling is one of the last…
EXPLOITING THE TIMETABLING FLEXIBILITY IN THE CONTEXT OF THE VEHICLE SCHEDULING PROBLEM WITH HETEROGENEOUS FLEET
TLDR
A VTSP model proposed in the literature is extended to enable timetabling flexibility and significant savings in the daily operation of the public transportation service are verified with acceptable impact on passengers’ experience.
A review of integrated approaches for optimizing electric vehicle and crew schedules
In the public bus transport industry, the vehicle and crew scheduling problems are the primary drivers of cost. Given a set of timetabled trips, the vehicle scheduling problem (VSP) assigns buses to…
...
...

References

SHOWING 1-10 OF 58 REFERENCES
An Exact Algorithm for Combining Vehicle Trips
We consider a vehicle scheduling problem arising in freight transport systems where a vehicle fleet of different classes, split among different depots, must be used to perform a set of trips over a…
Models and Algorithms for Single-Depot Vehicle Scheduling
TLDR
A new two-phase approach which is valid in the case of a special cost structure, an auction algorithm for the quasiassignment problem, a core-oriented approach, and an extensive computational study are considered.
Solving large multiple-depot multiple-vehicle-type bus scheduling problems in practice
Abstract.We consider the multiple-depot multiple-vehicle-type scheduling problem (MDVSP) which arises in public transport bus companies and aims to assign buses to cover a given set of timetabled…
A time-space network based exact optimization model for multi-depot bus scheduling
A branch and bound algorithm for the multiple depot vehicle scheduling problem
TLDR
Analysis of the scheduling problem for freight vehicles assigned to various different depots considers the np-hard multiple depot case in which, in addition, one has to assign vehicles to depots, and a strong dominance procedure derived from new dominance criteria is described.
Multi-depot vehicle scheduling problems with time windows and waiting costs
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
TLDR
This work gives a 0-1 linear programming formulation based on binary variables associated with trip transitions, which applies to both crew and vehicle scheduling, and enhances the model by means of new families of valid inequalities.
A NEW SOLUTION MODEL FOR MULTI-DEPOT MULTI-VEHICLE-TYPE VEHICLE SCHEDULING IN ( SUB ) URBAN PUBLIC TRANSPORT
The Vehicle Scheduling Problem (VSP) is the task of building an optimal set of rotations (vehicle schedule), such that each trip of a given timetable is covered by exactly one rotation. The…
Vehicle Scheduling Problem with Multiple Type of Vehicles and a Single Depot
This work is concerned with the vehicle scheduling problem with multiple type of vehicles, which consists on the scheduling of a set of trips so as to establish the individual services of vehicles…
A set partitioning approach to the multiple depot vehicle scheduling problem
TLDR
A procedure is described that, without using the SP matrix, computes a lower bound to the MD-VSP by finding a heuristic solution to the dual of the continuous relaxation of SP in such a way that the resu SP problem can be solved by usual branch and bound techniques.
...
...