An Improved MMAS Algorithm for Path Optimization in Emergency Rescue

Traveling Sales Problem is one of the NP complete problems. The TSP Problem is transformed into a minimized optimal problem without being constrained. The Ant Colony Optimal algorithm has a good effect in solving the TSP problem. This paper discusses the application of the NAX-MIN ant system in the...

Full description

Saved in:
Bibliographic Details
Main Authors: Baohua Jin, Lei Zhang, Shenyi Qian
Format: Conference Proceeding
Language:English
Subjects:
Ant colony optimization
Computer interfaces
Distributed computing
Earthquakes
Feedback
Hazards
Iterative algorithms
Machine vision
Man machine systems
MMAS
path optimum
pheromone
Roads
TSP
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Traveling Sales Problem is one of the NP complete problems. The TSP Problem is transformed into a minimized optimal problem without being constrained. The Ant Colony Optimal algorithm has a good effect in solving the TSP problem. This paper discusses the application of the NAX-MIN ant system in the path search of the earthquake emergency rescue. We construct a mathematical model which is based on the earthquake disasters. Then according to the specific characteristics of the model, we improved the max-min ant system that executes the rescue path search, use the mixed-update strategy of global iterative and global iterative and confine the ants to limited entries. So the optimized algorithm can overcome the shortcomings of conventional algorithms, such as slow convergence, easily trapped in local optimum, etc.
DOI:10.1109/MVHI.2010.212