- Research Article
11
- 10.1016/j.procs.2015.10.027
Optimal Choice of Parameters for Fireworks Algorithm
- Jan 01, 2015
- Procedia Computer Science
- Vijay Kumar + 2 more +2
Optimal Choice of Parameters for Fireworks Algorithm
This paper aims to improve one of the recently proposed metaheuristic approaches known as Lvy flight distribution (LFD) algorithm by adopting a well-known simplex search algorithm named Nelder-Mead (NM) method. Three new strategies were utilized to demonstrate the improved capability of the original LFD algorithm. In the first strategy, NM was run twice as much the number of iterations of LFD after the latter completes its task. In the second strategy, NM was applied after each iterations of LFD instead of waiting for the completion of the latter. Lastly, in the third strategy, NM was applied after each iterations of LFD and run for the total number of current iterations of the latter algorithm. Well-known unimodal and multimodal benchmark functions were adopted, and statistical analysis was performed for performance evaluation. Further assessment was carried out through a nonparametric statistical test. The obtained results have shown the proposed versions of LFD algorithm provide significant performance improvement in general. In addition, the efficiency of the third strategy was found to be better for NM modified LFD algorithm which has greater balance between global and local search stages and can be used as an effective tool for function optimization.
Loading PDF
Optimal Choice of Parameters for Fireworks Algorithm
Optimal Choice of Parameters for Fireworks Algorithm
Investigating the Multi-memetic Mind Evolutionary Computation Algorithm Efficiency
При решении практически значимых задач глобальной оптимизации целевая функция зачастую имеет высокую размерность и вычислительную сложность, а также нетривиальный ландшафт. Исследования показывают, что зачастую одного метода оптимизации недостаточно для эффективного решения такого рода задач – необходима гибридизация нескольких методов оптимизации.
Read moreParticle swarm optimisation with simple and efficient neighbourhood search strategies
This paper presents a novel particle swarm optimiser (PSO) called PSO with simple and efficient neighbourhood search strategies (NSPSO), which employs one local and two global neighbourhood search strategies. By this way, one strong and two weak locality perturbation operators are embedded in the standard PSO. The NSPSO consists of two main steps. First, for each particle, three trail particles are generated by the mentioned three neighbourhood search strategies, respectively. Then, the best one among the three trail particles is selected to compete with the current particle, and the fitter one is accepted as a current particle. In order to verify the performance of NSPSO, it experimentally has been tested on 12 unimodal and multimodal benchmark functions. The results show that NPSO significantly outperforms other seven PSO variants.
Read moreA binary social spider algorithm for uncapacitated facility location problem
A binary social spider algorithm for uncapacitated facility location problem
Continuous Adaptive Population Reduction (CAPR) for Differential Evolution Optimization.
Continuous Adaptive Population Reduction (CAPR) for Differential Evolution Optimization.
Hybrid moth-flame optimisation algorithm with differential evolution for visual object tracking
The improvement of the metaheuristic algorithms is one of the exciting topics to investigators in current years to resolve the optimisation and engineering problems. One of the population-based search methods, i.e., moth-flame optimisation algorithm (MFO), is eminent by easy execution, low limits, and high speed. On the other hand, the MFO process has shortcomings; for instance, the verdict of local minimum as a substitute for global minimum and weakness in global pursuit proficiency. In this paper, to resolve these shortages, the MFO algorithm is integrated with differential evolution (DE) and proposed a new hybrid method called MFO-DE. The exploration ability of the MFO algorithm is improved and existence trapped in the local minimum is prohibited by a mixture of the MFO and DE in the MFO-DE algorithm. The proposed algorithm was tested on the set of best-known unimodal and multimodal benchmark functions in various dimensions. Furthermore, MFO-DE is applied to visual object tracking as a real-life application.
Read moreFully Elman Neural Network: A Novel Deep Recurrent Neural Network Optimized by an Improved Harris Hawks Algorithm for Classification of Pulmonary Arterial Wedge Pressure.
Heart failure (HF) is one of the most prevalent life-threatening cardiovascular diseases in which 6.5 million people are suffering in the USA and more than 23 million worldwide. Mechanical circulatory support of HF patients can be achieved by implanting a left ventricular assist device (LVAD) into HF patients as a bridge to transplant, recovery or destination therapy and can be controlled by measurement of normal and abnormal pulmonary arterial wedge pressure (PAWP). While there are no commercial long-term implantable pressure sensors to measure PAWP, real-time non-invasive estimation of abnormal and normal PAWP becomes vital. In this work, first an improved Harris Hawks optimizer algorithm called HHO+ is presented and tested on 24 unimodal and multimodal benchmark functions. Second, a novel fully Elman neural network (FENN) is proposed to improve the classification performance. Finally, four novel 18-layer deep learning methods of convolutional neural networks (CNNs) with multi-layer perceptron (CNN-MLP), CNN with Elman neural networks (CNN-ENN), CNN with fully Elman neural networks (CNN-FENN), and CNN with fully Elman neural networks optimized by HHO+ algorithm (CNN-FENN-HHO+) for classification of abnormal and normal PAWP using estimated HVAD pump flow were developed and compared. The estimated pump flow was derived by a non-invasive method embedded into the commercial HVAD controller. The proposed methods are evaluated on an imbalanced clinical dataset using 5-fold cross-validation. The proposed CNN-FENN-HHO+ method outperforms the proposed CNN-MLP, CNN-ENN and CNN-FENN methods and improved the classification performance metrics across 5-fold cross-validation with an average sensitivity of 79%, accuracy of 78% and specificity of 76%. The proposed methods can reduce the likelihood of hazardous events like pulmonary congestion and ventricular suction for HF patients and notify identified abnormal cases to the hospital, clinician and cardiologist for emergency action, which can diminish the mortality rate of patients with HF.
Read moreHigher Dimensional Cost Function for Synthesis of Evolutionary Algorithms by means of Symbolic Regression
This contribution deals with a new idea of how to create evolutionary algorithms by means of symbolic regression and Analytic Programming. The motivation was not only to tune some existing algorithms to their better performance, but also to find a new robust evolutionary algorithm. In this study operators of Differential Evolution (DE), SelfOrganizing Migrating Algortithm (SOMA), Hill Climbing (HC) and Simulated Annealing (SA) were used during a process of Analytic Programming. The results showed that AP was able to find successful as well as the original DE or SOMA. The cost function includes not only success in unimodal and multimodal benchmark function but also rules concerned to cost function evaluations. Results were tested on 16 benchmark functions in 2D, 20 D and 100 dimensional versions, i.e. 192 test, each was 100 times repeated and each of 100 repetitions has around 200 000 cost function evaluations. The results are presented in tabelar and graphic form.
Read moreEnhancing Cuckoo Search Algorithm by using Reinforcement Learning for Constrained Engineering optimization Problems
Cuckoo Search Algorithm (CSA) has been successfully applied to a range of various fields such as engineering, medical, and image processing. However, it typically suffers from a lack of effective exploration, loose diversity, and premature convergence. This paper aspires to develop a new version of CSA that is based on the features of Reinforcement Learning (RL) to enhance the research technique of CSA, which will be called CSARL. The performance of CSARL is evaluated by applying set of unimodal and multimodal benchmark functions. The results demonstrate that the CSARL outperforms the basic CSA, genetic, harmony search and krill heard algorithms, in terms of convergence speed, the diversity, and exploration search.
Read moreA Local Best Particle Swarm Optimization Based on Crown Jewel Defense Strategy
Particle swarm optimization (PSO) is a swarm intelligence algorithm well known for its simplicity and high efficiency on various optimization problems. Conventional PSO suffers from premature convergence due to the rapid convergence speed and lack of population diversity. PSO is easy to get trapped in local optimal, which largely deteriorates its performance. It is natural to detect stagnation during the optimization, and reactivate the swarm to search towards the global optimum. In this work the authors impose the reflecting bound-handling scheme and von Neumann topology on PSO to increase the population diversity. A novel Crown Jewel Defense (CJD) strategy is also introduced to restart the swarm when it is trapped in a local optimal. The resultant algorithm named LCJDPSO-rfl is tested on a group of unimodal and multimodal benchmark functions with rotation and shifting, and compared with other state-of-the-art PSO variants. The experimental results demonstrate stability and efficiency of LCJDPSO-rfl on most of the functions.
Read moreAn Elite Opposition-based Quantum-inspired Salp Swarm Algorithm with Chaotic Mapping
Quantum-inspired metaheuristics have gained increasing attention for their ability to overcome the limitations of conventional evolutionary algorithms in complex optimization tasks. Among them, the Salp Swarm Algorithm (SSA) has demonstrated strong potential; however, its performance often deteriorates due to premature convergence and insufficient population diversity. To address these challenges, we propose the Elite Opposition-based Quantum-inspired Salp Swarm Algorithm with Chaotic Mapping (EQSSA-LCM), which integrates three complementary strategies: (i) elite opposition-based learning to accelerate convergence by refining initial solutions and maintaining diversity, (ii) quantum-inspired state representation to enhance exploration via probabilistic position encoding and measurement, and (iii) the logistic chaotic map to periodically perturb the population and mitigate stagnation in deceptive landscapes. The proposed hybrid framework promotes adaptive exploration, strengthens recovery from local optima, and sustains long-term diversity throughout the search process. To validate its effectiveness, we conducted extensive experiments on a suite of unimodal and multimodal benchmark functions and compared EQSSA-LCM against the standard SSA and its quantum-inspired variant (QSSA). The results demonstrate that the proposed approach consistently outperforms these baselines in terms of convergence speed, solution quality, and robustness, thereby establishing EQSSA-LCM as a competitive and reliable optimizer for complex high-dimensional problems.
Read moreDecentralized multi-dimensional alert correlation for collaborative intrusion detection
Decentralized multi-dimensional alert correlation for collaborative intrusion detection
Hybrid simplex search and particle swarm optimization for the global optimization of multimodal functions
This article proposes the hybrid Nelder–Mead (NM)–Particle Swarm Optimization (PSO) algorithm based on the NM simplex search method and PSO for the optimization of multimodal functions. The hybrid NM–PSO algorithm is very easy to implement, in practice, since it does not require gradient computation. This hybrid procedure performed the exploration with PSO and the exploitation with the NM simplex search method. In a suite of 17 multi-optima test functions taken from the literature, the computational results via various experimental studies showed that the hybrid NM–PSO approach is superior to the two original search techniques (i.e. NM and PSO) in terms of solution quality and convergence rate. In addition, the presented algorithm is also compared with eight other published methods, such as hybrid genetic algorithm (GA), continuous GA, simulated annealing (SA), and tabu search (TS) by means of a smaller set of test functions. On the whole, the new algorithm is demonstrated to be extremely effective and efficient at locating best-practice optimal solutions for multimodal functions.
Read moreImproved Driving Training-Based Optimization Algorithm Using Levy Flight and Crowding Distance Techniques
This study presents an improved version of the Driving Training-Based Optimization (DTBO) algorithm, the Improved Driving Training-Based Optimization (IDTBO). The work addresses fundamental issues in selecting drivers and learners for the conventional DTBO, which substantially impact the algorithm's accuracy and convergence speed. Two significant improvements are proposed: including the crowding distance technique for more diverse driver and learner selection and incorporating the Levy Flight distribution for better exploration and local optima avoidance. The IDTBO's performance is evaluated using twelve benchmark functions, including unimodal and high-dimensional multimodal optimization functions. The results indicate that IDTBO performs exceptionally well, with more extraordinary exploitation ability on unimodal functions and consistent achievement of the global optima. The proposed IDTBO demonstrated exceptional exploration capabilities on high-dimensional multimodal functions and performed competitively with other algorithms in the literature. From six functions, the IDTBO obtained zero optimal values. Again, the rate of convergence analysis demonstrates that IDTBO finds optimal solutions in fewer iterations, demonstrating its capacity to balance exploration and exploitation. To assess the strength of the IDTBO in solving real-world problems, the improved DTBO is further tested on two practical benchmark engineering problems. The IDTBO again produced a competitive performance against other algorithms in the literature. The study shows that IDTBO is a valuable metaheuristic algorithm that can tackle various real-world optimization problems.
Read moreCollaborative beamforming in wireless sensor networks using a novel particle swarm optimization algorithm variant
Collaborative beamforming in wireless sensor networks using a novel particle swarm optimization algorithm variant