Considers a vehicle routing problem with full loads and time limit constraints. This problem can be formulated as an asymmetrical travelling salesman problem with two types of restrictions. When these restrictions are not too stringent, the problem can be solved optimally for relatively large sizes.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Vehicle routing with full loads


    Weitere Titelangaben:

    Fahrzeugverteilungssteuerung mit vollen Ladungen


    Beteiligte:
    Desrosiers, J. (Autor:in) / Laporte, G. (Autor:in) / Sauve, M. (Autor:in) / Soumis, F. (Autor:in) / Taillefer, S. (Autor:in)

    Erschienen in:

    Erscheinungsdatum :

    1988


    Format / Umfang :

    8 Seiten, 7 Quellen



    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Print


    Sprache :

    Englisch




    Vehicle Routing and Scheduling with Full Truckloads

    Arunapuram, S. / Mathur, K. / Solow, D. | British Library Online Contents | 2003


    Loads Cascading for Full Vehicle Component Design

    Woodward, Andy / Hallet, Christoph / Bishop, Neil et al. | SAE Technical Papers | 2020


    Loads Cascading for Full Vehicle Component Design

    Bishop, Neil / Roemelt, Philipp / Woodward, Andy et al. | British Library Conference Proceedings | 2020


    Vehicle Routing and Scheduling with Full Truckloads

    Arunapuram, Sundararajan | Online Contents | 2003


    Loads Cascading for Full Vehicle Component Design

    Bishop, Neil / Roemelt, Philipp / Woodward, Andy et al. | British Library Conference Proceedings | 2020