Adaptive Cellular Memetic Algorithms

2009 ◽  
Vol 17 (2) ◽  
pp. 231-256 ◽  
Author(s):  
Nguyen Quang Huy ◽  
Ong Yew Soon ◽  
Lim Meng Hiot ◽  
Natalio Krasnogor
Keyword(s):  
Memetic Algorithm ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Memetic Algorithms ◽  
Adaptive Mechanisms ◽  
Cellular Genetic Algorithm ◽  
Local Solutions ◽  
Continuous Optimization Problems ◽  
Exploration Versus Exploitation

A cellular genetic algorithm (CGA) is a decentralized form of GA where individuals in a population are usually arranged in a 2D grid and interactions among individuals are restricted to a set neighborhood. In this paper, we extend the notion of cellularity to memetic algorithms (MA), a configuration termed cellular memetic algorithm (CMA). In addition, we propose adaptive mechanisms that tailor the amount of exploration versus exploitation of local solutions carried out by the CMA. We systematically benchmark this adaptive mechanism and provide evidence that the resulting adaptive CMA outperforms other methods both in the quality of solutions obtained and the number of function evaluations for a range of continuous optimization problems.

scholarly journals The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm

Mathematics ◽  
2018 ◽  
Vol 7 (1) ◽  
pp. 17 ◽  
Author(s):  
Yanhong Feng ◽  
Haizhong An ◽  
Xiangyun Gao
Keyword(s):  
Transfer Function ◽  
Knapsack Problem ◽  
Transfer Functions ◽  
Optimization Problems ◽  
Search Algorithm ◽  
Continuous Optimization ◽  
Search Space ◽  
Discrete Search ◽  
Continuous Optimization Problems

Moth search (MS) algorithm, originally proposed to solve continuous optimization problems, is a novel bio-inspired metaheuristic algorithm. At present, there seems to be little concern about using MS to solve discrete optimization problems. One of the most common and efficient ways to discretize MS is to use a transfer function, which is in charge of mapping a continuous search space to a discrete search space. In this paper, twelve transfer functions divided into three families, S-shaped (named S1, S2, S3, and S4), V-shaped (named V1, V2, V3, and V4), and other shapes (named O1, O2, O3, and O4), are combined with MS, and then twelve discrete versions MS algorithms are proposed for solving set-union knapsack problem (SUKP). Three groups of fifteen SUKP instances are employed to evaluate the importance of these transfer functions. The results show that O4 is the best transfer function when combined with MS to solve SUKP. Meanwhile, the importance of the transfer function in terms of improving the quality of solutions and convergence rate is demonstrated as well.

scholarly journals A Modified Artificial Bee Colony Algorithm with Firefly Algorithm Strategy for Continuous Optimization Problems

2018 ◽  
Vol 2018 ◽  
pp. 1-9 ◽  
Author(s):  
Amnat Panniem ◽  
Pikul Puphasuk
Keyword(s):  
Firefly Algorithm ◽  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Control Parameters ◽  
Exploration And Exploitation ◽  
Bee Colony ◽  
Continuous Problems ◽  
Local Solutions ◽  
Continuous Optimization Problems

Artificial Bee Colony (ABC) algorithm is one of the efficient nature-inspired optimization algorithms for solving continuous problems. It has no sensitive control parameters and has been shown to be competitive with other well-known algorithms. However, the slow convergence, premature convergence, and being trapped within the local solutions may occur during the search. In this paper, we propose a new Modified Artificial Bee Colony (MABC) algorithm to overcome these problems. All phases of ABC are determined for improving the exploration and exploitation processes. We use a new search equation in employed bee phase, increase the probabilities for onlooker bees to find better positions, and replace some worst positions by the new ones in onlooker bee phase. Moreover, we use the Firefly algorithm strategy to generate a new position replacing an unupdated position in scout bee phase. Its performance is tested on selected benchmark functions. Experimental results show that MABC is more effective than ABC and some other modifications of ABC.

scholarly journals Text documents clustering using modified multi-verse optimizer

