A Lévy Flight Based BAT Optimization Algorithm for Block-based Image Compression

Many metaheuristics have been adopted to solve the codebook generation problem in image processing. In this paper, the Bat algorithm is combined by the Lévy flight distribution to find out the global optimum codebook. The Lévy flight distribution is combined by the local search procedure. Therefore most of the time the bat concentrate on the local area for specific food while it rarely flies to the different parts of the field for better food opportunities. This process strongly guides the bat on the global minimum way and offers better food, then the bat flies to that direction. Consequently, if a bat is captured by a local minimum point accidentally, the Lévy flight step provides a chance to escape from it easily. Numerical results suggest that the proposed Lévy flight based Bat algorithm is better than the classical ones and provides the global optimum codebook for image compression

Development of a Dynamic Cuckoo Search Algorithm

This research is aimed at the developing a modified cuckoo search algorithm called dynamic cuckoo search algorithm (dCSA). The standard cuckoo search algorithm is a metaheuristics search algorithm that mimic the behavior of brood parasitism of some cuckoo species and Levy flight behavior of some fruit flies and birds. It, however uses fixed value for control parameters (control probability and step size) and this method have drawbacks with respect to quality of the solutions and number of iterations to obtain optimal solution. Therefore, the dCSA is developed to address these problems in the CSA by introducing random inertia weight strategy to the control parameters so as to make the control parameters dynamic with respect to the proximity of a cuckoo to the optimal solution. The developed dCSA was compared with CSA using ten benchmark test functions. The results obtained indicated the superiority of dCSA over CSA by generating a near global optimal result for 9 out of the ten benchmark test functions

Hybrid Sine Cosine Algorithm for Solving Engineering Optimization Problems

Engineering design optimization problems are difficult to solve because the objective function is often complex, with a mix of continuous and discrete design variables and various design constraints. Our research presents a novel hybrid algorithm that integrates the benefits of the sine cosine algorithm (SCA) and artificial bee colony (ABC) to address engineering design optimization problems. The SCA is a recently developed metaheuristic algorithm with many advantages, such as good search ability and reasonable execution time, but it may suffer from premature convergence. The enhanced SCA search equation is proposed to avoid this drawback and reach a preferable balance between exploitation and exploration abilities. In the proposed hybrid method, named HSCA, the SCA with improved search strategy and the ABC algorithm with two distinct search equations are run alternately during working on the same population. The ABC with multiple search equations can provide proper diversity in the population so that both algorithms complement each other to create beneficial cooperation from their merger. Certain feasibility rules are incorporated in the HSCA to steer the search towards feasible areas of the search space. The HSCA is applied to fifteen demanding engineering design problems to investigate its performance. The presented experimental results indicate that the developed method performs better than the basic SCA and ABC. The HSCA accomplishes pretty competitive results compared to other recent state-of-the-art methods

Marine Predator Algorithm (MPA)-Based MPPT Technique for Solar PV Systems under Partial Shading Conditions

To satisfy global electrical energy requirements, photovoltaic (PV) energy is a promising source that can be obtained from the available alternative sources, but partial shading conditions (PSCs), which trap the local maxima power point instead of the global maxima peak power point (GMPP), are a major problem that needs to be addressed in PV systems to achieve the uninterruptable continuous power supply desired by consumers. To avoid these difficulties, a marine predator algorithm (MPA), which is a bio-inspired meta-heuristic algorithm, is applied in this work. The work is validated and executed using MATLAB/Simulink software along with hardware experimentation. The superiority of the proposed MPA method is validated using four different PSCs on the PV system, and their characteristics are compared to those of existing algorithms. The four different PSC outcomes in terms of GMPP are case 1 at 0.07 s 995.0 Watts; case 2 at 0.06 s 674.5 Watts; case 3 at 0.04 s 654.1 Watts; and case 4 at 0.04 s 364.2 Watts. The software- and hardware-validated results of the proposed MPA method show its supremacy in terms of convergence time, efficiency, accuracy, and extracted power.publishedVersio

Taxonomy of Memory Usage in Swarm Intelligence-Based Metaheuristics

