Diversity guided genetic algorithm to solve the resource constrained project scheduling problem
by Israa' Y. Ismail; Mahmoud A. Barghash
International Journal of Planning and Scheduling (IJPS), Vol. 1, No. 3, 2012

Abstract: This paper proposes a diversity guided genetic algorithm to solve the resource constrained project scheduling problem (RCPSP). The proposed algorithm is based on the concept of diversifying the population when it tends to converge in order to widen the search space and overcome the problem of premature convergence. Three sources of population diversity are suggested: multiple point crossover, diversity guided mutation (DGM), and no relative marriage (NRM)-based selection. The proposed algorithm also uses the forward-backward improvement (FBI) to transform a solution to one or more enhanced solutions during the search process. The computational experiments show that the proposed DGGA-FBI significantly outperforms the standard GA and gives competitive results with respect to the state of the art algorithms to solve RCPSP.

Online publication date: Wed, 29-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Planning and Scheduling (IJPS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com