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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Vehicle routing with full loads


    Additional title:

    Fahrzeugverteilungssteuerung mit vollen Ladungen


    Contributors:
    Desrosiers, J. (author) / Laporte, G. (author) / Sauve, M. (author) / Soumis, F. (author) / Taillefer, S. (author)

    Published in:

    Publication date :

    1988


    Size :

    8 Seiten, 7 Quellen



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English




    Full Truckload Vehicle Routing Problem with Profits

    Li, Jian / Lu, Wenhua | ASCE | 2014


    Vehicle Routing and Scheduling with Full Truckloads

    Arunapuram, Sundararajan | Online Contents | 2003


    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

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


    Loads Cascading for Full Vehicle Component Design

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