Research on Location Model of Military Logistics Distribution Center

This paper concerns with military logistics distribution center location problem in which military users have their time constrain.A feasible paths algorithm is presented which could finish searching in(n-1) steps.When there were multi-edges between vertexes,the loops were abstained and the paths beyond time constrain were avoided.The paths were selected according to the time reliability of each edge.Then the location-routing model of military logistics distribution center was presented.