This　work　studies　an　emergency　routing　problem　(ERP)　for　the　forest　fire.　It　aims　to　design　the　optimal　firefighting　routes　for　the　multiple　fire　points　with　priority　levels.　The　objective　of　the　ERP　is　to　minimize　the　total　travel　distance　of　all　the　rescue　teams,　so　that　the　forest　fire　can　be　distinguished　in　an　efficient　way.　To　study　the　ERP,　firstly　it　is　described　as　an　optimization　problem,　then　an　integer　programming　(IP)　model　is　developed　for　it.　The　model　is　discussed　as　an　extension　of　the　emergency　scheduling　problem　in　the　literature.　A　commercial　IP　solver　CPLEX　is　applied　for　solving　the　developed　model.　Benchmark　and　random　instances　are　tested　in　numerical　experiments　to　evaluate　the　model.　The　computational　results　justify　the　correctness　and　effectiveness　of　the　model.　©　2019　IEEE.