<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>International Journal of Applied Operational Research</title>
<title_fa>ژورنال بین المللی پژوهش عملیاتی</title_fa>
<short_title>International Journal of Applied Operational Research - An Open Access Journal</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijorlu.lahijan.iau.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>2251-6867</journal_id_issn>
<journal_id_issn_online>2251-9432</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>7</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1391</year>
	<month>3</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2012</year>
	<month>6</month>
	<day>1</day>
</pubdate>
<volume>2</volume>
<number>2</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 Memtic genetic algorithm for a redundancy allocation problem</title>
	<subject_fa>تخصصي</subject_fa>
	<subject>Special</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research</content_type>
	<abstract_fa></abstract_fa>
	<abstract>Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is
predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with
mixing components (RAPMC) in which the redundancy strategy can be chosen for individual
subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy
strategies for subsystems are considered as a variable of the problem. As the problem belongs to the
NP-hard class problems, we will present a new approach for the non-dominated sorting genetic
algorithm (NSGAII) and Memtic algorithm (MA) with each one to solve the multi-objective model.


Keywords: Redundancy Allocation Problems, Series-Parallel Problems, Redundancy Strategies, Non
Dominated Sorting Genetic Algorithms (NSGAII), Memtic Algorithms.</abstract>
	<keyword_fa></keyword_fa>
	<keyword></keyword>
	<start_page>0</start_page>
	<end_page>0</end_page>
	<web_url>http://ijorlu.lahijan.iau.ir/browse.php?a_code=A-10-1-27&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>M.</first_name>
	<middle_name></middle_name>
	<last_name>EbrahimNezhad Moghadam Rashti</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>M.Ebrahimnazhad@gmail.com</email>
	<code>100319475328460095</code>
	<orcid>100319475328460095</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>B. M.</first_name>
	<middle_name></middle_name>
	<last_name>Vishkaei</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>100319475328460096</code>
	<orcid>100319475328460096</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>R.</first_name>
	<middle_name></middle_name>
	<last_name>Esmaeilpour</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>100319475328460097</code>
	<orcid>100319475328460097</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


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