Research on depot location of discrete emergency aid based on ACO
基于蚁群算法的离散救援问题出救点选址研究

Improved mathematic model and imported ant colony algorithm to solve the emergency location problem. Most problem of emergency logistics could be summarized as supporting from peer-to-peer. The setting of retrieval depots (RDS) should guarantee the validity of rescue, minize the number of depots, shorten the time to rescue, which was a bilevel programming problem(BPP). A BPP is theoretic NP-hard, can be solved by ant colony optimization (ACO). In ACO the RDS problem can be treated as clustering of ants. It is easy to get cluster of ants in ACO by pheromone weakening and using ants inter-attraction as elicitation. Experiments show that solution of RDS problem by ACO can get perfect effect with high speed.