SOCIAL HARMONY SEARCH ALGORITHM FOR CONTINUOUS 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.

KAVEH A.; AHANGARAN M.

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

Journal Paper

Paper Information

Journal: IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING Year:2012 | Volume:36 | Issue:C2 Page(s): 121-137

Download Full-Text

View:

331

Download:

281

Cites:

Information Journal Paper

Title

SOCIAL HARMONY SEARCH ALGORITHM FOR CONTINUOUS OPTIMIZATION

Author(s)

KAVEH A. | AHANGARAN M. | Issue Writer Certificate

Keywords

SOCIAL HARMONY SEARCH

NORMAL DISTRIBUTION

META-HEURISTICS

OPTIMIZATION

DIVERSIFICATION

INTENSIFICATION

Abstract

This paper presents a SOCIAL HARMONY SEARCH algorithm to solve OPTIMIZATION problems with continuous design variables. Although the Harmony Search (HS) algorithm (HSA) has proven its ability in finding near global regions within a reasonable time, it is rather inefficient in performing local search. The proposed method applies the harmony search optimizer for global OPTIMIZATION and NORMAL DISTRIBUTION is employed to update the position of each design variable of a new harmony found by the first rule of the HS (memory consideration) in every stage to rapidly attain the feasible solution space. NORMAL DISTRIBUTION works as a global search in early iterations and as a local search in final iterations to improve HS in order to quickly converge and find better solutions. Various benchmark OPTIMIZATION problems are used to illustrate the effectiveness and robustness of the proposed method. Finally, the experimental results reveal the superiority of the proposed method in quick convergence and finding better solutions compared to the classic HS, its recently developed variants, and some other OPTIMIZATION algorithms.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KAVEH, A., & AHANGARAN, M.. (2012). SOCIAL HARMONY SEARCH ALGORITHM FOR CONTINUOUS OPTIMIZATION. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, 36(C2), 121-137. SID. https://sid.ir/paper/595824/en

Vancouver: Copy

KAVEH A., AHANGARAN M.. SOCIAL HARMONY SEARCH ALGORITHM FOR CONTINUOUS OPTIMIZATION. IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING[Internet]. 2012;36(C2):121-137. Available from: https://sid.ir/paper/595824/en

IEEE: Copy

A. KAVEH, and M. AHANGARAN, “SOCIAL HARMONY SEARCH ALGORITHM FOR CONTINUOUS OPTIMIZATION,” IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION B- ENGINEERING, vol. 36, no. C2, pp. 121–137, 2012, [Online]. Available: https://sid.ir/paper/595824/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops