<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>international journal of industrial Engineering &amp; Production Research</title>
<title_fa>نشریه بین المللی مهندسی صنایع و تحقیقات تولید</title_fa>
<short_title>IJIEPR</short_title>
<subject>Engineering &amp; Technology</subject>
<web_url>http://ijiepr.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>2008-4889</journal_id_issn>
<journal_id_issn_online>2345-363X</journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_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>1396</year>
	<month>12</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2018</year>
	<month>3</month>
	<day>1</day>
</pubdate>
<volume>29</volume>
<number>1</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>Random gravitational emulation search algorithm (RGES (in scheduling traveling salesman problem</title>
	<subject_fa>مدیریت عملیات</subject_fa>
	<subject>Operations Managment </subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES&lt;span dir=&quot;RTL&quot;&gt; (&lt;/span&gt;is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is compared with genetic algorithm and experimental results show that the proposed algorithm has better performance and less runtime to be answered.</abstract>
	<keyword_fa></keyword_fa>
	<keyword>gravitational emulation search, force of gravity, traveling salesman problem</keyword>
	<start_page>103</start_page>
	<end_page>112</end_page>
	<web_url>http://ijiepr.iust.ac.ir/browse.php?a_code=A-10-1104-2&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Ahmad</first_name>
	<middle_name></middle_name>
	<last_name>Sheibat Alhamdi</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>andishesaaz@gmail.com</email>
	<code>180031947532846005472</code>
	<orcid>180031947532846005472</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>correspond</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Alireza</first_name>
	<middle_name></middle_name>
	<last_name>Hosseinzadeh Kashani</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>hk.alireza@gmail.com</email>
	<code>180031947532846005473</code>
	<orcid>180031947532846005473</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Azad University of Tehran(North-Tehran)</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


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