An approach for optimizing multi-objective problems using hybrid genetic algorithms

Abstract

Optimization problems can be found in many aspects of our lives. An optimization problem can be approached as searching problem where an algorithm is proposed to search for the value of one or more variables that minimizes or maximizes an optimization function depending on an optimization goal. Multi-objective optimization problems are also abundant in many aspects of our lives with various applications in different fields in applied science. To solve such problems, evolutionary algorithms have been utilized including genetic algorithms that can achieve decent search space exploration. Things became even harder for multi-objective optimization problems when the algorithm attempts to optimize more than one objective function. In this paper, we propose a hybrid genetic algorithm (HGA) that utilizes a genetic algorithm (GA) to perform a global search supported by the particle swarm optimization algorithm (PSO) to perform a local search. The proposed HGA achieved the concept of rehabilitation of rejected individuals. The proposed HGA was supported by a modified selection mechanism based on the K-means clustering algorithm that succeeded to restrict the selection process to promising solutions only and assured a balanced distribution of both the selected to survive and selected for rehabilitation individuals. The proposed algorithm was tested against 4 benchmark multi-objective optimization functions where it succeeded to achieve maximum balance between search space exploration and search space exploitation. The algorithm also succeeded in improving the HGA’s overall performance by limiting the average number of iterations until convergence.

Goal programming and genetic algorithm in multiple objective optimization model for project portfolio selection: a review

“…Chromosome representation, fitness function, selection, crossover, and mutation are all crucial elements of GA [28]. A mimetic technique for solving optimization issues is a genetic algorithm [29]. It employs population search technology to depict a set of problem-solving options.…”

Comprehensive Planning of Laboratory Equipment Based on Genetic Algorithms

“…To address these problems, an improved approach to the traditional quantum genetic algorithm is proposed, which is based on the adaptive rotation angle strategy of the small habitat strategy, constructing a determinant A to determine the rotation direction, which does not involve multiple judgment conditions of table look-up, and improves the convergence speed of the algorithm. Facing the drawback of premature convergence of quantum bits, which leads the algorithm to fall into local optimal solutions, and premature maturity, two strategies, H ξ convergence gate, and quantum catastrophe, work together to increase the search space of the algorithm, prevent it from falling into local optimal solutions, and improve the convergence accuracy of the algorithm [ 17 ].…”

Automated Market Analysis by RFMx Encoding Based Customer Segmentation using Initial Centroid Selection Optimized K-means Clustering Algorithm

“…The concept of digital transformation is crawling toward all aspects of our lives [7]. Almost all fields are affected with a variety of artificial intelligence techniques being used to maximize the benefit of digital transformation [9] [14]. The field of marketing is significantly concerned as it is significantly important for marketers to understand their customer.…”