AN EFFICIENT IMPERIALIST COMPETITIVE ALGORITHM FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PANAHI I.; NAHAVANDI N.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2017 | Volume:51 | Issue:2 Page(s): 161-174

Download Full-Text

Persian Verion

View:

1,456

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT IMPERIALIST COMPETITIVE ALGORITHM FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM

Author(s)

PANAHI I. | NAHAVANDI N. | Issue Writer Certificate

Keywords

IMPERIALIST COMPETITIVE ALGORITHMQ1

OPTIMIZATION ALGORITHMQ1

RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMQ1

Abstract

In this paper, a new algorithm based on the framework of the IMPERIALIST COMPETITIVE ALGORITHM for solving RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM (RCPSP) will be proposed. In this problem, the activities are scheduled based on the resource and precedence relationships constraints in a way that the makes pan will be minimized. In order to model the assimilation process, a uniform crossover has been used, and to avoid premature convergence of the proposed algorithm, two revolution operators including one point revolution and multi-point revolution will be introduced. Also, in order to enhance the exploitation ability, a combined local search including permutation based local search (PBLS) and forward-backward improvement (FBI) is performed. The algorithm parameters are determined by designing Taguchi experiment, and the efficiency of proposed ICA is demonstrated by solving PSPLIB problems. Computational results and comparisons with some existing algorithms show that the proposed algorithm can produce near-optimal solution for small problems and competitive solution for large ones.

Cites

No record.

References

No record.

Cite

APA: Copy

PANAHI, I., & NAHAVANDI, N.. (2017). AN EFFICIENT IMPERIALIST COMPETITIVE ALGORITHM FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 51(2 ), 161-174. SID. https://sid.ir/paper/166477/en

Vancouver: Copy

PANAHI I., NAHAVANDI N.. AN EFFICIENT IMPERIALIST COMPETITIVE ALGORITHM FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2017;51(2 ):161-174. Available from: https://sid.ir/paper/166477/en

IEEE: Copy

I. PANAHI, and N. NAHAVANDI, “AN EFFICIENT IMPERIALIST COMPETITIVE ALGORITHM FOR RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEM,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 51, no. 2 , pp. 161–174, 2017, [Online]. Available: https://sid.ir/paper/166477/en

Related Journal Papers