Author(s)

Vania E.G. Campos, Paulo A.L. da Silva & Paulo O.B. Netto

Abstract

This paper presents a method which identifies k-optimal independent paths for vehicle flow allocation in emergency transportation planning. The algorithm identifies such path sets in a way that a greater number of vehicles can be sent in a minimum time outside a region under menace of some catastrophic event. 1 Introduction The Transportation Evacuation Planning is an important part of Emergency Plans, mainly in regions near Nuclear Power Plants. Techniques and models have been developed to simulate the evacuation of people living near this type of plant and also in other areas such as chemical industries. These tech

Keywords