An adaptive crossover genetic algorithm with simulated annealing for multi mode resource constrained project scheduling with discounted cash flows
by Vijay S. Bilolikar; Karuna Jain; Mahesh Sharma
International Journal of Operational Research (IJOR), Vol. 25, No. 1, 2016

Abstract: This paper presents an adaptive crossover genetic algorithm with simulated annealing metaheuristic procedure for solving a multimode resource-constrained project scheduling problem with discounted cash flows for minimising costs. To solve the problem, a genetic algorithm is proposed for the global search, and simulated annealing is used for the local search. Two crossover operators are employed. A mathematical model is developed for the problem. Detailed computational experiments are performed on a standard problem set with randomly generated resource costs to evaluate the performance of the proposed hybrid approach.

Online publication date: Mon, 30-Nov-2015

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 Operational Research (IJOR):
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