Abstract

Parallel genetic algorithms are effective for solving large problems. Most of them are implemented on a massive parallel computer and the efficiency depends on the parallel computing system. It is inappropriate to implement them in a distributed computing system connected by a network. The paper proposes a client-server based approach to parallel genetic algorithms 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. Experiments solving the traveling salesman problem (100 cities) were carried out. The results show the effectiveness of the proposed model.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.