<?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>17</Volume>
				<Issue>5</Issue>
				<PubDate PubStatus="epublish">
					<Year>2010</Year>
					<Month>10</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Tuned Genetic Algorithms for Finding p-Medians of a Weighted Graph</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">3161</ELocationID>
			
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>A.</FirstName>
					<LastName>Kaveh</LastName>
<Affiliation>Department of Civil Engineering,Iran University of Science and Technology</Affiliation>

</Author>
<Author>
					<FirstName>M.</FirstName>
					<LastName>Shahrouzi</LastName>
<Affiliation>Department of Engineering,Building and Housing Research Center</Affiliation>

</Author>
<Author>
					<FirstName>Y.</FirstName>
					<LastName>Naserifar</LastName>
<Affiliation>Department of Engineering,Building and Housing Research Center</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2010</Year>
					<Month>11</Month>
					<Day>03</Day>
				</PubDate>
			</History>
		<Abstract>There are various engineering applications dealing with the prototype problem of nding the
best p-medians in a weighted graph. However, the heuristic developments are still of concern due to their
complexity. This paper utilizes genetic algorithm as a well-known reliable evolutionary search for such
a purpose. Problem formulation is studied, introducing a characteristic graph and specialized genotype
representation called Direct Index Coding&quot;. The genetic operators are also modied due to problem
requirements, and further tuned using a simulated annealing approach. Such an enhanced evolutionary
search tool is then applied to a number of examples to show its eectiveness regarding the exact results,
and to compare eciency between tuned and non-tuned GA.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Genetic Algorithm</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">p-median problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Direct index coding</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Simulated annealing</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Parameter tuning</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_3161_a04addf63e919f496fa149412d46377e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
