| Resumen |
In general, route optimization by using ant colony algorithms has
been widely used with good results so far. This work presents a novel method within this kind of techniques for optimizing patrolling routes for personnel working in public security. Our algorithm can be used in all places with this kind of activities, allowing to allocate an optimal number of human and material
resources for patrolling. We present a case study based on data from the municipality of Cuautitlán Izcalli, in Mexico. For three different patrolling requirements, we were always able to find optimal routes in relatively short time (around 50 algorithm iterations). |
