Assignation problems' solutions by parallel and distributed genetic algorithms

Abstract

The Grisland model is a Parallel Genetic Algorithm designed to find optimal solutions close to the Travelling Salesman Problem. This algorithm combines the classical fine-grained parallel models (grid models) and the coarsemodels (island models) with the 2-opt local search heuristics. This article implements on Grisland some assignment problems, which result in particular cases of the Symmetric Euclidian Problem of the Travelling Salesman.