Research on the Algorithm for 3L-CVRP with Considering the Utilization Rate of Vehicles

Integrated optimization of vehicle routing problem and container loading problem has become a research hotspot in current logistics distribution. Firstly, a mathematical model of the three-dimensional loading capacitated vehicle routing problem (3L-CVRP) is made out under the assumption of which the delivered items are rectangular, considering the rotation of items, last in first out (LIFO) rule and the loading of fragile items which are all in accordance with the realistic conditions, and the objective is to minimize the total driving distance and maximize the utilization rate of vehicle. Then, in order to solve this problem, this paper divides the process of routing and loading into two levels, and a new algorithm which combined Tabu Search (TS) with Local Search (LS) is presented. At last, the feasibility and effectiveness of the method and algorithm is proved by the adoption example.