[논문]Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution

Zhang, Yan; Wu, Tengyu; Ding, Xiaoyue

doi:10.3745/jips.01.0090

Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution 원문보기

Journal of information processing systems, v.18 no.5, 2022년, pp.665 - 676

Zhang, Yan (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications) , Wu, Tengyu (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications) , Ding, Xiaoyue (Shool of Economics and Management, Chongqing, University of Posts and Telecommunications)

Abstract ▼ AI-Helper

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.

주제어

표/그림 (6)

그림 Fig. 2. Algorithm flow chart.
그림 Fig. 3. The overall operation architecture of the virtual simulation system model.
그림 Fig. 4. Comparison of the optimization results of the backpack: (a) before optimization and (b) after optimization.
그림 Fig. 5. Total change trend with postage algorithms.
표 Table 1. Different distribution center optimization results comparison table
표 Table 2. Simulation results of different algorithms under different running times

참고문헌 (11)

J. H. Drake, M. Hyde, K. Ibrahim, and E. Ozcan, "A genetic programming hyper-heuristic for the multidimensional knapsack problem," Kybernetes, vol. 43, no. 9/10, pp. 1500-1511, 2014.

상세보기
Z. Beheshti, S. M. Shamsuddin, and S. Hasan, "Memetic binary particle swarm optimization for discrete optimization problems," Information Sciences, vol. 299, pp. 58-84, 2015.

상세보기
F. Glover, "Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems," European Journal of Operational Research, vol. 230, no. 2, pp. 212-225, 2013.

상세보기
I. B. Mansour and I. Alaya, "Indicator based ant colony optimization for multi-objective knapsack problem," Procedia Computer Science, vol. 60, pp. 448-457, 2015.

상세보기
S. C. Leung, D. Zhang, C. Zhou, and T. Wu, "A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem," Computers & Operations Research, vol. 39, no. 1, pp. 64-73, 2012.

상세보기
B. Haddar, M. Khemakhem, H. Rhimi, and H. Chabchoub, "A quantum particle swarm optimization for the 0-1 generalized knapsack sharing problem," Natural Computing, vol. 15, no. 1, pp. 153-164, 2016.

상세보기
C. Sachdeva and S. Goel, "An improved approach for solving 0/1 knapsack problem in polynomial time using genetic algorithms," in Proceedings of International Conference on Recent Advances and Innovations in Engineering (ICRAIE), Jaipur, India, 2014, pp. 1-4.
R. Merkle and M. Hellman, "Hiding information and signatures in trapdoor knapsacks," IEEE Transactions on Information Theory, vol. 24, no. 5, pp. 525-530, 1978.

상세보기
Y. Li, Y. He, H. Li, X. Guo, and Z. Li, "A binary particle swarm optimization for solving the bounded knapsack problem," in Computational Intelligence and Intelligent Systems. Singapore: Springer, 2018, pp. 50-60.
Y. He, H. Xie, T. L. Wong, and X. Wang, "A novel binary artificial bee colony algorithm for the set-union knapsack problem," Future Generation Computer Systems, vol. 78, pp. 77-86, 2018.

상세보기
Y. Zhang, X. Y. Wu, and O. K. Kwon, "Research on Kruskal crossover genetic algorithm for multi-objective logistics distribution path optimization," International Journal of Multimedia and Ubiquitous Engineering, vol. 10, no. 8, pp. 367-378, 2015.

상세보기

내보내기 구분	파일저장 인쇄 메일전송
구성항목	기본정보 상세정보 관리번호, 논문명, 저널/프로시딩명, 저자 , 발행년, 권, 호, 시작페이지, 끝페이지, 발행기관 관리번호, 논문명, 대등논문명, 저자 , 저널/프로시딩명, 발행기관, 발행년, 발행언어, 권, 호, 시작페이지, 끝페이지, ISBN, ISSN, 주제분야, 키워드, 초록(한글), 초록(영문), 저자(소속기관)
저장형식	Text(ASCII format) Excel format RefWorks Direct Export RIS format (for Reference Manager, ProCite, EndNote), Scholar's Aids, Mendeley
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	총 건의 자료가 검색되었습니다. 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오. ~ Text(ASCII format) Excel format

연합인증

Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution 원문보기

Abstract ▼ AI-Helper

주제어

표/그림 (6)

표/그림 (6)

참고문헌 (11)

이 논문을 인용한 문헌

관련 콘텐츠

원문 보기

원문 URL 링크

오픈액세스(OA) 유형

이 논문과 함께 이용한 콘텐츠

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트

연합인증

Optimization Method of Knapsack Problem Based on BPSO-SA in Logistics Distribution 원문보기

Abstract ▼ AI-Helper

주제어

표/그림 (6) 모든 표/그림 보기

표/그림 (6) 슬라이드로 보기

참고문헌 (11)

이 논문을 인용한 문헌

관련 콘텐츠

원문 보기

원문 URL 링크

오픈액세스(OA) 유형

이 논문과 함께 이용한 콘텐츠

AI-Helper ※ AI-Helper는 오픈소스 모델을 사용합니다.

선택된 텍스트

표/그림 (6)

표/그림 (6)