Pre-planning　the　paths　is　an　effective　way　to　reduce　rescue　response　time　and　to　keep　the　postdisaster　traffic　under　control.　In　the　paper,　a　heuristic　path　searching　and　checking　algorithm　is　suggested,　in　order　to　efficiently　pre-planning　good　candidate　emergency　path　sets.　Every　alternative　path　calculated　is　checked　against　both　the　reasonable　path　and　the　alternative　path　set　constraints.　The　algorithm　terminates　when　any　of　the　alternative　path　constraints　is　satisfied.　Using　the　weight　increment　procedure.　the　reliability　of　the　path　set　and　the　reliability　of　candidate　paths　within　the　set　are　increased　efficiently.