Solución alternativa para la reparación de averías eléctricas posterior a desastres naturales usando optimización basada en colonias de hormigas

  • Costa-Salas Y
  • Sarache-Castro W
  • 3


    Mendeley users who have this article in their library.
  • 1


    Citations of this article.


Abundant literature is available for the route planning based on meta-heuristic algorithms. However, most researches in this field are developed under normal scenarios (e.g. normal weather conditions). The natural disasters, such as hurricanes, on the contrary, impose hard constraints to these combinatorial problems. In this paper, a route-planning problem is solved, specifically, for the repair of electrical breakdowns that occur after natural disasters. The problem is modeled using an assignment-based integer programming formulation proposed for the Multiple Traveling Salesman Problem (mTSP). Moreover, this paper proposes the creative application of an algorithm based on Ant Colony Optimization (ACO), specifically Multi-type Ant Colony System (M-ACS), where each colony represents a set of possible global solutions. Ants cooperate and compete by means of "frequent" pheromone exchanges aimed to find a solution. The algorithm performance has been compared against other ACO variant, showing the efficacy of the proposed algorithm on realistic decision-making. © The authors; licensee Universidad Nacional de Colombia.

Author-supplied keywords

  • Ant algorithms
  • Electrical breakdowns
  • Multiple traveling salesman problem

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Yasel José Costa-Salas

  • William Ariel Sarache-Castro

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free