The driver scheduling problem (DSP) is type of problem in
operations research
Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve dec ...
and
theoretical computer science
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.
It is difficult to circumsc ...
.
The DSP consists of selecting a set of duties (assignments) for the drivers or pilots of vehicles (e.g., buses, trains, boats, or planes) involved in the transportation of passengers or goods,
within the constraints of various legislative and logistical criteria.
Criteria and modelling
This very complex problem involves several constraints related to labour and company rules and also different evaluation criteria and objectives. Being able to solve this problem efficiently can have a great impact on costs and quality of service for public transportation companies. There is a large number of different rules that a feasible duty might be required to satisfy, such as
*Minimum and maximum stretch duration
*Minimum and maximum break duration
*Minimum and maximum work duration
*Minimum and maximum total duration
*Maximum extra work duration
*Maximum number of vehicle changes
*Minimum driving duration of a particular vehicle
Operations research
Operations research ( en-GB, operational research) (U.S. Air Force Specialty Code: Operations Analysis), often shortened to the initialism OR, is a discipline that deals with the development and application of analytical methods to improve dec ...
has provided
optimization
Mathematical optimization (alternatively spelled ''optimisation'') or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfi ...
models and
algorithm
In mathematics and computer science, an algorithm () is a finite sequence of rigorous instructions, typically used to solve a class of specific problems or to perform a computation. Algorithms are used as specifications for performing ...
s that lead to efficient solutions for this problem. Among the most common models proposed to solve the DSP are the
Set Covering
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972.
Given a set of elements (called the uni ...
and Set Partitioning Models (SPP/SCP). In the SPP model, each work piece (task) is covered by only one duty. In the SCP model, it is possible to have more than one duty covering a given work piece.
In both models, the set of work pieces that needs to be covered is laid out in rows, and the set of previously defined feasible duties available for covering specific work pieces is arranged in columns. The DSP resolution, based on either of these models, is the selection of the set of feasible duties that guarantees that there is one (SPP) or more (SCP) duties covering each work piece while minimizing the total cost of the final schedule.
See also
*
Crew scheduling
Crew scheduling is the process of assigning crews to operate transportation systems, such as rail lines or airlines.
Complex
Most transportation systems use software to manage the crew scheduling process. Crew scheduling becomes more and more c ...
*
Deadheading (employee)
Deadheading is the practice of carrying, free of charge, a transport company's own staff on a normal passenger trip so that they can be in the right place to begin their duties. In United States railway usage, the term may also be used for moveme ...
References
{{Reflist
Algorithms