Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem

@article{Mesquita2008SetPA,
  title={Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem},
  author={Marta Mesquita and Ana Paias},
  journal={Computers & OR},
  year={2008},
  volume={35},
  pages={1562-1575}
}
In the integrated vehicle and crew scheduling problem (VCSP) one has to simultaneously assign vehicles to timetabled trips and drivers to vehicles. In this paper, the VCSP is described by an integer linear programming formulation combining a multicommodity network flow model with a set partitioning/covering model. We propose an algorithm that starts with a pre-processing phase to define the set of tasks and to obtain an initial set of duties. In a second phase, we solve the linear programming… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 39 CITATIONS

A hybrid evolutionary algorithm for the vehicle and crew scheduling problem in public transit

  • 2007 IEEE Congress on Evolutionary Computation
  • 2007
VIEW 6 EXCERPTS
CITES RESULTS & BACKGROUND
HIGHLY INFLUENCED

An Integrated Model of Vehicle and Crew Scheduling with Multi-Depots

  • 2009 International Conference on Computational Intelligence and Software Engineering
  • 2009
VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Topics in Integrated Vehicle and Crew Scheduling in Public Transport

VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

M.An integrated approach to ex-urban crew and vehicle scheduling. In: Wilson NHM, editor. Computer-aided transit scheduling, Lecture notes in economics and mathematical systems, vol. 471

GaffiA, Nonato
  • 1999
VIEW 1 EXCERPT