원문정보
보안공학연구지원센터(IJGDC)
International Journal of Grid and Distributed Computing
Vol.8 No.3
2015.06
pp.219-226
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Research the Incident Vehicle Routing Problem with Soft Time-windows (IVRP-STW). Associated logistics scheduling problem with soft time windows using the logistic function optimization method to improve the chaotic particle algorithm, compared with the GA and the standard PSO algorithm. Simulation results show that such optimization method can effectively improve the global search of the particles in the particle swarm and the ability of local search is effective in resolving such problems.
목차
Abstract
1. Introduction
2. Logistics Associated with Soft Time Windows Scheduling Problem Description and Mathematical Model
2.1. The Description of Logistics and Transport Scheduling Problems with Soft Time Windows
2.2. The Mathematical Model of Associated Scheduling Transportation Problem with Soft Time Window
3. Chaos Particle Swarm Optimization Algorithm of Logistics Scheduling Problem with Soft Time Window
3.1. Chaos PMO Algorithm Optimized by Logistic Function
3.2. Algorithm Process
4．Experiment Results and Analyze
5. Summary
Acknowledgements
Reference
1. Introduction
2. Logistics Associated with Soft Time Windows Scheduling Problem Description and Mathematical Model
2.1. The Description of Logistics and Transport Scheduling Problems with Soft Time Windows
2.2. The Mathematical Model of Associated Scheduling Transportation Problem with Soft Time Window
3. Chaos Particle Swarm Optimization Algorithm of Logistics Scheduling Problem with Soft Time Window
3.1. Chaos PMO Algorithm Optimized by Logistic Function
3.2. Algorithm Process
4．Experiment Results and Analyze
5. Summary
Acknowledgements
Reference
저자정보
참고문헌
자료제공 : 네이버학술정보