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.
Multiple-Trip Vehicle Routing with Physical Workload
2018-07-13
14 pages
Article/Chapter (Book)
Electronic Resource
English
Workload balancing in vehicle routing problems
TIBKAT | 1987
|Workload Equity in Vehicle Routing Problems: A Survey and Analysis
British Library Online Contents | 2018
|