Genetic Algorithm Optimization with Selection Operator Decider

Abstract

Genetic Algorithm (GA) is a powerful and flexible meta-heuristic tool to deal with the complexity of optimization problems, as they are directly related to real-life situations. The primary goal of an optimization problem could be to obtain a solution with less effort and near-optimal rather than slow, improbable optimal. GAs serve this purpose by broadly exploring the possible solution space and using genetic operators. The performance of GAs can vary significantly depending on the genetic operators. Although each operator type has upsides and downsides, the selection operator greatly influences the GA’s performance. Conventional GAs initialize with predetermined genetic operators and continue with the same throughout all iterations. In this paper, dynamically adjusting the selection operators to the current progress of the iteration will be shown to be a crucial strategy to improve the performance of the GA. This study aims to propose a novel GA capable of harnessing multiple selection operators by a self-deciding operator structure, which is more advantageous at the current iteration. For this, Technique for Order Preference by Similarity to Ideal Solution (TOPSIS), which is known as a simple and effective multi-criteria decision-making method, will be integrated into the GA by a proposed dynamic decision matrix. The proposed Selection Operator Decider Genetic Algorithm (SODGA) has unique properties with varying selection processes and is capable of using TOPSIS as a decider of the operator inside the iterations. The effectiveness of the presented SODGA framework will be analyzed by a Capacitated Vehicle Routing Problems (CVRPs) benchmark set.