Operation Sequencing Using Genetic Algorithm with Greedy Crossover

Gurpreet Singh, Gurpreet Singh


Operation Sequencing Problem (OSP) is a typical NP complete problem, of which the search space increases with the number of operations. Genetic Algorithm (GA) is an efficient optimization algorithm characterized with explicit parallelism and robustness, applicable to OSP. In this paper, we will solve a problem of operation sequencing using GA. But, we will not use simple GA; will use Greedy Crossover instead of simple crossover. Finally experimental results show that the new Greedy Crossover algorithms perform much better than the other techniques.


Keywords: Operation; Sequencing; Problem; Genetic Algorithm

Full Text:


DOI: https://doi.org/10.26483/ijarcs.v2i4.685


  • There are currently no refbacks.

Copyright (c) 2016 International Journal of Advanced Research in Computer Science