2020 ◽  
Vol 10 (6) ◽  
pp. 6361
Author(s):  
Ammar Kamal Abasi ◽  
Ahamad Tajudin Khader ◽  
Mohammed Azmi Al-Betar ◽  
Syibrah Naim ◽  
Mohammed A. Awadallah ◽  
...  
Keyword(s):  
Euclidean Distance ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
Search Space ◽  
Discrete Optimization Problem ◽  
Text Documents ◽  
Text Document ◽  
Continuous Optimization Problems ◽  
Measure Entropy

In this study, a multi-verse optimizer (MVO) is utilised for the text document clus- tering (TDC) problem. TDC is treated as a discrete optimization problem, and an objective function based on the Euclidean distance is applied as similarity measure. TDC is tackled by the division of the documents into clusters; documents belonging to the same cluster are similar, whereas those belonging to different clusters are dissimilar. MVO, which is a recent metaheuristic optimization algorithm established for continuous optimization problems, can intelligently navigate different areas in the search space and search deeply in each area using a particular learning mechanism. The proposed algorithm is called MVOTDC, and it adopts the convergence behaviour of MVO operators to deal with discrete, rather than continuous, optimization problems. For evaluating MVOTDC, a comprehensive comparative study is conducted on six text document datasets with various numbers of documents and clusters. The quality of the final results is assessed using precision, recall, F-measure, entropy accuracy, and purity measures. Experimental results reveal that the proposed method performs competitively in comparison with state-of-the-art algorithms. Statistical analysis is also conducted and shows that MVOTDC can produce significant results in comparison with three well-established methods.

Enabling the Extended Compact Genetic Algorithm for Real-Parameter Optimization by Using Adaptive Discretization

2010 ◽  
Vol 18 (2) ◽  
pp. 199-228 ◽  
Author(s):  
Ying-ping Chen ◽  
Chao-Hong Chen
Keyword(s):  
Genetic Algorithm ◽  
Optimization Problems ◽  
Economic Dispatch ◽  
Continuous Optimization ◽  
Memetic Algorithms ◽  
Discretization Method ◽  
Adaptive Discretization ◽  
Compact Genetic Algorithm ◽  
Economic Dispatch Problem ◽  
Continuous Optimization Problems

An adaptive discretization method, called split-on-demand (SoD), enables estimation of distribution algorithms (EDAs) for discrete variables to solve continuous optimization problems. SoD randomly splits a continuous interval if the number of search points within the interval exceeds a threshold, which is decreased at every iteration. After the split operation, the nonempty intervals are assigned integer codes, and the search points are discretized accordingly. As an example of using SoD with EDAs, the integration of SoD and the extended compact genetic algorithm (ECGA) is presented and numerically examined. In this integration, we adopt a local search mechanism as an optional component of our back end optimization engine. As a result, the proposed framework can be considered as a memetic algorithm, and SoD can potentially be applied to other memetic algorithms. The numerical experiments consist of two parts: (1) a set of benchmark functions on which ECGA with SoD and ECGA with two well-known discretization methods: the fixed-height histogram (FHH) and the fixed-width histogram (FWH) are compared; (2) a real-world application, the economic dispatch problem, on which ECGA with SoD is compared to other methods. The experimental results indicate that SoD is a better discretization method to work with ECGA. Moreover, ECGA with SoD works quite well on the economic dispatch problem and delivers solutions better than the best known results obtained by other methods in existence.

scholarly journals Binary social group optimization algorithm for solving 0-1 knapsack problem

2022 ◽  
Vol 11 (1) ◽  
pp. 55-72 ◽  
Author(s):  
Anima Naik ◽  
Pradeep Kumar Chokkalingam
Keyword(s):  
Knapsack Problem ◽  
Social Group ◽  
Optimization Problems ◽  
Continuous Optimization ◽  
High Dimensional ◽  
The Social ◽  
Social Group Optimization ◽  
Low Dimensional ◽  
Continuous Optimization Problems

In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems. So a transformation function is used to convert the continuous values generated from SGO into binary ones. The experiments are carried out using both low-dimensional and high-dimensional knapsack problems. The results obtained by the BSGO algorithm are compared with other binary optimization algorithms. Experimental results reveal the superiority of the BSGO algorithm in achieving a high quality of solutions over different algorithms and prove that it is one of the best finding algorithms especially in high-dimensional cases.

Sign in / Sign up

Export Citation Format

Share Document