Reference Hub9
Parallelization of Enhanced Firework Algorithm using MapReduce

Parallelization of Enhanced Firework Algorithm using MapReduce

Simone A. Ludwig, Deepak Dawar
Copyright: © 2015 |Volume: 6 |Issue: 2 |Pages: 20
ISSN: 1947-9263|EISSN: 1947-9271|EISBN13: 9781466678286|DOI: 10.4018/IJSIR.2015040102
Cite Article Cite Article

MLA

Ludwig, Simone A., and Deepak Dawar. "Parallelization of Enhanced Firework Algorithm using MapReduce." IJSIR vol.6, no.2 2015: pp.32-51. http://doi.org/10.4018/IJSIR.2015040102

APA

Ludwig, S. A. & Dawar, D. (2015). Parallelization of Enhanced Firework Algorithm using MapReduce. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 32-51. http://doi.org/10.4018/IJSIR.2015040102

Chicago

Ludwig, Simone A., and Deepak Dawar. "Parallelization of Enhanced Firework Algorithm using MapReduce," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 32-51. http://doi.org/10.4018/IJSIR.2015040102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Swarm intelligence algorithms are inherently parallel since different individuals in the swarm perform independent computations at different positions simultaneously. Hence, these algorithms lend themselves well to parallel implementations thereby speeding up the optimization process. FireWorks Algorithm (FWA) is a recently proposed swarm intelligence algorithm for optimization. This work investigates the scalability of the parallelization of the Enhanced FireWorks Algorithm (EFWA), which is an improved version of FWA. The authors use the MapReduce platform for parallelizing EFWA, investigate its ability to scale, and report on the speedup obtained on different benchmark functions for increasing problem dimensions.

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.