Resumen
The emergencies management in industrial plants is an issue widely discussed in the literature and in the European legislative framework. Despite the large interest shown by the different actors involved in emergencies management, neither scientific nor in industrial field, have developed intelligent tools to support the decisions in these particular contexts. This work, realized inside an Italian financed project (DIEM-SSP), faces the problem to evacuate the greater number of persons from a risky area and transfer them in a unique destination outside from this area using the available and limited resources. Supposing that these persons have problem of mobility, the problem to solve becomes this: collect the highest number of persons from several origins and bring them into a unique destination, using a limited number of capacitated vehicles respecting a time limit. This problem has been modelled as a Multi origins Capacitated Team Orienteering Problem (Mo-CTOP) and solved implementing Ants Colony Optimization algorithm (ACOa). Results and tests are given in order to validate the proposed model and to offer a solution for a real case treaty into the abovementioned project.