<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Journal title</title>
<title_fa>عنوان نشریه</title_fa>
<short_title>International Journal of Industrial Engineering &amp; Production Management</short_title>
<subject>Literature &amp; Humanities</subject>
<web_url>http://ijiepm.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></journal_id_issn>
<journal_id_issn_online></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>fa</language>
<pubdate>
	<type>jalali</type>
	<year>1390</year>
	<month>8</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2011</year>
	<month>11</month>
	<day>1</day>
</pubdate>
<volume>22</volume>
<number>3</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>fa</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem</title>
	<subject_fa>سایر موضوعاتی که به مرزهای دانش در مهندسی صنایع و تولید کمک می کند</subject_fa>
	<subject>Other related Industrial and production reserach subjects in which has direct relation to the state-of-the art of the IE</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p&gt; &lt;i&gt; Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this study, GRASP is used to solve the QAP problem. The resulting on QAP library standard problem is used to demonstrate the high performance of suggested algorithm &lt;/i&gt;&lt;i&gt;. &lt;/i&gt;&lt;/p&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Greedy Randomized Adaptive search producer, Quadratic Assignment Problem,Meta-heuristic</keyword>
	<start_page>243</start_page>
	<end_page>252</end_page>
	<web_url>http://ijiepm.iust.ac.ir/browse.php?a_code=A-10-625-3&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Behdin</first_name>
	<middle_name></middle_name>
	<last_name>VahediNori</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>180031947532846005276</code>
	<orcid>180031947532846005276</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Msc Student of Industrial Eng- Bu-Ali Sina University</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Mojahed</first_name>
	<middle_name></middle_name>
	<last_name>Kianpour</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>180031947532846005277</code>
	<orcid>180031947532846005277</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Msc Student of Industrial Eng- Bu-Ali Sina University</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>Parviz</first_name>
	<middle_name></middle_name>
	<last_name>Fattahi</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>fattahi@basu.ac.ir</email>
	<code>180031947532846005278</code>
	<orcid>180031947532846005278</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Associate professor of Industrial Eng-Bu-Ali Sina University</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


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