<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Operations Research</title>
<title_fa>مجله انجمن ایرانی تحقیق در عملیات</title_fa>
<short_title>IJOR</short_title>
<subject>Basic Sciences</subject>
<web_url>http://iors.ir/journal</web_url>
<journal_hbi_system_id>0</journal_hbi_system_id>
<journal_hbi_system_user>user</journal_hbi_system_user>
<journal_id_issn>2008-1189</journal_id_issn>
<journal_id_issn_online></journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi>10.29252/iors</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>1399</year>
	<month>6</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2020</year>
	<month>9</month>
	<day>1</day>
</pubdate>
<volume>11</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>other</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Utilizing the Unified Ant Colony Algorithm by Chaotic Maps</title>
	<subject_fa>Mathematical Modeling and Applications of OR</subject_fa>
	<subject>Mathematical Modeling and Applications of OR</subject>
	<content_type_fa>پژوهشی</content_type_fa>
	<content_type>Original</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;span class=&quot;fontstyle0&quot;&gt;Ant colony optimization (ACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;) is a meta-heuristic algorithm for solving continuous optimization&lt;br&gt;
problems (MOPs). In the last decades, some improved versions of ACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;have been proposed.&lt;br&gt;
The UACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;is a unified version of ACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;that is designed for continuous domains. By adjusting&lt;br&gt;
some specified components of the UACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;, some new versions of ACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;can be deduced. By doing&lt;br&gt;
that, it becomes more practical for different types of MOPs. Based on the nature of meta-heuristic&lt;br&gt;
algorithms, the performance of meta-heuristic algorithms are depends on the exploitation and&lt;br&gt;
exploration, which are known as the two useful factors to generate solutions with different&lt;br&gt;
qualities. Since all the meta-heuristic algorithms with random parameters use the probability&lt;br&gt;
functions to generate the random numbers and as a result, there is no any control over the&lt;br&gt;
amount of diversity; hence in this paper, by using the best parameters of UACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;and making&lt;br&gt;
some other changes, we propose a new version of ACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;to increase the efficiency of UACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;.&lt;br&gt;
These changes include using chaotic sequences to generate various random sequences and also&lt;br&gt;
using a new local search to increase the quality of the solution. The proposed algorithm, the two&lt;br&gt;
standard versions of UACO&lt;/span&gt;&lt;span class=&quot;fontstyle0&quot; style=&quot;font-size:7pt;&quot;&gt;R &lt;/span&gt;&lt;span class=&quot;fontstyle0&quot;&gt;and the genetic algorithm are tested on the CEC05 benchmark&lt;br&gt;
functions, and then numerical results are reported. Furthermore, we apply these four algorithms&lt;br&gt;
to solve the utilization of complex multi-reservoir systems, the three-reservoir system of Karkheh&lt;br&gt;
dam, as a case study. The numerical results confirm the superiority of proposed algorithm over&lt;br&gt;
the three other algorithms.&lt;/span&gt;&lt;br style=&quot; font-style: normal; font-variant: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-align: -webkit-auto; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px; &quot; &gt;
&amp;nbsp;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Ant colony algorithm, Continuous optimization, Chaotic sequences, Multi-reservoir systems, Genetic algorithm.</keyword>
	<start_page>76</start_page>
	<end_page>92</end_page>
	<web_url>http://iors.ir/journal/browse.php?a_code=A-10-1422-19&amp;slc_lang=other&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Hamid Reza</first_name>
	<middle_name></middle_name>
	<last_name>Yousefzadeh</last_name>
	<suffix></suffix>
	<first_name_fa>Hamid Reza</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Yousefzadeh</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>usefzadeh.math@pnu.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Payame Noor University </affiliation>
	<affiliation_fa>Payame Noor University</affiliation_fa>
	 </author>


	<author>
	<first_name>Davood</first_name>
	<middle_name></middle_name>
	<last_name>Darvishi</last_name>
	<suffix></suffix>
	<first_name_fa>Davood</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Darvishi</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>d_darvishi@pnu.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Payame Noor University</affiliation>
	<affiliation_fa>Payame Noor University</affiliation_fa>
	 </author>


	<author>
	<first_name>Arezoo</first_name>
	<middle_name></middle_name>
	<last_name>Sayadi Salar</last_name>
	<suffix></suffix>
	<first_name_fa>Arezoo</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Sayadi Salar</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>sayadisalararezoo@yahoo.com</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Payame Noor University</affiliation>
	<affiliation_fa>Payame Noor University</affiliation_fa>
	 </author>


</author_list>


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