Uso de Algoritmo para determinación de rutas equidistantes: Caso creación de recorridos para juegos educativos

Waldir F. Ortiz-Mamani, Diego Maraza-Itomacedo, Victor Cornejo-Aparicio, Marco Aedo-Lopez, César A. Collazos

Resultado de la investigación: Contribución a una revistaArtículorevisión exhaustiva

Resumen

At present there are allocation problems that require several routes that are not necessarily optimal. The existing route search algorithms are based on the search for the optimal route, avoiding these types of problems. Thus, the set of routes for solving this type of problem should not be very different from each other, being able to have a greater range of possibilities for solving said problems, in addition to complying with the total route of the desired points. In this article an algorithm for the generation of balanced routes is proposed, where the proposed algorithm will determine a set of balanced routes, using graphs and trees with which routes with a certain number of points will be generated. After the proposal was made, it was submitted to validation for a set of nodes in a plane, with which satisfactory results could be obtained.

Título traducido de la contribuciónUse of Algorithm for determination of equidistant routes: Case creation of routes for educational games
Idioma originalEspañol
Páginas (desde-hasta)313-324
Número de páginas12
PublicaciónRISTI - Revista Iberica de Sistemas e Tecnologias de Informacao
Volumen2021
N.ºE46
EstadoPublicada - 2021

Nota bibliográfica

Publisher Copyright:
© 2021, Associacao Iberica de Sistemas e Tecnologias de Informacao. All rights reserved.

Palabras clave

  • Adjacency Matrix
  • Balanced Routes
  • Graphs
  • Trees

Huella

Profundice en los temas de investigación de 'Uso de Algoritmo para determinación de rutas equidistantes: Caso creación de recorridos para juegos educativos'. En conjunto forman una huella única.

Citar esto