Research on Fire Engine Dispatching Problem Based on Improved Auction Algorithm

This paper addresses the dispatch problem of fire engines in the event of multiple fires. In view of the rapid change of fire status with time, the time-varying function is used to describe the change of fire status. Then we can treat the fire dispatch problem as a dynamic task allocation problem. Firstly, based on the centralized idea, the depth-first algorithm is used to solve the multi-task assignment problem. Secondly, through this centralized algorithm example simulation, we proposed multi-stage task allocation strategy and designed a new revenue function to improve the auction algorithm. Finally, the effectiveness of the improved auction algorithm is verified by the example simulation.