Critical routes determination for emergency transportation network aftermath earthquake

Transportation networks have a vital role after math earthquake, therefore they are called as lifelines. Identifying critical routes for earthquake response in a populated city is very important. This paper presents a goal programming (GP) approach to solve maximal covering network design problem (MCNDP) in order to identify critical routes, for earthquake response and to seismically retrofit bridges. Because of the conflict exists between goals which are minimization of the total travel time on selected routes and maximization of the total covered population, a goal programming based approach for solving MCNDP is proposed. This approach is developed base on desirability of decision maker (DM) and tolerances which are considered on goal values. To illustrate behavior of proposed model, a numerical example is provided and solved. Computational results demonstrate the effectiveness of the proposed approach.