<?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>University of Isfahan</PublisherName>
				<JournalTitle>Computational Intelligence in Electrical Engineering</JournalTitle>
				<Issn>2821-0689</Issn>
				<Volume>7</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2016</Year>
					<Month>05</Month>
					<Day>21</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Real-Coded Genetic Algorithm with Smart Mutation for Solving Nonconvex Economic Dispatch Problems</ArticleTitle>
<VernacularTitle>Real-Coded Genetic Algorithm with Smart Mutation for Solving Nonconvex Economic Dispatch Problems</VernacularTitle>
			<FirstPage>13</FirstPage>
			<LastPage>22</LastPage>
			<ELocationID EIdType="pii">20712</ELocationID>
			
<ELocationID EIdType="doi">10.22108/isee.2016.20712</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Naser</FirstName>
					<LastName>Ghorbani</LastName>
<Affiliation>University of Tabriz</Affiliation>

</Author>
<Author>
					<FirstName>Ebrahim</FirstName>
					<LastName>Babaei</LastName>
<Affiliation>University of Tabriz</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2016</Year>
					<Month>11</Month>
					<Day>23</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, real-coded genetic algorithm with smart mutation (RCGA-SM) is proposed to solve the economic dispatch (ED) problem. In the proposed method, the required controlling process is accomplished on the total amount of chromosomes and consequently there is no need to use penalty cost function for controlling sum of variables in solving economic dispatch problem. This method will begin to explore the optimal answer just within the logic and acceptable zone in addition to its capability in reducing the search range. In order to show the performance and the efficiency of the proposed method, the ED problem considering several constraints is solved in 6, 15, and 40 units systems through the proposed technique. The proposed coding could effectively escapes from infeasible solutions. Thereby search efficiency and solution quality are dramatically improved. The obtained results are compared with other advanced technical algorithms, which well depicts the superiority of the RCGA-SM technique over the others compared methods.</Abstract>
			<OtherAbstract Language="FA">In this paper, real-coded genetic algorithm with smart mutation (RCGA-SM) is proposed to solve the economic dispatch (ED) problem. In the proposed method, the required controlling process is accomplished on the total amount of chromosomes and consequently there is no need to use penalty cost function for controlling sum of variables in solving economic dispatch problem. This method will begin to explore the optimal answer just within the logic and acceptable zone in addition to its capability in reducing the search range. In order to show the performance and the efficiency of the proposed method, the ED problem considering several constraints is solved in 6, 15, and 40 units systems through the proposed technique. The proposed coding could effectively escapes from infeasible solutions. Thereby search efficiency and solution quality are dramatically improved. The obtained results are compared with other advanced technical algorithms, which well depicts the superiority of the RCGA-SM technique over the others compared methods.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Economic Dispatch</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nonconvex optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">penalty function</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">smart mutation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://isee.ui.ac.ir/article_20712_f9aa9547faa844ce6b62061122619350.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
