AN ANT COLONY ALGORITHM FOR RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH MULTIPLE -CHOICE UNDER BUDGET CONSTRAINT

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.

JALALI NAEINI S.GH.R.; AHMADIZAR F.

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

Journal Paper

Paper Information

Journal: MANAGEMENT KNOWLEDGE Year:2007 | Volume:20 | Issue:76 Page(s): 3-22

Download Full-Text

Persian Verion

View:

1,360

Download:

Cites:

Information Journal Paper

Title

AN ANT COLONY ALGORITHM FOR RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH MULTIPLE -CHOICE UNDER BUDGET CONSTRAINT

Author(s)

JALALI NAEINI S.GH.R. | AHMADIZAR F. | Issue Writer Certificate

Keywords

ANT COLONY SYSTEMQ3

BUDGET CONSTRAINTQ3

MULTIPLE CHOICEQ3

RELIABILITY OPTIMIZATIONQ3

SERIES SYSTEMQ3

Abstract

ANT COLONY SYSTEM (ACS) is defined as a metaheuristic acting according to the behavior of natural ants. In this article ACS is used for RELIABILITY OPTIMIZATION of a SERIES SYSTEM under multiple- choice for the selection of the type of technology in each subsystem such that optimization of the reliability of the whole system can be achieved with regard to BUDGET CONSTRAINT. This problem is NP-hard and it could be modeled as zero-one nonlinear programming. In this paper we propose an ACS algorithm based on the artificial ant behavior which responding to the communication with previous ants and with regard to the objective function. The constructed solutions are not guaranteed to be feasible; therefore using a convenient mechanism an infeasible solution is replaced by feasible one and then they are improved by a local search. We have compared the proposed method with an Ant System (AS) algorithm. Computational results have shown that the proposed ACS has better performance in producing solutions with higher quality in particular for problems with large number of subsystems.

Cites

No record.

References

No record.

Cite

APA: Copy

JALALI NAEINI, S.GH.R., & AHMADIZAR, F.. (2007). AN ANT COLONY ALGORITHM FOR RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH MULTIPLE -CHOICE UNDER BUDGET CONSTRAINT. MANAGEMENT KNOWLEDGE, 20(76), 3-22. SID. https://sid.ir/paper/88154/en

Vancouver: Copy

JALALI NAEINI S.GH.R., AHMADIZAR F.. AN ANT COLONY ALGORITHM FOR RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH MULTIPLE -CHOICE UNDER BUDGET CONSTRAINT. MANAGEMENT KNOWLEDGE[Internet]. 2007;20(76):3-22. Available from: https://sid.ir/paper/88154/en

IEEE: Copy

S.GH.R. JALALI NAEINI, and F. AHMADIZAR, “AN ANT COLONY ALGORITHM FOR RELIABILITY OPTIMIZATION OF A SERIES SYSTEM WITH MULTIPLE -CHOICE UNDER BUDGET CONSTRAINT,” MANAGEMENT KNOWLEDGE, vol. 20, no. 76, pp. 3–22, 2007, [Online]. Available: https://sid.ir/paper/88154/en

Related Journal Papers