A Heterogeneous Vehicle Routing Problem with Soft Time Windows for 3PL Company’s Deliveries: A Case Study

Abstract

Route optimization is tactically important for companies that must fulfill the demands of different customers with fleet of vehicles, considering multiple factors like: the cost of the resources (vehicles) involved and the operating costs of the entire process. As a case study, a third-party logistics service provider, ABC Company, is introduced to implement optimization on. Furthermore, ABC Company’s problem is defined as route optimization and load consolidation problems that will be solved as heterogeneous vehicle routing problem with soft time windows (HVRPSTW). In this paper’s case, Vehicles travel from a central depot with a restricted capacity, serving clients just once within a defined time interval and providing a needed demand before returning to the central depot. ABC Company’s problem is mathematically formulated and solved using branch and bound method. The formulation is solved on LINGO. The final output is the route, time, cost, and load of each vehicle.

Optimization of vehicle routing problem using guided local search and simulated annealing

“…By merging the outcomes with integer linear programming, Capitated HFVRP with Time Window for route difficulties for pharmaceutical product delivery has also been conducted [11]. HFVRP with Soft Time Window has been used to handle branch and bound route difficulties in fast-moving consumer goods (FMCG) industries utilizing LINGO software [12]. For food and beverage firms, research using the sweep algorithm method and the HFVRP approach has been conducted with the solution method employing Mixed Integer Linear Programming and the LINGO software tool [13].…”