<?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>1400</year>
	<month>3</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2021</year>
	<month>6</month>
	<day>1</day>
</pubdate>
<volume>12</volume>
<number>1</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>A nonsmooth multi-objective model for hub location problem</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>&amp;nbsp;In this paper, we consider a multi-objective hub location problem (MOHLP) to locate two constrained&amp;nbsp;&amp;nbsp;&amp;nbsp; facilities in order to minimize the distance between these facilities and the weighted distance between each facility and related customers. For this purpose, we establish a necessary and sufficient condition of optimality for finding an efficient solution of the problem. We show that MOHLP can be reduced to a simple bi-level distance problem. Then we develop an efficient algorithm to find the optimal solution set of BDP,&amp;nbsp; and provide its convergence without any assumption. Moreover, an algorithm is proposed to solve MOHLP, which converges in a finite number of iterations. Some examples are stated to clarify the proposed algorithms.</abstract>
	<keyword_fa></keyword_fa>
	<keyword></keyword>
	<start_page>34</start_page>
	<end_page>48</end_page>
	<web_url>http://iors.ir/journal/browse.php?a_code=A-10-1422-38&amp;slc_lang=fa&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Ali</first_name>
	<middle_name></middle_name>
	<last_name>Ansari Ardali</last_name>
	<suffix></suffix>
	<first_name_fa>Ali</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Ansari Ardali</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>ali.ansariardali@sci.sku.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Shahrekord University</affiliation>
	<affiliation_fa>Shahrekord University</affiliation_fa>
	 </author>


	<author>
	<first_name>Ahmad Reza</first_name>
	<middle_name></middle_name>
	<last_name>Raeisi Dehkordi</last_name>
	<suffix></suffix>
	<first_name_fa>Ahmad Reza</first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa>Raeisi Dehkordi</last_name_fa>
	<suffix_fa></suffix_fa>
	<email>a.raisi@sci.ui.ac.ir</email>
	<code>1111111111</code>
	<orcid>1111111111</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Isfahan University</affiliation>
	<affiliation_fa>Isfahan University</affiliation_fa>
	 </author>


</author_list>


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