<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>International Journal of Optimization in Civil Engineering</title>
<title_fa>عنوان نشریه</title_fa>
<short_title>IJOCE</short_title>
<subject>Engineering &amp; Technology</subject>
<web_url>http://ijoce.iust.ac.ir</web_url>
<journal_hbi_system_id>18</journal_hbi_system_id>
<journal_hbi_system_user>agent2</journal_hbi_system_user>
<journal_id_issn>2228-7558</journal_id_issn>
<journal_id_issn_online>3060-8236</journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>doi</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1395</year>
	<month>7</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2016</year>
	<month>10</month>
	<day>1</day>
</pubdate>
<volume>6</volume>
<number>4</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>A NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR  OPTIMIZATION</title>
	<subject_fa>Optimal design</subject_fa>
	<subject>Optimal design</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p dir=&quot;ltr&quot;&gt;This paper presents a novel population-based meta-heuristic algorithm inspired by the game&amp;nbsp;of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization&amp;nbsp;(TWO), considers each candidate solution as a team participating in a series of rope pulling&amp;nbsp;competitions. &amp;nbsp;The &amp;nbsp;teams &amp;nbsp;exert &amp;nbsp;pulling &amp;nbsp;forces &amp;nbsp;on &amp;nbsp;each &amp;nbsp;other &amp;nbsp;based &amp;nbsp;on &amp;nbsp;the &amp;nbsp;quality &amp;nbsp;of &amp;nbsp;the&amp;nbsp;solutions &amp;nbsp;they &amp;nbsp;represent. &amp;nbsp;The &amp;nbsp;competing &amp;nbsp;teams &amp;nbsp;move &amp;nbsp;to &amp;nbsp;their &amp;nbsp;new &amp;nbsp;positions &amp;nbsp;according &amp;nbsp;to Newtonian laws of mechanics. Unlike many other meta-heuristic methods, the algorithm is&amp;nbsp;formulated &amp;nbsp;in &amp;nbsp;such &amp;nbsp;a &amp;nbsp;way &amp;nbsp;that &amp;nbsp;considers &amp;nbsp;the &amp;nbsp;qualities &amp;nbsp;of &amp;nbsp;both &amp;nbsp;of &amp;nbsp;the &amp;nbsp;interacting &amp;nbsp;solutions. TWO &amp;nbsp;is &amp;nbsp;applicable &amp;nbsp;to &amp;nbsp;global &amp;nbsp;optimization &amp;nbsp;of &amp;nbsp;discontinuous, &amp;nbsp;multimodal, &amp;nbsp;non-smooth, &amp;nbsp;and&amp;nbsp;non-convex functions. Viability of the proposed method is examined using some benchmark&amp;nbsp;mathematical functions and engineering design problems. The numerical results indicate the&amp;nbsp;efficiency of the proposed algorithm compared to some other methods available in literature.&lt;/p&gt;
</abstract>
	<keyword_fa></keyword_fa>
	<keyword>tug  of  war  optimization,  meta-heuristic  algorithm,  mathematical  functions,  optimal design, truss structures</keyword>
	<start_page>469</start_page>
	<end_page>492</end_page>
	<web_url>http://ijoce.iust.ac.ir/browse.php?a_code=A-10-66-111&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>A.</first_name>
	<middle_name></middle_name>
	<last_name>Kaveh</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>180031947532846001022</code>
	<orcid>180031947532846001022</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>A.</first_name>
	<middle_name></middle_name>
	<last_name>Zolghadr</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>180031947532846001023</code>
	<orcid>180031947532846001023</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
