Abstract: Scheduling problem of helicopter coordinated with vehicle for relief distribution in snow disaster is the focus of this paper. With constraints of the ability of clearing snow in the road and the relief time windows, the set of roads and the order of roads to be cleared are determined at first, and the object is the maximum of traffic volume. The demand of the sites before cleared and the remanding sites are supplied by the helicopters. In the second stage, the route of the helicopter and the unloading to each site are decided. The final objective is to maximize the minimum sustain time of all the sites. Two mixed-integer programming models are proposed and a heuristic algorithm is.presented. A numeral example based on the network of road in the northwest of China is given at the end.

Key words: resources distribution, scheduling of helicopter, mixed-integer programming, emergency management