Aiming to the demand and characteristics of vehicle scheduling optimization problem in emergency rescue, this paper establishes a multi-objective optimization model, which takes minimizing variable bidirectional distance, path risk and cost as the optimization target. To avoid the prematurely falling into local optimization of ant colony system(ACS)algorithm, and to improve the algorithm adaptability, computational efficiency and the quality of optimal solution, this paper proposed and realized a chaos-based improved ant colony system algorithm, which can overall updates the chaos disturbance to pheromone. Simulation results show that the algorithm is feasible, which can well meet the demand of vehicle scheduling optimization in emergency rescue.
목차
Abstract 1. Introduction 2. The Description and Basic Assumption of Emergency Rescue Vehicle Scheduling Problem 3. The Multi-Objective Determination of Emergency Rescue and Data Evaluation 4. Mathematical Model 5. The Design of Chaos Disturbance to Improve Ant Colony System Algorithm 5.1. The Settings of State Transition Probability 5.2. Pheromone Update Strategy 5.3. The Optimization Improvement of 2-opt Method 5.4. Chaos Perturbation Strategy 5.5. The Solving Steps of Chaos Ant Colony System Algorithm 6. Example Analysis 7. Conclusion References
보안공학연구지원센터(IJSIA) [Science & Engineering Research Support Center, Republic of Korea(IJSIA)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Security and Its Applications
간기
격월간
pISSN
1738-9976
수록기간
2008~2016
등재여부
SCOPUS
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Security and Its Applications Vol.10 No.2