Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study

A parallel version of a Genetic Algorithm (GA) is presented and implemented on a cluster of workstations. Even though our algorithm is general enough to be applied to a wide variety of problems, we used it to obtain optimal and/or suboptimal solutions to the well-known Traveling Salesman Problem. Th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Future generation computer systems 2001, Vol.17 (4), p.477-488
Hauptverfasser:	Sena, Giuseppe A., Megherbi, Dalila, Isern, Germinal
Format:	Artikel
Sprache:	eng
Schlagworte:	Distributed system Genetic Algorithm Message-passing Parallel computing Traveling Salesman Problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!