Modified Firefly Algorithm

Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behavior of fireflies. In the algorithm, randomly generated solutions will be considered as fireflies, and brightness is assigned depending on their performance on the objective function. One of the rules used to construct the algorithm is, a firefly will be attracted to a brighter firefly, and if there is no brighter firefly, it will move randomly. In this paper we modify this random movement of the brighter firefly by generating random directions in order to determine the best direction in which the brightness increases. If such a direction is not generated, it will remain in its current position. Furthermore the assignment of attractiveness is modified in such a way that the effect of the objective function is magnified. From the simulation result it is shown that the modified firefly algorithm performs better than the standard one in finding the best solution with smaller CPU time

Multiple Sequence Alignment Menggunakan Nature-Inspired Metaheuristic Algorithms

Multiple sequence alignment adalah proses dasar yang sering dibutuhkan dalam mengolah beberapa sequence yang berhubungan dengan bioinformatika. Apabila multiple sequence alignment telah selesai dikerjakan, maka dapat dilakukan analisis-analisis lain yang lebih jauh, seperti analisis filogenetik atau prediksi struktur protein. Banyaknya kegunaan dari multiple sequence alignment mengakibatkannya menjadi salah satu permasalahan yang banyak diteliti. Banyak algoritma-algoritma metaheuristic yang berdasar pada kejadian-kejadian alami, yang biasa disebut dengan nature-inspired metaheuristic algorithms. Beberapa algoritma baru dalam nature-inspired metaheuristic algorithms yang dianggap cukup efisien antara lain adalah firefly algorithm, cuckoo search, dan flower pollination algorithm. Dalam penelitian ini dipaparkan modified Needleman-Wunsch alignment. Didapatkan hasil bahwa modified Needleman-Wunsch alignment adalah metode yang cukup bagus. Modified Needleman-Wunsch alignment tersebut digunakan untuk membentuk solusi awal dari firefly algorithm, cuckoo search, dan flower pollination algorithm. Didapatkan hasil bahwa firefly algorithm, cuckoo search, dan flower pollination algorithm dapat menghasilkan solusi-solusi baru yang lebih baik. Secara keseluruhan, firefly algorithm adalah algoritma yang terbaik dari tiga algoritma tersebut dalam segi skor alignment, namun membutuhkan waktu komputasi yang lebih besar. ======================================================================================== Multiple sequence alignment is a fundamental tool that often needed to process bioinformatic sequences. If multiple sequence alignment is completed, we can process other further analysis, such as phylogenetic analysis or protein structure prediction. The versatility of multiple sequence alignment led it to be the one of the problems that studied continously. Many metaheuristic algorithms are based on natural events, with the so called nature-inspired metaheuristic algorithms. Algorithms in nature-inspired metaheuristic algorithms that considered to be good are firefly algorithm, cuckoo search, and flower pollination algorithm. In this research, we propose modified Needleman-Wunsch alignment. The results show that modified Needleman-Wunsch alignment is a good method. Modified Needleman-Wunsch alignment is used to create initial solution of firefly algorithm, cuckoo search, and flower pollination algorithm. The results show that firefly algorithm, cuckoo search, and flower pollination algorithm can produce new better solution. Overall, firefly algorithm is the best algorithm among the others in alignment score, but need large computation time

Mobile Robot Path Planning Method Using Firefly Algorithm for 3D Sphere Dynamic & Partially Known Environment

اذا البحث يقترح طريقة لحل مشكلة تخطيط مسار الروبوت المتحرك في ضمن بيئة شبه معروفة ثلاثية الابعاد كروية الشكل باستخدام نسخة معدلة من خوارزمية الحشرات المضيئة Firefly Algorithm والتي تمكنت بنجاح من ايجاد طريق شبه مثالي خالي من التصادم مع العوائق بسرعة وسهولة وملاحة آمنة على طول الطريق حتى الوصول للهدف. In this paper, a new method is proposed to solve the problem of path planning for a mobile robot in a dynamic-partially knew three-dimensional sphere environment by using a modified version of the Firefly Algorithm that successfully finds near optimal and collision-free path while maintaining quick, easy and completely safe navigation throughout the path to the goal

Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data

Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension of data sets further helps in improving the computational efficiency of the learning model. In this paper, we propose a modified algorithm based on the tabu search as local search procedures to a Greedy Randomized Adaptive Search Procedure (GRASP) for high dimensional microarray data sets. The proposed Tabu based Greedy Randomized Adaptive Search Procedure algorithm is named as TGRASP. In TGRASP, a new parameter has been introduced named as Tabu Tenure and the existing parameters, NumIter and size have been modified. We observed that different parameter settings affect the quality of the optimum. The second proposed algorithm known as FFGRASP (Firefly Greedy Randomized Adaptive Search Procedure) uses a firefly optimization algorithm in the local search optimzation phase of the greedy randomized adaptive search procedure (GRASP). Firefly algorithm is one of the powerful algorithms for optimization of multimodal applications. Experimental results show that the proposed TGRASP and FFGRASP algorithms are much better than existing algorithm with respect to three performance parameters viz. accuracy, run time, number of a selected subset of features. We have also compared both the approaches with a unified metric (Extended Adjusted Ratio of Ratios) which has shown that TGRASP approach outperforms existing approach for six out of nine cancer microarray datasets and FFGRASP performs better on seven out of nine datasets

