K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks.

ABSTRACT: Emergency evacuation aims to transport people from dangerous places to safe shelters as quickly as possible. Police play an important role in the evacuation process, as they can handle traffic accidents immediately and help people move smoothly on roads. This paper investigates an evacuation routing problem that involves police resource allocation. We propose a novel k-th-shortest-path-based technique that uses explicit congestion control to optimize evacuation routing and police resource allocation. A nonlinear mixed-integer programming model is presented to formulate the problem. The model's objective is to minimize the overall evacuation clearance time. Two algorithms are given to solve the problem. The first one linearizes the original model and solves the linearized problem with CPLEX

SUBMITTER: He Y 

PROVIDER: S-EPMC4520475 | biostudies-literature | 2015

REPOSITORIES: biostudies-literature