Research on Optimization of Knapsack Problem in Logistics Distribution

In order solve the problem of low vehicle load rate effectively in modern logistics distribution, this paper proposed an adaptive optimization algorithm based on Simulated Annealing algorithm and Binary Particle Swarm Optimization algorithm. This paper tests the optimizing algorithm by building simplified models of logistics and knapsack problem model. The results of experiment show that the average distribution distance, average capacity utilization and average load rate have been improved compared to the previous results, and the number of delivery vehicles is decreased. The results indicate that the algorithm reach the purpose of optimization to knapsack problem in logistics distribution.