Abstract
The problem of the network node and the complex constrain in the path planning has become a difficulty in forest fire logistics support. The traditional ant colony algorithm is improved. We establish two objective functions for the distance between nodes and the time required to finish task. We optimize the two objective functions. We redesigned the calculation method of heuristic information and the update function of pheromone. We set a time window to limit the time to complete urgent tasks. Finally, an example is given for verification. The results show that the improved algorithm can solve the problem of logistics support path planning model of forest fire. The results are more close to the actual situation.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