A new modified firefly algorithm for optimizing a supply chain network problem

Firefly algorithm is among the nature-inspired optimization algorithms. The standard firefly algorithm has been successfully applied to many engineering problems. However, this algorithm might be stuck in stagnation (the solutions do not enhance anymore) or possibly fall in premature convergence (fall in to the local optimum) in searching space. It seems that both issues could be connected to the exploitation and exploration. Excessive exploitation leads to premature convergence, while excessive exploration slows down the convergence. In this study, the classical firefly algorithm is modified such that make a balance between exploitation and exploration. The purposed modified algorithm ranks and sorts the initial solutions. Next, the operators named insertion, swap and reversion are utilized to search the neighbourhood of solutions in the second group, in which all these operators are chosen randomly. After that, the acquired solutions combined with the first group and the firefly algorithm finds the new potential solutions. A multi-echelon supply chain network problem is chosen to investigate the decisions associated with the distribution of multiple products that are delivered through multiple distribution centres and retailers to end customers and demonstrate the efficiency of the proposed algorithm

Comparative and comprehensive study of linear antenna arrays’ synthesis

In this paper, a comparative and comprehensive study of synthesizing linear antenna array (LAA) designs, is presented. Different desired objectives are considered in this paper; reducing the maximum sidelobe radiation pattern (i.e., pencil-beam pattern), controlling the first null beamwidth (FNBW), and imposing nulls at specific angles in some designs, which are accomplished by optimizing different array parameters (feed current amplitudes, feed current phase, and array elements positions). Three different optimization algorithms are proposed in order to achieve the wanted goals; grasshopper optimization algorithms (GOA), antlion optimization (ALO), and a new hybrid optimization algorithm based on GOA and ALO. The obtained results show the effectiveness and robustness of the proposed algorithms to achieve the wanted targets. In most experiments, the proposed algorithms outperform other well-known optimization methods, such as; Biogeography based optimization (BBO), particle swarm optimization (PSO), firefly algorithm (FA), cuckoo search (CS) algorithm, genetic algorithm (GA), Taguchi method, self-adaptive differential evolution (SADE), modified spider monkey optimization (MSMO), symbiotic organisms search (SOS), enhanced firefly algorithm (EFA), bat flower pollination (BFP) and tabu search (TS) algorithm

Improvements in meta-heuristic algorithms for minimum cost design of reinforced concrete rectangular sections under compression and biaxial bending

A numerical procedure is proposed in this paper for achieving the minimum cost design of reinforced concrete rectangular sections under compression and biaxial bending by using biologically-inspired meta-heuristic optimization algorithms. The problem formulation includes the costs of concrete, reinforcement and formwork, obtaining the detailed optimum design in which the section dimensions and the reinforcement correspond to values used in practice. The formulation has been simplified in order to reduce the computational cost while ensuring the rigor necessary to achieve safe designs. The numerical procedure includes the possibility of using high-strength concrete and several design constraints, such as mínimum reinforcement and limiting the neutral axis depth. Two numerical examples are presented, drawing comparisons between the results obtained by ACI318 and EC2 standards

Reconstructing Rational Functions with FireFly\texttt{FireFly}

We present the open-source $\texttt{C++}$ library $\texttt{FireFly}$ for the reconstruction of multivariate rational functions over finite fields. We discuss the involved algorithms and their implementation. As an application, we use $\texttt{FireFly}$ in the context of integration-by-parts reductions and compare runtime and memory consumption to a fully algebraic approach with the program $\texttt{Kira}$.Comment: 46 pages, 3 figures, 6 tables; v2: matches published versio

Efficiency Analysis of Swarm Intelligence and Randomization Techniques

Swarm intelligence has becoming a powerful technique in solving design and scheduling tasks. Metaheuristic algorithms are an integrated part of this paradigm, and particle swarm optimization is often viewed as an important landmark. The outstanding performance and efficiency of swarm-based algorithms inspired many new developments, though mathematical understanding of metaheuristics remains partly a mystery. In contrast to the classic deterministic algorithms, metaheuristics such as PSO always use some form of randomness, and such randomization now employs various techniques. This paper intends to review and analyze some of the convergence and efficiency associated with metaheuristics such as firefly algorithm, random walks, and L\'evy flights. We will discuss how these techniques are used and their implications for further research.Comment: 10 pages. arXiv admin note: substantial text overlap with arXiv:1212.0220, arXiv:1208.0527, arXiv:1003.146