Welcome to the InfoSci Platform
Reference Hub5
A New Genetic Algorithm for the RCPSP in Large Scale

A New Genetic Algorithm for the RCPSP in Large Scale

Hossein Zoulfaghari, Javad Nematian, Nader Mahmoudi, Mehdi Khodabandeh
Copyright: © 2013 |Volume: 4 |Issue: 2 |Pages: 12
ISSN: 1942-3594|EISSN: 1942-3608|EISBN13: 9781466632769|DOI: 10.4018/jaec.2013040103
Cite Article Cite Article

MLA

Zoulfaghari, Hossein, et al. "A New Genetic Algorithm for the RCPSP in Large Scale." IJAEC vol.4, no.2 2013: pp.29-40. http://doi.org/10.4018/jaec.2013040103

APA

Zoulfaghari, H., Nematian, J., Mahmoudi, N., & Khodabandeh, M. (2013). A New Genetic Algorithm for the RCPSP in Large Scale. International Journal of Applied Evolutionary Computation (IJAEC), 4(2), 29-40. http://doi.org/10.4018/jaec.2013040103

Chicago

Zoulfaghari, Hossein, et al. "A New Genetic Algorithm for the RCPSP in Large Scale," International Journal of Applied Evolutionary Computation (IJAEC) 4, no.2: 29-40. http://doi.org/10.4018/jaec.2013040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Resource Constrained Project Scheduling Problem (RCPSP) is a well-studied academic problem that has been shown to be well suited to optimization via Genetic Algorithms (GA). In this paper, a new method will be designed that would be able to solve RCPSP. This research area is very common in industry especially when a set of activities needs to be finished as soon as possible subject to two sets of constraints, precedence constraints and resource constraints. The presented algorithm in this paper is used to solve large scale RCPSP and improves solutions. Finally, for comparing, results are reported for the most famous classical problems that are taken from PSPLIB.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.