Network based parallel genetic algorithm using client-server model

Parallel genetic algorithms are effective at solving large problems. Most are implemented on massively parallel computers and the efficiency depends on the parallel computing system. It is inappropriate to implement them on a distributed computing system connected by network. This paper proposes a client-server based approach to a parallel genetic algorithm with a delegate management model, that manages string exchange between subpopulations by the server and eliminates inter-subpopulation communications. It is easy to port and implement without any parallel computing systems. Some experiments solving the traveling salesman problem (100 cities) were carried out. The results show the effectiveness of the proposed model