This paper considers the problem of scheduling a fleet of identical vehicles to execute a set of freight orders in truckload quantities. Each freight order is given in terms of an origin and a destination and the number of truckloads to be transported between them. The goal is to minimize the total cost of travel while completing all freight orders. Our work is the first to allow vehicles to be dispatched from a depot and discharged into another after service. We propose an algorithm that starts from an optimal solution to a network flow model which considers all data in the problem in parallel including unloaded travel costs, freight orders, depots, availability of vehicles and the vehicle receiving capacity at each depot. The network solution is then iteratively modified through heuristic operations and the routing of vehicles is determined, one at a time, based on the modified solution. A novel feature of the algorithm is the option of resolving the network model for scheduling the remaining vehicles.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm


    Contributors:

    Conference:

    International Conference on Traffic and Transportation Studies (ICTTS) 2002 ; 2002 ; Guilin, China



    Publication date :

    2002-07-10




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Full Load Vehicle Routing with Multiple Depots: A New, Network Flow Based Algorithm

    Zhang, M. / Jiang, D. / Tang, X. et al. | British Library Conference Proceedings | 2002



    The vehicle routing problem with multiple depots (MDVRP) in supply chain

    Mezatio, Eric Papain | ORKG Comparisons | 2022

    Free access