Backtracking tree-based dynamic volumetric weight balance of cargo loading
Aimed at the current situation of low loading rate of Less-than-Truck Load(LTL)logistics cargo,the car-go loading problem of multi-vehicle and multi-category cargo under limited cargo conditions was studied and a multi-objective mathematical model with the objectives of minimizing the number of vehicles and maximizing the total vehi-cle volume and total load utilization was constructed.Considering that a single piece of cargo added to a vehicle would have an impact on the remaining volume and remaining weight of that vehicle as well as the collection of vehi-cles,the dynamic volumetric-weight balance algorithm based on backtracking tree was designed,and the Pareto so-lution set was obtained by non-dominated sorting of the algorithm results,the congestion distance of each solution in the Pareto solution set was calculated,and the solution with the largest congestion distance was selected as the opti-mal loading solution.Finally,the algorithm was compared and analyzed with NSGA-2 and CPLEX in terms of com-putational accuracy and time complexity of the algorithm,and the results of the arithmetic examples verified the ef-fectiveness of the proposed algorithm.
NETL
NSTL
万方数据
