Abstract
The focus of this chapter is on the realization of parallel metaheuristic algorithms. Some classifications of parallel metaheuristic algorithms are given. Several models of parallel metaheuristic algorithms, such as master–slave, coarse-grained (island model), and fine-grained, are described. The source code of the master–slave parallel genetic algorithm (GA) is given as an example to show how to convert a metaheuristic algorithm to a parallel metaheuristic algorithm. We compare the master–slave parallel GA with simple GA to show the potential of parallel metaheuristic algorithms.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
