Programación eficiente de múltiples cuadrillas para el mantenimiento de redes de media tensión mediante algoritmos genéticos
the developed research presents a study case in which an efficient route of multiple crews for the medium voltaje networks maintenance was found. This study case includes 87 spots to be visited in a labor day by 13 crews. In order to define the study case network topology the model of Roy Billinton...
| Autor Principal: | Pérez Garzón, Ayleen |
|---|---|
| Otros Autores: | Robles Lozano, Maritza |
| Formato: | info:eu-repo/semantics/bachelorThesis |
| Idioma: | spa |
| Publicado: |
Universidad de La Salle. Facultad de Ingeniería. Ingeniería Eléctrica.
2017
|
| Materias: | |
| Acceso en línea: |
http://hdl.handle.net/10185/18293 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: |
the developed research presents a study case in which an efficient route of multiple crews for the medium voltaje networks maintenance was found. This study case
includes 87 spots to be visited in a labor day by 13 crews. In order to define the study case network topology the model of Roy Billinton Bus-4 was taken, and this one was adapted into a real city. For solving the optimization problem the Multiple Traveling Salesman Problem method (MTSP) was formulated to determine the best itinerary to each crew in order to guaranty the visits on all the spots and at the end of the tour all
the crews return to the starting point.
Keywords: Genetic Algorithm, Maintenance Crew, Distribution Networks, Multiple Traveling Salesman Problem method (MTSP). |
|---|