Release Time:2019-03-11  Hits:

Indexed by: Journal Article

Date of Publication: 2011-01-01

Journal: Information Technology Journal

Included Journals: Scopus、EI

Volume: 10

Issue: 7

Page Number: 1374-1380

ISSN: 18125638

Abstract: School of Mechanical Engineering, Dalian University of Technology, Dalian 116024, People's Republic of China The Resource-Constrained Project Scheduling Problem (RCPSP) is aNP-hard problem in information engineering. The activities of a project have to be scheduled for satisfying all the precedence and resource constraints. We presented a heuristicalgorithm (EDAS) to deal with this problem which employed an estimation of distribution algorithm (known as EDA) and improved the local search capacity with a simplex search. In this algorithm, the EDA firstly searched the solution space and generated activity liststo provide the initial population; then, the EDA selected the sample solutions to build a probability distribution model. The new individual was generated by sampling this model. The simplex search was used to enhance the local search capacity of the EDA. Compared with state-of-the-art algorithms available in the literature, we showed the effectiveness of this approach empirically on the standard benchmark problems of size J60 and J120 from PSPLIB. ? 2011 Asian Network for Scientific Information.