earticle

논문검색

Vehicle Scheduling Optimization Based on Chaos Ant Colony Algorithm in Emergency Rescue

초록

영어

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

저자정보

  • Lingxia Liu School of Software Engineering, Anyang Normal University, Anyang, 455000,China
  • Xuexia Gao Computer School, Xinxiang University, Xinxiang, 453000,China
  • Qiang Song Computer School, Anyang Institute of Technology, Anyang, 455000,China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.