Research on the scheduling algorithm based on the resource transport path of the contingency cellular network

Considering the relative distance among the base stations, the time and the relief profits in the base stations, the paper proposes optimal scheduling models CCNDS-AC and CCNDS-UC which are fit for the Resource Transport Path of the Contingency Cellular Network with the topology-tree structure. When a large natural disaster happens, time is rather urgent and the admissible computing time is quite short, two kinds of the fast heuristic algorithms are proposed: DS-ACG and DS-UCB so that a group of the construction scheduling order which is approximating the optimal solution is obtained in the short time. The experimental results show that the proposed algorithm efficiency can effectively improve 16% so that the maximal total relief benefits can be reached. © Li and Yang; Licensee Bentham Open.