Abstract The network of container transportation with dumping trailers is a typical NP-hard problem and has strict requirement on time. Therefore, vehicle routing becomes the core problem of the network. In this paper, the vehicle routing optimization model is built for the network of container transportation with dumping trailers to analyze the vehicle routing optimization problem under hard time constraint. In addition, via simulated annealing algorithm, the model is solved and finally verified via sample calculation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Vehicle Routing Model and Algorithm Study for the Network of Container Transportation with Dumping Trailers Under Hard Time Window Constraint


    Contributors:
    Jiang, Liupeng (author) / Yang, Yilin (author) / Zhang, Yan (author) / Feng, Xuejun (author) / Ji, Jie (author)


    Publication date :

    2017-07-12


    Size :

    10 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Vehicle Routing Model and Algorithm Study for the Network of Container Transportation with Dumping Trailers Under Hard Time Window Constraint

    Jiang, Liupeng / Yang, Yilin / Zhang, Yan et al. | British Library Conference Proceedings | 2018



    Automotive transportation by trailers

    Greer, E. R. | Engineering Index Backfile | 1923


    Freight transportation with motor trucks and trailers

    Heintz, E. | Engineering Index Backfile | 1926


    Trailers & Semi-trailers

    Online Contents | 2014