<?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>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>10</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>07</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Novel Schemes for Approximate Solutions of Optimal Control Problems via a Hybrid Evolutionary and Clustering Algorithm</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>255</FirstPage>
			<LastPage>271</LastPage>
			<ELocationID EIdType="pii">12135</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2025.74474.1306</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Maria</FirstName>
					<LastName>Afsharirad</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎University of Science and Technology of Mazandaran‎, ‎Behshahr‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>02</Month>
					<Day>03</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents a hybrid scheme for solving optimal control problems‎. ‎Discretizing the time interval and assuming a constant control value on each sub-interval transforms the optimal control problem into an assignment problem‎. ‎To cluster feasible solutions, a novel method is proposed in this paper, which applies metaheuristic algorithms—specifically, genetic algorithms and particle swarm optimization—to generate a large number of solutions. ‎Subsequently‎, ‎the K-means clustering method is employed to classify these solutions into clusters‎. ‎Enhancing the median of each cluster‎, ‎using metaheuristic techniques, ultimately results in improved medians‎. ‎The best median from the final iteration of the algorithm serves as an acceptable solution for the optimal control problem‎. ‎In some cases‎, ‎it even succeeds in discovering a new best solution‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Clustering‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎K-Means algorithm‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Optimal control problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Genetic algorithm‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎ ‎Particle swarm optimization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_12135_f89438d4aa9f148c036227966e9ae128.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