التجريبيات ) metaheuristics ( تحت فئة ذكاء السرب ) swarm intelligence ( اثبتت فعاليتها وأصبحت أساليب شائعة لحلمشاكل التحسين المختلفة. يمكن تصنيف التجريبيات، بناءً على استخدام الذاكرة ، الى خوارزميات مع ذاكرة وتلك بدون ذاكرة. يؤدي عدموجود ذاكرة في بعض التجريبيات إلى فقدان المعلومات التي تم الحصول عليها في التكرارات السابقة. تميل التجريبيات إلى الانحراف عنالمجالات الواعدة لمساحات البحث التي ستؤدي إلى حلول غير مثالية. تهدف هذه الورقة إلى مراجعة استخدام الذاكرة وتأثيرها على أداء أهمالتجريبيات المرتكزة على ذكاء السرب. تم إجراء التحقيق على التجريبيات المرتكزة على على ذكاء السرب ، واستخدام الذاكرة و التجريبياتبدون ذاكرة ، وخصائص الذاكرة والذاكرة في التجريبيات المرتكزة على ذكاء السرب. تم تحليل المعلومات والمراجع لاستخراج المعلوماتالأساسية وتعيينها في الأقسام الفرعية ذات الصلة. تم فحص ما مجموعه 50 مرجعًا تتعلق بدراسات استخدام الذاكرة من عام 2003 إلى عام2018 ، وتبين أن استخدام الذاكرة ضروري للغاية لزيادة فعالية التجريبيات من خلال الاستفادة من تجاربها السابقة الناجحة. لذلك تعتبرالذاكرة في التجريبيات واحدة من العناصر الأساسية الفعالة للتجريبيات المتقدمة. كما تم تسليط الضوء على مشاكل في استخدام الذاكرة. نتائجهذه المراجعة مفيدة للباحثين في تطوير تجريبيات فعالة ، من خلال الأخذ بنظر الاعتبار استخدام الذاكرة.Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory characteristics and memory in SI-based metaheuristics. The latest information and references have been further analyzed to extract key information and mapped into respective subsections. A total of 50 references related to memory usage studies from 2003 to 2018 have been investigated and show that the usage of memory is extremely necessary to increase effectiveness of metaheuristics by taking the advantages from their previous successful experiences. Therefore, in advanced metaheuristics, memory is considered as one of the fundamental elements of an efficient metaheuristic. Issues in memory usage have also been highlighted. The results of this review are beneficial to the researchers in developing efficient metaheuristics, by taking into consideration the usage of memory

Enhancing Feature Selection Accuracy using Butterfly and Lion Optimization Algorithm with Specific Reference to Psychiatric Disorder Detection & Diagnosis

As the complexity of medical computing increases the use of intelligent methods based on methods of soft computing also increases. During current decade this intelligent computing involves various meta-heuristic algorithms for Optimization. Many new meta-heuristic algorithms are proposed in last few years. The dimension of this data has also wide. Feature selection processes play an important role in these types of wide data. In intelligent computation feature selection is important phase after the pre-processing phase. The success of any model depends on how better optimization algorithms is used. Sometime single optimization algorithms are not enough in order to produce better result. In this paper meta-heuristic algorithm like butterfly optimization algorithm and enhanced lion optimization algorithm are used to show better accuracy in feature selection. The study focuses on nature based integrated meta-heuristic algorithm like Butterfly Optimization and lion-based optimization. Also, in this paper various other Optimization algorithms are analyzed. The study shows how integrated methods are useful to enhance the accuracy of any computing model to solve Complex problems. Here experimental result has shown by proposing and hybrid model for two major psychiatric disorders one is known as autism spectrum and second one is Parkinson's disease

A Tent L\'evy Flying Sparrow Search Algorithm for Feature Selection: A COVID-19 Case Study

The "Curse of Dimensionality" induced by the rapid development of information science, might have a negative impact when dealing with big datasets. In this paper, we propose a variant of the sparrow search algorithm (SSA), called Tent L\'evy flying sparrow search algorithm (TFSSA), and use it to select the best subset of features in the packing pattern for classification purposes. SSA is a recently proposed algorithm that has not been systematically applied to feature selection problems. After verification by the CEC2020 benchmark function, TFSSA is used to select the best feature combination to maximize classification accuracy and minimize the number of selected features. The proposed TFSSA is compared with nine algorithms in the literature. Nine evaluation metrics are used to properly evaluate and compare the performance of these algorithms on twenty-one datasets from the UCI repository. Furthermore, the approach is applied to the coronavirus disease (COVID-19) dataset, yielding the best average classification accuracy and the average number of feature selections, respectively, of 93.47% and 2.1. Experimental results confirm the advantages of the proposed algorithm in improving classification accuracy and reducing the number of selected features compared to other wrapper-based algorithms

Uma breve revisão sobre métodos Meta-Heurísticos para a extração dos parâmetros Fotovoltaicos

As mudanças climáticas, o aumento da poluição e as crescentes preocupações ambientais colocam a humanidade diante de um problema energético. É nesse contexto que as energias renováveis assumem um papel fundamental para alcançar a neutralidade carbónica. Assim, para reduzir a utilização dos combustíveis fosseis é indispensável que as fontes de energia renovável se afirmem como uma solução vantajosa e viável para a produção de energia elétrica. Este aumento de produção de energia elétrica a partir de fontes renováveis é vital para se cumprirem os vários acordos mundiais e europeus que foram assinados com o propósito de atingir os desígnios assinados. A fonte de energia renovável com o maior potencial no futuro é a energia solar. No entanto, para esta energia se consolidar é necessário que as tecnologias fotovoltaicas sejam mais eficientes. A presente dissertação tem como objetivo analisar uma série de fatores que influenciam a determinação dos parâmetros e que caraterizam os respetivos modelos matemáticos. Concretamente, os fatores determinantes que foram analisados foram: os modelos matemáticos, as tecnologias PV, os métodos/algoritmos de otimização que foram utilizados para simular o comportamento de uma célula ou módulo fotovoltaico e, por último, a técnica aplicada para contornar a natureza implícita das equações que caraterizam o respetivo modelo fotovoltaico.Climate change, the increasing pollution, and growing environmental concerns place humanity in the face of an energetic problem. In this context, renewable energies play a key role in achieving carbon neutrality. Thus, in order to reduce the use of fossil fuels it is essential that renewable energy sources establish themselves as an advantageous and viable solution for the production of electricity. Increasing the production of electrical energy from renewable sources is crucial to meet the various global and European agreements that have been signed aiming the achievement of the proposed objectives. The renewable energy source with the highest potential for the future is solar energy. However, to consolidate this energy, photovoltaic technologies must be more efficient. The present dissertation aims to analyse a series of factors that influence the determination of the parameters that characterize the respective mathematical models. Specifically, the determining factors that have been analysed are: the mathematical models, the PV technologies, the optimization methods/algorithms that were used to simulate the behavior of a photovoltaic cell or module, and the technique applied to avoid the implicit nature of the equations that characterize the respective photovoltaic model