Operation Sequencing Using Genetic Algorithm with Greedy Crossover

Main Article Content

Gurpreet Singh
Gurpreet Singh

Abstract

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

Downloads

Download data is not yet available.

Article Details

Section
Articles

Most read articles by the same author(s)

> >>