Effect of crossover probability on performance of genetic algorithm in scheduling of parallel machines for BI-criteria objectives

Abstract

Optimization of multi objective function gain the importance in the scheduling process. Many classical techniques are available to address the multi objective functions but the solutions yield the unsatisfactory results when the problem becomes complex and large. Evolutionary algorithm would be the solution for such problems. Genetic algorithm is adaptive heuristic search algorithms and optimization techniques that mimic the process of natural evolution. Genetic algorithms are a very effective way of obtaining a reasonable solution quickly to a complex problem. The genetic algorithm operators such as selection method, crossover method, crossover probability, mutation operators and stopping criteria have an effect on obtaining the reasonably good solution and the computational time. Partially mapped crossover operators are used to solve the problem of the traveling salesman, planning and scheduling of the machines, etc., which are having a wide range of solutions. This paper presents the effect of crossover probability on the performance of the genetic algorithm for the bi-criteria objective function to obtain the best solution in a reasonable time. The simulation on a designed genetic algorithm was conducted with a crossover probability of 0.4 to 0.95 (with a step of 0.05) and 0.97, found that results were converging for the crossover probability of 0.6 with the computational time of 3.41 seconds.