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.
|Translated title of the contribution||Use of Algorithm for determination of equidistant routes: Case creation of routes for educational games|
|Number of pages||12|
|Journal||RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao|
|State||Published - 2021|
Bibliographical noteFunding Information:
Agradecemos de manera especial al Vicerrectorado de Investigación de la Universidad Nacional de San Agustín de Arequipa, quien ha financiado el proyecto denominado “Mecanismo de evaluación de operaciones matemáticas de respuesta única empleando juegos geolocalizados”, con número de contrato IBA-23-2021-UNSA, donde se elaboró el presente artículo
© 2021, Associacao Iberica de Sistemas e Tecnologias de Informacao. All rights reserved.