<?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>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>27</Volume>
				<Issue>5</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>10</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Influence of Two Different Producers in a Competitive Location Problem</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>2539</FirstPage>
			<LastPage>2554</LastPage>
			<ELocationID EIdType="pii">21233</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2019.50310.1626</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>B.</FirstName>
					<LastName>Yousefi Yegane</LastName>
<Affiliation>Department of Industrial Engineering, Faculty of engineering, University of Kurdistan, Sanandaj, Iran</Affiliation>

</Author>
<Author>
					<FirstName>I.</FirstName>
					<LastName>Nakhai Kamalabadi</LastName>
<Affiliation>Department of Industrial Engineering, Faculty of engineering, University of Kurdistan, Sanandaj, Iran</Affiliation>

</Author>
<Author>
					<FirstName>H.</FirstName>
					<LastName>Farughi</LastName>
<Affiliation>Department of Industrial Engineering, Faculty of engineering, University of Kurdistan, Sanandaj, Iran</Affiliation>
<Identifier Source="ORCID">0000-0001-9745-9691</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2018</Year>
					<Month>01</Month>
					<Day>27</Day>
				</PubDate>
			</History>
		<Abstract>Facility location of two producers with preference of customers is discussed in this paper. Because of differences between two producers in terms of their influence on the market, the problem is formulated as a bi-level integer mathematical programming model with binary variables. It is considered that both leader and follower have some facilities at first and are going to open new facilities and this may lead to make changes in allocation of facilities and customers. To solve the problem, two metaheuristics algorithm based on genetic algorithm (GA) and hybrid of genetic algorithm and ant colony optimization (ACO) are proposed. In the first section of each algorithm, the location of facilities for two producers is determined and in the second section, each customer selects a facility. Upper bound of the competitive facility location problem is determined by solving the upper-level problem as an integer linear programming model without considering the follower’s decision. To evaluate the efficiency of proposed algorithms, enumeration technique is used to find optimal solution. Computational results show that all of the developed algorithms are capable of achieving optimal solution for small size problems and high-quality solution in reasonable computational time for medium and large-scale problems.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Bilevel programming</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">competitive facility location</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ant colony optimization algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_21233_55c6017b10a9755ef3681b09ccb01e94.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
