Abstract This paper addresses the vehicle routing problem in which delivery vehicles can perform several trips within one workday. Initially, a mathematical model of the multiple-trip vehicle routing problem (MTVRP) is formulated. Its objective is to minimize a total cost that consists of the costs of vehicles, workforce, and transportation. The MTVRP assumes that vehicles and workers are heterogeneous, customer locations and demands are known, all vehicles must complete their trips within one workday, delivery workers are pre-assigned to vehicles, and all loads are unloaded from vehicles manually. For safety, a total physical workload endured by any worker must not exceed his/her working physical capacity. A numerical example is presented. The MTVRP solutions are determined using the ILOG CPLEX. The result shows that by allowing the vehicles to make several trips, the total cost can be reduced, and both vehicles and workers are better utilized. However, workers are required to work harder due to their longer working times.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multiple-Trip Vehicle Routing with Physical Workload


    Contributors:


    Publication date :

    2018-07-13


    Size :

    14 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Autonomous vehicle trip routing

    KONRARDY BLAKE / CHRISTENSEN SCOTT T / HAYWARD GREGORY et al. | European Patent Office | 2024

    Free access

    Workload balancing in vehicle routing problems

    Allison, Jerry Denver | TIBKAT | 1987



    Driver's workload analysis for waste collection vehicle routing problem

    Benjamin, Aida Mauziah / Rahman, Syariza Abdul / Hashim, Fazlini | IEEE | 2015


    Workload Equity in Vehicle Routing Problems: A Survey and Analysis

    Matl, P. / Hartl, R. F. / Vidal, T. | British Library Online Contents | 2018