Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.20150401pre
Volume 6
Ying Tan, Andreas Janecek, Jianhua Liu
Content Forthcoming
Add to Your Personal Library: Article
Cite Article
Cite Article
MLA
Tan, Ying, et al. "Special Issue on Developments and Applications of Fireworks Algorithm." IJSIR vol.6, no.2 2015: pp.4-7. http://doi.org/10.4018/IJSIR.20150401pre
APA
Tan, Y., Janecek, A., & Liu, J. (2015). Special Issue on Developments and Applications of Fireworks Algorithm. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 4-7. http://doi.org/10.4018/IJSIR.20150401pre
Chicago
Tan, Ying, Andreas Janecek, and Jianhua Liu. "Special Issue on Developments and Applications of Fireworks Algorithm," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 4-7. http://doi.org/10.4018/IJSIR.20150401pre
Export Reference
Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.2015040101
Volume 6
Ke Ding, Ying Tan
Fireworks Algorithm (FWA) is a recently developed Swarm Intelligence Algorithm (SIA), which has been successfully used in diverse domains. When applied to complicated problems, many function...
Show More
Fireworks Algorithm (FWA) is a recently developed Swarm Intelligence Algorithm (SIA), which has been successfully used in diverse domains. When applied to complicated problems, many function evaluations are needed to obtain an acceptable solution. To address this critical issue, a GPU-based variant (GPU-FWA) was proposed to greatly accelerate the optimization procedure of FWA. Thanks to the active studies on FWA and GPU computing, many advances have been achieved since GPU-FWA. In this paper, a novel GPU-based FWA variant, Attract-Repulse FWA (AR-FWA), is proposed. AR-FWA introduces an efficient adaptive search mechanism (AFW Search) and a non-uniform mutation strategy for spark generation. Compared to the state-of-the-art FWA variants, AR-FWA can greatly improve the performance on complicated multimodal problems. Leveraging the edge-cutting dynamic parallelism mechanism provided by CUDA, AR-FWA can be implemented on the GPU easily and efficiently.
Content Forthcoming
Add to Your Personal Library: Article
Cite Article
Cite Article
MLA
Ding, Ke, and Ying Tan. "Attract-Repulse Fireworks Algorithm and its CUDA Implementation Using Dynamic Parallelism." IJSIR vol.6, no.2 2015: pp.1-31. http://doi.org/10.4018/IJSIR.2015040101
APA
Ding, K. & Tan, Y. (2015). Attract-Repulse Fireworks Algorithm and its CUDA Implementation Using Dynamic Parallelism. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 1-31. http://doi.org/10.4018/IJSIR.2015040101
Chicago
Ding, Ke, and Ying Tan. "Attract-Repulse Fireworks Algorithm and its CUDA Implementation Using Dynamic Parallelism," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 1-31. http://doi.org/10.4018/IJSIR.2015040101
Export Reference
Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.2015040102
Volume 6
Simone A. Ludwig, Deepak Dawar
Swarm intelligence algorithms are inherently parallel since different individuals in the swarm perform independent computations at different positions simultaneously. Hence, these algorithms lend...
Show More
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.
Content Forthcoming
Add to Your Personal Library: Article
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
Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.2015040103
Volume 6
Shi Cheng, Quande Qin, Junfeng Chen, Yuhui Shi, Qingyu Zhang
Fireworks algorithms for solving problems with the optima shift in decision space and/or objective space are analyzed in this paper. The standard benchmark problems have several weaknesses in the...
Show More
Fireworks algorithms for solving problems with the optima shift in decision space and/or objective space are analyzed in this paper. The standard benchmark problems have several weaknesses in the research of swarm intelligence algorithms for solving single objective problems. The optimum is in the center of search range, and is the same at each dimension of the search space. The optimum shift in decision space and/or objective space could increase the difficulty of problem solving. A mapping strategy, modular arithmetic mapping, is utilized in the original fireworks algorithm to handle solutions out of search range. The solutions are implicitly guided to the center of search range for problems with symmetrical search range via this strategy. The optimization performance of fireworks algorithm on shift functions may be affected by this strategy. Four kinds of mapping strategies, which include mapping by modular arithmetic, mapping to the boundary, mapping to stochastic region, and mapping to limited stochastic region, are compared on problems with different dimensions and different optimum shift range. From experimental results, the fireworks algorithms with mapping to the boundary, or mapping to limited stochastic region obtain good performance on problems with the optimum shift. This is probably because the search tendency is kept in these two strategies. The definition of population diversity measurement is also proposed in this paper, from observation on population diversity changes, the useful information of fireworks algorithm solving different kinds of problems could be obtained.
Content Forthcoming
Add to Your Personal Library: Article
Cite Article
Cite Article
MLA
Cheng, Shi, et al. "Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space." IJSIR vol.6, no.2 2015: pp.52-86. http://doi.org/10.4018/IJSIR.2015040103
APA
Cheng, S., Qin, Q., Chen, J., Shi, Y., & Zhang, Q. (2015). Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 52-86. http://doi.org/10.4018/IJSIR.2015040103
Chicago
Cheng, Shi, et al. "Analytics on Fireworks Algorithm Solving Problems with Shifts in the Decision Space and Objective Space," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 52-86. http://doi.org/10.4018/IJSIR.2015040103
Export Reference
Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.2015040104
Volume 6
Lokesh Kumar Panwar, Srikanth Reddy K, Rajesh Kumar
This paper presents the first application of fireworks algorithm to solve thermal unit commitment and scheduling problem. The scheduling problem accompanied by many constraints i.e., equality...
Show More
This paper presents the first application of fireworks algorithm to solve thermal unit commitment and scheduling problem. The scheduling problem accompanied by many constraints i.e., equality constraints like load balance and inequality constraints like system reserve and bounds like power generation, up/down time and ramp rate limits, finally shapes into a complex optimization problem. In this work, the scheduling and commitment problem is solved using binary fireworks algorithm (BFWA), which mimics explosion of fireworks in the sky to define search space and distance between associated sparks to evaluate global minimum. Further, the effectiveness of fireworks pertaining to problem dimension, wide range of generation units from 10 to 100 are considered and evaluated. In addition, simulations results are compared to the existing optimization techniques in literature used for unit commitment and scheduling problem and it is observed that, BFWA is superior to some of the profound existing algorithms in achieving near optimal scheduling.
Content Forthcoming
Add to Your Personal Library: Article
Cite Article
Cite Article
MLA
Panwar, Lokesh Kumar, et al. "Binary Fireworks Algorithm Based Thermal Unit Commitment." IJSIR vol.6, no.2 2015: pp.87-101. http://doi.org/10.4018/IJSIR.2015040104
APA
Panwar, L. K., Srikanth Reddy K, & Kumar, R. (2015). Binary Fireworks Algorithm Based Thermal Unit Commitment. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 87-101. http://doi.org/10.4018/IJSIR.2015040104
Chicago
Panwar, Lokesh Kumar, Srikanth Reddy K, and Rajesh Kumar. "Binary Fireworks Algorithm Based Thermal Unit Commitment," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 87-101. http://doi.org/10.4018/IJSIR.2015040104
Export Reference
Published: Apr 1, 2015
Converted to Gold OA:
DOI: 10.4018/IJSIR.2015040105
Volume 6
Miltiadis Alamaniotis, Chan K. Choi, Lefteri H. Tsoukalas
Identification of radioisotopic signature patterns in gamma-ray spectra is of paramount importance in various applications of gamma spectroscopy. Therefore, there are several active research efforts...
Show More
Identification of radioisotopic signature patterns in gamma-ray spectra is of paramount importance in various applications of gamma spectroscopy. Therefore, there are several active research efforts to develop accurate and precise methods to perform automated spectroscopic analysis and subsequently recognize gamma-ray signatures. In this work, the authors present a new method for radioisotope identification in gamma-ray spectra obtained with a low resolution radiation detector. The method fits the obtained spectrum with a linear combination of known template signature patterns. Coefficients of the linear combination are evaluated by computing the solution of a single objective optimization problem, whose objective is the Theil-1 inequality coefficient. Optimization of the problem is performed by the Fireworks Algorithm, which identifies a set of coefficients that minimize the Theil-1 value. The computed coefficients are statistically tested for being significantly different than zero or not, and if at least one is found to be zero then the Fireworks Algorithm is used to reiterate fitting using the non-zero templates. Fitting iterations are continued up to the point that no linear coefficients are found to be zero. The output of the method is a list that contains the radioisotopes that have been identified in the measured spectrum. The method is tested on a set of both simulated and real experimental gamma-ray spectra comprised of a variety of isotopes, and compared to a multiple linear regression fitting, and genetic algorithm Theil-1 based fitting. Results demonstrate the potentiality of the Fireworks Algorithm based method, expressed as higher accuracy and similar precision over the other two tested methodologies for radioisotope signature pattern identification in the framework of gamma-ray spectrum fitting.
Content Forthcoming
Add to Your Personal Library: Article
Cite Article
Cite Article
MLA
Alamaniotis, Miltiadis, et al. "Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification." IJSIR vol.6, no.2 2015: pp.102-125. http://doi.org/10.4018/IJSIR.2015040105
APA
Alamaniotis, M., Choi, C. K., & Tsoukalas, L. H. (2015). Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification. International Journal of Swarm Intelligence Research (IJSIR), 6(2), 102-125. http://doi.org/10.4018/IJSIR.2015040105
Chicago
Alamaniotis, Miltiadis, Chan K. Choi, and Lefteri H. Tsoukalas. "Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification," International Journal of Swarm Intelligence Research (IJSIR) 6, no.2: 102-125. http://doi.org/10.4018/IJSIR.2015040105
Export Reference
IGI Global Open Access Collection provides all of IGI Global’s open access content in one convenient location and user-friendly interface
that can easily searched or integrated into library discovery systems.
Browse IGI Global Open
Access Collection
All inquiries regarding IJSIR should be directed to the attention of:
Submission-Related InquiriesAll inquiries regarding IJSIR should be directed to the attention of:Yuhui Shi
Editor-in-Chief
International Journal of Swarm Intelligence Research
E-mail:
IJSIR@igi-global.comAll manuscript submissions to IJSIR should be sent through E-Editorial Discovery®:Author Services Inquiries
For inquiries involving pre-submission concerns, please contact the Journal Development Division:
journaleditor@igi-global.comOpen Access Inquiries
For inquiries involving publishing costs, APCs, etc., please contact the Open Access Division:
openaccessadmin@igi-global.comProduction-Related Inquiries
For inquiries involving accepted manuscripts currently in production or post-production, please contact the Journal Production Division:
journalproofing@igi-global.comRights and Permissions Inquiries
For inquiries involving permissions, rights, and reuse, please contact the Intellectual Property & Contracts Division:
contracts@igi-global.comPublication-Related Inquiries
For inquiries involving journal publishing, please contact the Acquisitions Division:
acquisition@igi-global.comDiscoverability Inquiries
For inquiries involving sharing, promoting, and indexing of manuscripts, please contact the Citation Metrics & Indexing Division:
indexing@igi-global.com Editorial Office
701 E. Chocolate Ave.
Hershey, PA 17033, USA
717-533-8845 x100