A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR 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.; ZOLGHADR A.

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

Journal Paper

Paper Information

Journal: International Journal of Optimization in Civil Engineering Year:2016 | Volume:6 | Issue:4 Page(s): 469-492

Download Full-Text

View:

408

Download:

642

Cites:

Information Journal Paper

Title

A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION

Author(s)

KAVEH A. | ZOLGHADR A. | Issue Writer Certificate

Keywords

TUG OF WAR OPTIMIZATION

META-HEURISTIC ALGORITHM

MATHEMATICAL FUNCTIONS

OPTIMAL DESIGN

TRUSS STRUCTURES

Abstract

This paper presents a novel population-based META-HEURISTIC ALGORITHM inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as TUG OF WAR OPTIMIZATION (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions. The teams exert pulling forces on each other based on the quality of the solutions they represent. The competing teams move to their new positions according to Newtonian laws of mechanics. Unlike many other meta-heuristic methods, the algorithm is formulated in such a way that considers the qualities of both of the interacting solutions. TWO is applicable to global optimization of discontinuous, multimodal, non-smooth, and non-convex functions. Viability of the proposed method is examined using some benchmark MATHEMATICAL FUNCTIONS and engineering design problems. The numerical results indicate the efficiency of the proposed algorithm compared to some other methods available in literature.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

KAVEH, A., & ZOLGHADR, A.. (2016). A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION. INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING, 6(4), 469-492. SID. https://sid.ir/paper/329465/en

Vancouver: Copy

KAVEH A., ZOLGHADR A.. A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION. INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING[Internet]. 2016;6(4):469-492. Available from: https://sid.ir/paper/329465/en

IEEE: Copy

A. KAVEH, and A. ZOLGHADR, “A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION,” INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING, vol. 6, no. 4, pp. 469–492, 2016, [Online]. Available: https://sid.ir/paper/329465/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops