Solution Of The Problem Of The Horse Tour Based On The Problem Of The Traveling Agent On A Distributed Computing Platform
Keywords:
Parallel Genetic Algorithms, Horse Tour Problem, Traveling Agent, Distributed Computing, Parallel Virtual Machines (PVM)Abstract
This document describes the solution of the Horse Tour problem from a parallel genetic algorithm designed to solve the classic combinatorial problem of the Traveling Agent (TSP) on a distributed computing platform. The problem of the Tour del Caballo reaches satisfactory solutions from the basic genetic operators that solve the TSP, but the solution improves in terms of speed and precision if the operators are modified with others of the same type but more sophisticated.
Downloads
Published
2023-12-19
How to Cite
Roberto Manuel Poveda Chaves, Orlando García Hurtado, & Javier Felipe Moncada Sánchez. (2023). Solution Of The Problem Of The Horse Tour Based On The Problem Of The Traveling Agent On A Distributed Computing Platform. Elementary Education Online, 20(6), 1446–1451. Retrieved from https://ilkogretim-online.org/index.php/pub/article/view/5316
Issue
Section
Articles