This paper studies the associated logistics transportation scheduling problem with hard time windows and constructs the mathematical model. Optimize the chaos PSO problem using the improved adaptive inertia weight factor method to improve the accuracy and efficiency of the algorithm. Comparing our method with the GA and standard PSO algorithm, our algorithm has better performance with solving such problem.
목차
Abstract 1. Introduction 2. Problem Description and Mathematical Model Construction 2.1. Question Description 2.2 Mathematical Model 3. Chaos PSO Algorithms Dealing With Logistics Transportation Scheduling Problem with Hard Time Window 3.1 Improved Adaptive Inertia Weight Factor Adjusting Chaos PSO Algorithm 3.2 Algorithm Process 4. Experiment Results and Analysis 5. Conclusion Acknowledgements References
키워드
chaos PSO algorithmhard time windowassociated logistics transportation scheduling problem
저자
Yuqiang Chen [ Department of Computer Engineering DongGuan Polytechnic Dongguan, Guangdong, China ]
Jianlan Guo [ Department of Computer Engineering DongGuan Polytechnic Dongguan, Guangdong, China ]
Xuanzi Hu [ Department of Computer Engineering DongGuan Polytechnic Dongguan, Guangdong, China ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.8 No.6