A Study of Crossover Operators for Genetic Algorithm and Proposal of a New Crossover Operator to Solve Open Shop Scheduling Problem

Abstract

Vehicle Routing Problem (VRP) is one of the prominent combinatorial problems and there in a need to address these problems due to increase in logistic activities across the globe. Complexity in solving the problem increases exponentially as the problems size increases. Genetic Algorithm (GA) is widely applied search method to the complex problems such as VRPs. Selection, Crossover and Mutations are the main operators used in GAs. This paper aims at studying different types of Crossover Operators used in Genetic Algorithm applied in solving variety of Vehicle Routing problems. At the end of the paper a new crossover operator 'Sinusoidal Motion Crossover (SMC)' is proposed and demonstrated with two illustrations.