원문정보
보안공학연구지원센터(IJUNESST)
International Journal of u- and e- Service, Science and Technology
Vol.8 No.6
2015.06
pp.161-168
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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
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
저자정보
참고문헌
자료제공 : 네이버학술정보