 <?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Kharazmi University</PublisherName>
				<JournalTitle>International Journal of Supply and Operations Management</JournalTitle>
				<Issn>2383-1359</Issn>
				<Volume>5</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2018</Year>
					<Month>08</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An Exploration of Evolutionary Algorithms for a Bi-objective Competitive Facility Location Problem in Congested Systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>266</FirstPage>
			<LastPage>282</LastPage>
			<ELocationID EIdType="pii">2765</ELocationID>
			
<ELocationID EIdType="doi">10.22034/2018.3.6</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Naeme</FirstName>
					<LastName>Zarrinpoor</LastName>
<Affiliation>Department of Industrial Engineering, Shiraz University of Technology, Shiraz, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>08</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents a bi-objective competitive facility location model for congested systems in which entering facilities will compete with the competitors’ facilities for capturing the market share. In the proposed model, customers can chose which facility to patronize based on the gravity function that depends on both the quality of service provider and the travel time to facilities. The proposed model attempts to simultaneously maximize the captured demand by each facility and minimize the total waiting times at the system. To solve the model, two multi-objective evolutionary algorithms, involving a multi-objective harmony search algorithm (MOHS) and a non-dominated sorting genetic algorithm-II (NSGA-II), are proposed. The performance of solution procedures are compared in terms of different performance metrics including generational distance, spacing metric, diversification metric, and number of non-dominated solution. Computational results based on different problem sizes show that in general MOHS outperforms NSGA-II.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Competitive facility location</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Congested system</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Gravity function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Multi-objective harmony search</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">NSGA- II</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">http://www.ijsom.com/article_2765_4c8acc9eef355e7cbf0f6b2114e036c4.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
