A new variant of the full truckload vehicle routing problem is studied. In this problem there is more than one delivery point corresponding to the same pickup point, and one order is allowed to be served several times by the same vehicle or different vehicles. For the orders which cannot be assigned because of resource constraints, the logistics company outsources them to other logistics companies at a certain cost. To maximize its profits, a logistics company decides what is to be transported by private fleet and what is to be outsourced. The mathematical model is constructed for the problem. Since the problem is NP-hard and it is difficult to solve the large-scale problems with an exact algorithm, a hybrid genetic algorithm is proposed. Computational results show the effectiveness of the hybrid genetic algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Full Truckload Vehicle Routing Problem with Profits


    Contributors:
    Li, Jian (author) / Lu, Wenhua (author)

    Conference:

    14th COTA International Conference of Transportation Professionals ; 2014 ; Changsha, China


    Published in:

    CICTP 2014 ; 864-875


    Publication date :

    2014-06-24




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Full truckload vehicle routing problem with profits

    Jian Li / Wenhua Lu | DOAJ | 2014

    Free access


    Optimal Stochastic Delivery Planning in Full-Truckload and Less-Than-Truckload Delivery

    Sawadsitang, Suttinee / Kaewpuang, Rakpong / Jiang, Siwei et al. | IEEE | 2017


    Multi-routing for Transport-Matching in Cooperative, Full Truckload, Relay Networks

    Nieberding, Bernd | British Library Conference Proceedings | 2017


    Real-time Multi-period truckload routing problems

    Limpaitoon, Tanachai | DSpace@MIT | 2008

    Free access