JIPS (한국정보처리학회)
Current Result Document :
| 한글제목(Korean Title) |
Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution |
| 영문제목(English Title) |
Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution |
| 저자(Author) |
Yan Zhang
Tengyu Wu
Xiaoyue Ding
|
| 원문수록처(Citation) |
VOL 18 NO. 05 PP. 0665 ~ 0676 (2022. 10) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
In modern logistics, the effective use of the vehicle volume and loading capacity will reduce the logistic cost. Many heuristic algorithms can solve this knapsack problem, but lots of these algorithms have a drawback, that is, they often fall into locally optimal solutions. A fusion optimization method based on simulated annealing algorithm (SA) and binary particle swarm optimization algorithm (BPSO) is proposed in the paper. We establish a logistics knapsack model of the fusion optimization algorithm. Then, a new model of express logistics simulation system is used for comparing three algorithms. The experiment verifies the effectiveness of the algorithm proposed in this paper. The experimental results show that the use of BPSO-SA algorithm can improve the utilization rate and the load rate of logistics distribution vehicles. So, the number of vehicles used for distribution and the average driving distance will be reduced. The purposes of the logistics knapsack problem optimization are achieved. |
| 키워드(Keyword) |
Binary Particle Swarm
Knapsack Problem
Logistics Distribution
Logistics Simulation
Simulated Annealing
|
| 파일첨부 |
PDF 다운로드
|
