Robust and distributed genetic algorithm for ordering problems

The paper presents a distributed genetic algorithm implementation for obtaining good quality consistent results for different ordering problems. Most importantly, the solution found by the proposed Distributed GA is not only of high quality but also robust and does not require fine tuning of the probabilities of crossover and mutation. In addition, implementation of the Distributed GA is simple and does not require the use of any specialized, expensive hardware. Fault tolerance has also been provided by dynamic reconfiguration of the distributed system in the event of a process or machine failure. The effectiveness of using a simple crossover scheme with Distributed GA is demonstrated by solving three variations of the Traveling Salesman Problem (TSP).