Abstract (EN):
The aim of this study is to develop a strategy to address the problem of assigning routes to vehicles in an emergency situation. In order to minimize the network travel time we use the Minimum Cost algorithm. This algorithm worked as initial starting point to our solution. However, due to the travel time definition using the BFR function, the use of the Minimum Cost algorithm alone does not guarantee the user equilibrium of the network. This forced us to improve this solution and develop a complementary algorithm, which follows a greedy strategy.
Language:
English
Type (Professor's evaluation):
Scientific