<?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>Semnan University</PublisherName>
				<JournalTitle>International Journal of Nonlinear Analysis and Applications</JournalTitle>
				<Issn>2008-6822</Issn>
				<Volume>12</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2021</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The semi-obnoxious minisum circle location problem with Euclidean norm</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>669</FirstPage>
			<LastPage>678</LastPage>
			<ELocationID EIdType="pii">4869</ELocationID>
			
<ELocationID EIdType="doi">10.22075/ijnaa.2021.4869</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mehraneh</FirstName>
					<LastName>Gholami</LastName>
<Affiliation>Faculty of Mathematical Sciences‎, ‎Shahrood University of Technology‎, ‎University Blvd.‎, ‎Shahrood‎, ‎Iran‎</Affiliation>

</Author>
<Author>
					<FirstName>Jafar</FirstName>
					<LastName>Fathali</LastName>
<Affiliation>Faculty of Mathematical Sciences‎, ‎Shahrood University of Technology‎, ‎University Blvd.‎, ‎Shahrood‎, ‎Iran‎</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2019</Year>
					<Month>04</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>‎The objective of the classical version of the minisum circle location problem is finding a circle $C$ in the plane such that the sum of the weighted distances from the circumference of $C$ to a set of given points is minimized‎, ‎where every point has a positive weight‎. ‎In this paper‎, ‎we investigate the semi-obnoxious case‎, ‎where every existing facility has either a positive or negative weight‎. ‎The distances are measured by the Euclidean norm‎. ‎Therefore‎, ‎the problem has a nonlinear objective function and global nonlinear optimization methods are required to solve this problem‎. ‎Some properties of the semi-obnoxious minisum circle location problem with Euclidean norm are discussed‎. ‎Then a cuckoo optimization algorithm is presented for finding the solution of this problem‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">‎Minisum circle location</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nonlinear programming</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Semi-obnoxious facility</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Cuckoo optimization algorithm‎</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijnaa.semnan.ac.ir/article_4869_f02c9c1079179111689a38c89feb9169.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
