Parallel ant colony optimization for evacuation planning
| Autor: | Khaled Mellouli, Manel Hajjem, El-Ghazali Talbi, Hend Bouziri |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
050210 logistics & transportation
Operations research ComputingMethodologies_SIMULATIONANDMODELING Computer science Ant colony optimization algorithms 05 social sciences Process (computing) 02 engineering and technology Constraint (information theory) 0502 economics and business Emergency evacuation Shortest path problem 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Simulation |
| Zdroj: | GECCO (Companion) |
| DOI: | 10.1145/3067695.3076058 |
| Popis: | The management of emergency situations is considered as a complex field due to its confusing situations as well as its difficulty in anticipating the behavior of evacuees while dealing with such disasters. Therefore, it is necessary to establish an efficient evacuation plan that should simulate real-life evacuation process. This paper defines the earliest arrival flow problem with load-dependent travel time (EAFP-LDT) as the more adequate macroscopic model for evacuation plan. We maintain the load-dependent travel time constraint since it defines the dependence between the crowd's rate and the travel time in doors. To solve this problem, we propose a parallel ant colony optimization algorithm (PACO) to deal with the emergency evacuation guidance problem in buildings based on EAFP-LDT. This proposed algorithm provides a realistic and an efficient evacuation plan which permits evacuees to follow the shortest path with less crowd. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|