Greedy algorithm for large-scale bus evacuation problem

Greedy algorithm for large-scale bus evacuation problem

Based on the thought of task construction and task assignment in the NFP algorithm, a greedy algorithm is constructed to be compared with the NF algorithm. However, due to the lack of the solution of BEP-II as a reference, the tasks are constructed by assigning each demand to the closest capable shelters in order, and the initial value of the target evacuation time, Tref is defined to be zero without the result of BEP-II.