Welcome to the InfoSci Platform
Reference Hub11
Parallel Single and Multiple Objectives Genetic Algorithms: A Survey

Parallel Single and Multiple Objectives Genetic Algorithms: A Survey

B. S. P. Mishra, S. Dehuri, R. Mall, A. Ghosh
Copyright: © 2011 |Volume: 2 |Issue: 2 |Pages: 37
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781613505540|DOI: 10.4018/jaec.2011040102
Cite Article Cite Article

MLA

Mishra, B. S. P., et al. "Parallel Single and Multiple Objectives Genetic Algorithms: A Survey." IJAEC vol.2, no.2 2011: pp.21-57. http://doi.org/10.4018/jaec.2011040102

APA

Mishra, B. S., Dehuri, S., Mall, R., & Ghosh, A. (2011). Parallel Single and Multiple Objectives Genetic Algorithms: A Survey. International Journal of Applied Evolutionary Computation (IJAEC), 2(2), 21-57. http://doi.org/10.4018/jaec.2011040102

Chicago

Mishra, B. S. P., et al. "Parallel Single and Multiple Objectives Genetic Algorithms: A Survey," International Journal of Applied Evolutionary Computation (IJAEC) 2, no.2: 21-57. http://doi.org/10.4018/jaec.2011040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This paper critically reviews the reported research on parallel single and multi-objective genetic algorithms. Many early efforts on single and multi-objective genetic algorithms were introduced to reduce the processing time needed to reach an acceptable solution. However, some parallel single and multi-objective genetic algorithms converged to better solutions as compared to comparable sequential single and multiple objective genetic algorithms. The authors review several representative models for parallelizing single and multi-objective genetic algorithms. Further, some of the issues that have not yet been studied systematically are identified in the context of parallel single and parallel multi-objective genetic algorithms. Finally, some of the potential applications of parallel multi-objective GAs are discussed.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.