<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>International Journal of Civil Engineering</title>
<title_fa>مجله بین المللی مهندسی عمران</title_fa>
<short_title>IJCE</short_title>
<subject>Engineering &amp; Technology</subject>
<web_url>http://ijce.iust.ac.ir</web_url>
<journal_hbi_system_id>18</journal_hbi_system_id>
<journal_hbi_system_user>agent2</journal_hbi_system_user>
<journal_id_issn>1735-0522</journal_id_issn>
<journal_id_issn_online>2283-3874</journal_id_issn_online>
<journal_id_pii></journal_id_pii>
<journal_id_doi></journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid></journal_id_sid>
<journal_id_nlai></journal_id_nlai>
<journal_id_science></journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1386</year>
	<month>12</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2008</year>
	<month>3</month>
	<day>1</day>
</pubdate>
<volume>6</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Cyclic storage design and operation optimization hybrid GA decomposition approach</title>
	<subject_fa></subject_fa>
	<subject></subject>
	<content_type_fa>Research Paper</content_type_fa>
	<content_type>Research Paper</content_type>
	<abstract_fa></abstract_fa>
	<abstract>In a large scale cyclic storage system ,as the number of rule parameters and/or number of operating
period increase, general purpose gradient-based NLP solvers and/or genetic algorithms may loose their
merits in finding optimally feasible solution to the problem. In these cases hybrid GA which decomposes the
main problem into two manageable sub-problems with an iterative scheme between GA and LP solvers may
be considered as a sound alternative This research develops a hybrid GA-LP algorithm to optimally design
and operate a nonlinear, non-convex, and large scale lumped cyclic storage system. For optimal operation of
the system a set of operating rules are derived for joint utilization of surface and groundwater storage
capacities to meet a predefined demand with minimal construction and operation cost over a 20 seasonal
planning period. Performance of the proposed model is compared with a non-cyclic storage system. The
management model minimizes the present value of the design and operation cost of the cyclic and non-cyclic
systems under specified and governing constraints, employing the developed GA-LP hybrid model. Results
show that cyclic storage dominates non-cyclic storage system both in cost and operation flexibility.</abstract>
	<keyword_fa></keyword_fa>
	<keyword>conjunctive use, cyclic storage, hybrid GA, decomposition method</keyword>
	<start_page>34</start_page>
	<end_page>47</end_page>
	<web_url>http://ijce.iust.ac.ir/browse.php?a_code=A-10-393-33&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>Abbas</first_name>
	<middle_name></middle_name>
	<last_name>Afshar</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>a_afshar@iust.ac.ir</email>
	<code>180031947532846005999</code>
	<orcid>180031947532846005999</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>S. Ali</first_name>
	<middle_name></middle_name>
	<last_name>Zahraei</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>180031947532846006000</code>
	<orcid>180031947532846006000</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>M. A. </first_name>
	<middle_name></middle_name>
	<last_name>Marino</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>180031947532846006001</code>
	<orcid>180031947532846006001</orcid>
	<coreauthor>No</coreauthor>
	<affiliation></affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
