A

Vehicle Routing and Crew Scheduling Problems

Springer eBooks, pp. 295–349

Abstract

Abstract In this chapter we illustrate the application of column generation to a variety of vehicle routing and crew scheduling problems, starting with the classical vehicle routing problem with time windows. In particular, we describe dynamic programming algorithms for solving shortest path problems with resource constraints.

Authors 4

  1. Jacques Desrosiers corresponding

    HEC Montréal · Group for Research in Decision Analysis

    Affiliation as printed

    GERAD and Département de sciences de la décision, HEC Montréal, Montréal, Canada

  2. RWTH Aachen University

    Affiliation as printed

    GERAD and School of business and economics, RWTH Aachen University, Aachen, Germany

  3. Group for Research in Decision Analysis · Polytechnique Montréal

    Affiliation as printed

    GERAD and Département de mathématiques et de génie industriel, Polytechnique Montréal, Montréal, Canada

  4. Affiliation as printed

    Mainz, Germany

Cited by 0 stored of 0

No patents citing this paper on Lens.org (checked 2026-10-06).

References 0