SOLVING RESOURCE CONSTRAINT PROJECT SCHEDULING PROBLEMS USING MODIFIED ANT COLONY OPTIMIZATION

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.

KHALILI DAMGHANI K.; TAVAKKOLI MOGHADDAM R.; TABARI M.

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

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2011 | Volume:45 | Issue:1 Page(s): 59-69

Download Full-Text

Persian Verion

View:

2,798

Download:

Cites:

Information Journal Paper

Title

SOLVING RESOURCE CONSTRAINT PROJECT SCHEDULING PROBLEMS USING MODIFIED ANT COLONY OPTIMIZATION

Author(s)

KHALILI DAMGHANI K. | TAVAKKOLI MOGHADDAM R. | TABARI M. | Issue Writer Certificate

Keywords

ANT COLONY OPTIMIZATIONQ2

META-HEURISTIC METHODSQ2

RESOURCE CONSTRAINT PROJECT SCHEDULINGQ2

Abstract

Resource Constraints Project Scheduling Problem (RSPSP) seeks proper sequence of implementation of project activities in a way that the precedence relations and different type of resource constraints are met concurrently. RCPSP tends to optimize some measurement function as make-span, cost of implementation, number of tardy tasks and etc. As RCPSP is assumed as an NP-Hard problem so, different meta-heuristic approaches have been proposed to solve different variants of it. In this paper, a modified ANT COLONY OPTIMIZATION (ACO) approach has been developed to deal with RCPSP. The definition of probabilistic selection rule has been modified in proposed approach in favor of better performance. Moreover, the parameters of algorithm have been determined in an adaptive manner and the stagnation behavior has been prevented in high iterations of algorithm. Uncertainty of parameters of RCPSP has also been discussed. The proposed algorithm has been coded using Visual Basic software and tested on benchmark instance in this area. The results are promising and have been compared with optimal or best known solutions.

Cites

No record.

References

No record.

Cite

APA: Copy

KHALILI DAMGHANI, K., TAVAKKOLI MOGHADDAM, R., & TABARI, M.. (2011). SOLVING RESOURCE CONSTRAINT PROJECT SCHEDULING PROBLEMS USING MODIFIED ANT COLONY OPTIMIZATION. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 45(1), 59-69. SID. https://sid.ir/paper/166393/en

Vancouver: Copy

KHALILI DAMGHANI K., TAVAKKOLI MOGHADDAM R., TABARI M.. SOLVING RESOURCE CONSTRAINT PROJECT SCHEDULING PROBLEMS USING MODIFIED ANT COLONY OPTIMIZATION. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2011;45(1):59-69. Available from: https://sid.ir/paper/166393/en

IEEE: Copy

K. KHALILI DAMGHANI, R. TAVAKKOLI MOGHADDAM, and M. TABARI, “SOLVING RESOURCE CONSTRAINT PROJECT SCHEDULING PROBLEMS USING MODIFIED ANT COLONY OPTIMIZATION,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 45, no. 1, pp. 59–69, 2011, [Online]. Available: https://sid.ir/paper/166393/en

Related Journal Papers