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.
Key words: Parallel Genetic Algorithms, Horse Tour Problem, Traveling Agent, Distributed Computing, Parallel Virtual Machines (PVM).
|
