A new variant of the full truckload vehicle routing problem is studied. In this problem there are more than one delivery points 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 constraint, the logistics company outsources them to other logistics companies at a certain cost. To maximize its profits, logistics company decides which to be transported by private fleet and which 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.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Full truckload vehicle routing problem with profits


    Beteiligte:
    Jian Li (Autor:in) / Wenhua Lu (Autor:in)


    Erscheinungsdatum :

    2014




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Unbekannt




    Full Truckload Vehicle Routing Problem with Profits

    Li, Jian / Lu, Wenhua | ASCE | 2014



    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

    Freier Zugriff