In most developed countries working hours of truck drivers are constrained by hours of service regulations. When optimizing vehicle routes, trucking companies must consider these constraints to assure that drivers can comply with the regulations. This paper studies the combined vehicle routing and truck driver scheduling problem (VRTDSP), which generalizes the well-known vehicle routing problem with time windows by considering working hour constraints. A branch-and-price algorithm for solving the VRTDSP is presented. This is the first algorithm that solves the VRTDSP to proven optimality.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems


    Beteiligte:

    Erschienen in:

    Erscheinungsdatum :

    2017




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch



    Klassifikation :

    Lokalklassifikation TIB:    770/1935/7000
    BKL:    55.80 / 55.80 Verkehrswesen, Transportwesen: Allgemeines



    An Exact Method for Vehicle Routing and Truck Driver Scheduling Problems

    Goel, Asvin / Irnich, Stefan | British Library Online Contents | 2017




    Truck Driver Scheduling in the European Union

    Goel, A. | British Library Online Contents | 2010


    Truck Driver Scheduling in the United States

    Goel, A. / Kok, L. | British Library Online Contents | 2012