Local Fitness Landscape Exploration Based Genetic Algorithms

Abstract

Genetic algorithms (GAs) have been used to evolve optimal/sub-optimal solutions of many problems. When using GAs for evolving solutions, often fitness evaluation is the most computationally expensive, and this discourages researchers from applying GAs for computationally challenging problems. This paper presents an approach for generating offspring based on a local fitness landscape exploration to increase the speed of the search for optimal/sub-optimal solutions and to evolve better fitness solutions. The proposed algorithm, "Fitness Landscape Exploration based Genetic Algorithm" (FLEX-GA) can be applied to single and multi-objective optimization problems. Experiments were conducted on several single and multi-objective benchmark problems with and without constraints. The performance of the FLEXbased algorithm on single-objective problems is compared with a canonical GA and other algorithms. For multi-objective benchmark problems, the comparison is made with NSGA-II, and other multi-objective optimization algorithms. Lastly, Pareto solutions are evolved on eight real-world multi-objective optimization problems, and a comparative performance is presented with NSGA-II. Experimental results show that using FLEX on most of the single and multi-objective problems, the speed of the search improves up to 50% and the quality of solutions also improves. These results provide sufficient evidence of the applicability of fitness landscape approximation-based algorithms for solving real-world optimization problems.

A Meta-Heuristic Method for Reassemble Bifragmented Intertwined JPEG Image Files in Digital Forensic Investigation

“…Finally, the genetic algorithm is needed to stop when the population meets toward the best solution. Figure 1 also shows seven key steps in the Genetic algorithm procedure and their corresponding optional schemes [24]. Initializing the chromosomes: it's a population reporting form, including population size, evolutional generation, crossover probability, and mutation probability.…”

Pharmaceutical distribution path optimization based on K-nearest neighbor algorithm

“…The basic idea of the algorithm [6][7][8] is to start from the starting point and select the closest and unvisited point to the current point as the next visited point each time until all points have been visited and then return to the starting point. The main advantages of this algorithm [9] are that it is simple to understand, easy to implement, and can find acceptable solutions for small and medium scale problems.…”