<?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>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Fuzzy Sliding Mode Control for Nonlinear Leader-Follower Multi-Agent Systems</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>1</FirstPage>
			<LastPage>34</LastPage>
			<ELocationID EIdType="pii">9920</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.64817.1209</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Negar</FirstName>
					<LastName>Izadi</LastName>
<Affiliation>Department of Mathematics‎, ‎Faculty of Sciences‎, ‎University of Zanjan‎, P.O. Box 45371-38791, Zanjan, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Taghi</FirstName>
					<LastName>Dastjerdi</LastName>
<Affiliation>Department of Mathematics‎, ‎Faculty of Sciences‎, ‎University of Zanjan‎, P.O. Box 45371-38791, Zanjan, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>07</Month>
					<Day>17</Day>
				</PubDate>
			</History>
		<Abstract>In this paper‎, ‎we present a new approach for achieving leader-follower consensus in a network of nonlinear dynamic agents with an undirected graph topology‎, ‎using a fuzzy sliding mode controller (FSMC) for Multi-Agent Systems (MASs)‎. ‎Our proposed sliding mode controller is based on a separating hyperplane that effectively addresses the consensus problem in MASs‎. ‎Additionally‎, ‎we design a fuzzy controller to eliminate the chattering phenomenon‎. ‎According to the communication graph topology and the Lyapunov stability condition‎, ‎the proposed FSMC satisfies the consensus condition‎. ‎One significant advantage of our approach is that the system states converge to the sliding surface quickly and remain on the surface‎, ‎thereby ensuring better tracking performance‎. ‎We validate the effectiveness of our proposed approach through simulation results‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Consensus‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Fuzzy controller‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Multi-agent system‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Sliding mode control</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_9920_68265e771ccc6d462f4cb2820b883299.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Dynamical Behaviour of Fractional Order ‎‎SEIR‎ ‎Mathematical Model for Infectious Disease Transmission</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>35</FirstPage>
			<LastPage>48</LastPage>
			<ELocationID EIdType="pii">10189</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.64849.1210</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Akbari</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU), Tehran‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Leader</FirstName>
					<LastName>Navaei</LastName>
<Affiliation>Department of Statistics, Payame Noor University (PNU), Tehran, Iran,</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Shahriari</LastName>
<Affiliation>Department of  Mathematics‎, ‎Maragheh University‎, ‎Maragheh‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>07</Month>
					<Day>22</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents an extension of the SEIR mathematical model for infectious disease‎ ‎transmission to a fractional-order model‎. ‎The model is formulated using the Caputo derivative of order α ∈ (0, 1]‎. ‎We study the stability of equilibrium points‎, ‎including the disease-free equilibrium $(E_{f})$‎, ‎and the‎ ‎infected steady-state equilibrium $(E_{e})$ using the‎ ‎stability theorem of Fractional Differential Equations‎. ‎The model is also analyzed under certain conditions‎, ‎and‎ ‎it is shown that the disease-free equilibrium is locally asymptotically‎ ‎stable‎. ‎Additionally‎, ‎the extended Barbalat’s lemma is applied to the‎ ‎fractional-order system‎, ‎and a suitable Lyapunov functional is constructed‎ ‎to demonstrate the global asymptotic stability of the infected‎ ‎steady-state equilibrium‎. ‎To validate the theoretical results‎, ‎a numerical simulation of the problem is conducted‎.&lt;br /&gt; </Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Fractional calculus‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Caputo derivatives‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎SEIR ‎model‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Lyapunov function‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Stability</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10189_6a7211b03c96a361b1c1edaa6a41d94b.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Efficient Solution of Nonlinear Unconstraint Optimization Problems using Quasi-Newton's Method‎: ‎A Revised Approach</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>49</FirstPage>
			<LastPage>65</LastPage>
			<ELocationID EIdType="pii">10288</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.64138.1204</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hajar</FirstName>
					<LastName>Alimorad</LastName>
<Affiliation>Department of Mathematics,
Jahrom University, Jahrom, P.O. Box 74135-111, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>05</Month>
					<Day>21</Day>
				</PubDate>
			</History>
		<Abstract>While many real-world optimization problems typically involve multiple constraints, unconstrained problems hold practical and fundamental significance. They can arise directly in specific applications or as transformed versions of constrained optimization problems.‎ ‎Newton&#039;s method‎, ‎a notable numerical technique within the category of line search algorithms, is widely used for function optimization‎. The search direction and step length play crucial roles in this algorithm. ‎This paper introduces an algorithm aimed at enhancing the step length within the Broyden quasi-Newton process‎. ‎Additionally‎, ‎numerical examples are provided to compare the effectiveness of this new method with another approach‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Hessian matrix‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Quasi-Newton method‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Constrained and unconstrained problems</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10288_e5163b25fa0128cdeb957eecb272f9db.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Hesitant Fuzzy Equation</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>67</FirstPage>
			<LastPage>79</LastPage>
			<ELocationID EIdType="pii">10360</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.68208.1240</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Fatemeh</FirstName>
					<LastName>Babakordi</LastName>
<Affiliation>Department of Mathematics‎, ‎Faculty of Science‎, ‎Gonbad Kavous University‎, ‎Gonbad Kavous‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>Nemat Allah</FirstName>
					<LastName>‎Taghi-Nezhad</LastName>
<Affiliation>Department of Mathematics‎, ‎Faculty of Science‎, ‎Gonbad Kavous University‎, ‎Gonbad Kavous‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>06</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>This paper presents the introduction of two novel equation types: the partial hesitant fuzzy equation and the half hesitant fuzzy equation‎. Additionally, ‎ an efficient method is proposed to solve these equations by defining four solution categories: Controllable‎, ‎Tolerable Solution Set (TSS)‎, Controllable ‎Solution Set (CSS)‎, ‎and Algebraic Solution Set (ASS)‎. ‎ Furthermore, ‎ the paper establishes eight theorems that explore different types of solutions and lay out the conditions for the existence and non-existence of hesitant fuzzy solutions‎. ‎ The practicality of the proposed method is demonstrated through numerical examples.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Categories of hesitant fuzzy equations‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Partial hesitant fuzzy equation‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Half hesitant fuzzy equation‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Algebraic solution set</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10360_40062fefd890ab189664babdc44e862c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Big Data Analytics and Data Mining Optimization Techniques for Air Traffic Management</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>81</FirstPage>
			<LastPage>96</LastPage>
			<ELocationID EIdType="pii">10476</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.66151.1222</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Abbas Ali</FirstName>
					<LastName>Rezaee</LastName>
<Affiliation>Department of Computer Engineering and Information Technology‎, ‎Payame Noor University‎, ‎Tehran‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Hadis</FirstName>
					<LastName>Ahmadian Yazdi</LastName>
<Affiliation>Department of Computer Engineering‎, ‎Neyshabur Branch‎, ‎Islamic Azad University‎, ‎Neyshabur‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Mahdi</FirstName>
					<LastName>Yousefzadeh Aghdam</LastName>
<Affiliation>Department of Computer Engineering‎, ‎Mashhad Branch‎, ‎Islamic Azad University‎, ‎Mashhad‎, ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Sahar</FirstName>
					<LastName>Ghareii</LastName>
<Affiliation>Aviation Engineer‎, ‎Mashhad Airport‎, ‎Mashhad‎, ‎Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>12</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>With the advancements in science and technology‎, ‎the industrial and aviation sectors have witnessed a significant increase in data‎. ‎A vast amount of data is generated and utilized continuously‎. ‎It is imperative to employ data mining techniques to extract and uncover knowledge from this data‎. ‎Data mining is a method that enables the extraction of valuable information and hidden relationships from datasets‎. ‎However‎, ‎the current aviation data presents challenges in effectively extracting knowledge due to its large volume and diverse structures‎. ‎Air Traffic Management (ATM) involves handling Big data‎, ‎which exceeds the capacity of conventional acquisition‎, ‎matching‎, ‎management‎, ‎and processing within a reasonable timeframe‎. ‎Aviation Big data exists in batch forms and streaming formats‎, ‎necessitating the utilization of parallel hardware and software‎, ‎as well as stream processing‎, ‎to extract meaningful insights‎. ‎Currently‎, ‎the map-reduce method is the prevailing model for processing Big data in the aviation industry‎. ‎This paper aims to analyze the evolving trends in aviation Big data processing methods‎, ‎followed by a comprehensive investigation and discussion of data analysis techniques‎. ‎We implement the map-reduce optimization of the K-Means algorithm in the Hadoop and Spark environments‎. ‎The K-Means map-reduce is a crucial and widely applied clustering method‎. ‎Finally‎, ‎we conduct a case study to analyze and compare aviation Big data related to air traffic management in the USA using the K-Means map-reduce approach in the Hadoop and Spark environments‎. ‎The analyzed dataset includes flight records‎. ‎The results demonstrate the suitability of this platform for aviation Big data‎, ‎considering the characteristics of the aviation dataset‎. ‎Furthermore‎, ‎this study presents the first application of the designed program for air traffic management‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Data mining‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Air traffic management‎</Param>
			</Object>
			<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">‎Hadoop platform‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Spark platform optimization</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10476_d70494acda1717ef52028b37c523117c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimizing Supply Chain Design for Sustainability and Reliability‎: ‎A Comparative Study of Augmented Epsilon‎‎‎ and Normalized Normal Constraint Methods</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>97</FirstPage>
			<LastPage>130</LastPage>
			<ELocationID EIdType="pii">10361</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.67540.1230</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Sajad</FirstName>
					<LastName>Amirian</LastName>
<Affiliation>‎Department of Industrial Management‎, ‎Faculty of Management and Accounting‎, ‎Allameh Tabataba’i University‎, ‎Tehran‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Maghsoud</FirstName>
					<LastName>Amiri</LastName>
<Affiliation>‎Department of Industrial Management‎, ‎Faculty of Management and Accounting‎, ‎Allameh Tabataba’i University‎, ‎Tehran‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Mohammad Taghi</FirstName>
					<LastName>Taghavifard</LastName>
<Affiliation>‎Department of Industrial Management‎, ‎Faculty of Management and Accounting‎, ‎Allameh Tabataba’i University‎, ‎Tehran‎, ‎Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>04</Month>
					<Day>08</Day>
				</PubDate>
			</History>
		<Abstract>Integrating sustainability and reliability represents a synergistic approach that can be explored through the problem of a closed-loop supply chain network design (SCND)‎. ‎This study is conducted in three stages‎: ‎mathematical modeling‎, ‎model solution using exact methods‎, ‎and evaluation of the solution methods‎. ‎In the first stage‎, ‎a mixed-integer linear programming (MILP) model is developed in a multi-objective‎, ‎multi-product‎, ‎and multi-period framework‎. ‎The objectives of the proposed model aim to maximize profitability‎, ‎social responsibility‎, ‎and reliability‎. ‎In the second stage‎, ‎two methods‎, ‎namely Augmented ‎$\varepsilon‎‎$‎-Constraint (AEC) and Normalized Normal Constraint (NNC)‎, ‎are implemented in the GAMS software to solve the model and identify the optimal Pareto solutions‎. ‎In the third stage‎, ‎the Shannon Entropy technique is employed to determine the criteria weights‎, ‎and the VIKOR technique is utilized to select the superior solution method‎. ‎The overall performance accuracy of the proposed model is measured using four samples from a numerical example with randomly generated data based on the objective function coefficients‎. ‎The results indicate the presence of a conflict among the three objective functions‎. ‎Consequently‎, ‎decision-makers should consider sacrificing some profitability to enhance environmental protection and improve reliability‎. ‎In terms of three criteria‎, ‎run time‎, ‎diversification metric‎, ‎and general distance‎, ‎the NNC method is given priority over the AEC method‎. ‎Even when the criteria are given equal weight‎, ‎the superiority of the NNC method remains unchanged‎. ‎The application of the proposed model across different industries represents a significant research direction for future research‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Supply chain network design (SCND)‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Sustainability‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Reliability‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Augmented ε-constraint (AEC)‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Normalized normal constraint (NNC)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10361_6699ac23162a62a1b4664a1940bd571c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An Efficient Variable Neighborhood Search for Solving Multi-Criteria Project Portfolio Selection</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>131</FirstPage>
			<LastPage>147</LastPage>
			<ELocationID EIdType="pii">9818</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.65380.1213</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ali Akbar</FirstName>
					<LastName>Sohrabi</LastName>
<Affiliation>Faculty of Mathematical Sciences‎, ‎Department of Applied Mathematics, Ferdowsi University of Mashhad‎, ‎Mashhad‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Ghanbari</LastName>
<Affiliation>Faculty of Mathematical Sciences‎, ‎Department of Applied Mathematics, Ferdowsi University of Mashhad‎, ‎Mashhad‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Khatere</FirstName>
					<LastName>Ghorbani-Moghadam</LastName>
<Affiliation>Mosaheb Institute of Mathematics‎, ‎Kharazmi University‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>09</Month>
					<Day>06</Day>
				</PubDate>
			</History>
		<Abstract>Project portfolio selection is a critical challenge for many organizations as they often face budget constraints that limit their ability to support all available projects‎. ‎To address this issue‎, ‎organizations seek to select a feasible subset of projects that maximizes utility‎. ‎While several models for project portfolio selection based on multiple criteria have been proposed‎, ‎they are typically NP-hard problems‎. ‎In this study‎, ‎we propose an efficient Variable Neighborhood Search (VNS) algorithm to solve these problems‎. ‎Our algorithm includes a formula for computing the difference value of the objective function‎, ‎which enhances its accuracy and ensures that selected projects meet desired criteria‎. ‎We demonstrate the effectiveness of our algorithm through rigorous testing and comparison with a genetic algorithm (GA) and CPLEX‎. ‎The results of the Wilcoxon non-parametric test confirm that our algorithm outperforms both GA and CPLEX in terms of speed and accuracy‎. ‎Moreover‎, ‎the variance of the relative error of our algorithm is less than that of GA‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Project portfolio selection‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Project interaction‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Multi-criteria‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Meta-heuristic algorithms</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_9818_207d25dd9030d48d15eea9e04b896d54.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Solving Fractional Optimal Control-Affine Problems via Fractional-Order Hybrid Jacobi Functions</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>149</FirstPage>
			<LastPage>168</LastPage>
			<ELocationID EIdType="pii">10414</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.68826.1243</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Zeinab</FirstName>
					<LastName>Barary</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎Faculty of Mathematical Sciences‎, ‎University of Mazandaran‎, ‎Babolsar‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>AllahBakhsh</FirstName>
					<LastName>Yazdani Cherati</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎Faculty of Mathematical Sciences‎, ‎University of Mazandaran‎, ‎Babolsar‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>Somayeh</FirstName>
					<LastName>Nemati</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎Faculty of Mathematical Sciences‎, ‎University of Mazandaran‎, ‎Babolsar‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>08</Month>
					<Day>14</Day>
				</PubDate>
			</History>
		<Abstract>This paper proposes and analyzes an applicable approach for numerically computing the solution of fractional optimal control-affine problems. The fractional derivative in the problem is considered in the sense of Caputo. The approach is based on a fractional-order hybrid of block-pulse functions and Jacobi polynomials. ‎First‎, ‎the corresponding Riemann-Liouville fractional integral operator of the introduced basis functions is calculated‎. ‎ Then, an approximation of the fractional derivative of the unknown state function is obtained by considering an approximation in terms of these basis functions‎. ‎ Next, ‎using the dynamical system and applying the fractional integral operator‎, ‎an approximation of the unknown control function is obtained based on the given approximations of the state function and its derivatives‎. ‎ Subsequently‎, ‎all the given approximations are substituted into the performance index‎. ‎Finally‎, ‎the optimality conditions transform the problem into a system of algebraic equations‎. ‎An error upper bound of the approximation of a function based on the fractional hybrid functions is provided‎. ‎The method is applied to several numerical examples‎, and ‎the experimental results confirm the efficiency and capability of the method.  Furthermore, they demonstrate a good agreement between the approximate and exact solutions‎. ‎</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Fractional optimal control-affine problems‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Fractional-order hybrid functions‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Caputo derivative‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Riemann-Liouville integral</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10414_9a4bfbfec2d71c4afaebbbc6b8542d09.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Solving Linear Fractional Programming Problems in Uncertain Environments‎: ‎A Novel Approach with Grey Parameters</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>169</FirstPage>
			<LastPage>183</LastPage>
			<ELocationID EIdType="pii">10592</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.67881.1235</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Farid</FirstName>
					<LastName>Pourofoghi</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU)‎, P.O‎. ‎Box 19395-4697‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>Davood</FirstName>
					<LastName>Darvishi Salokolaei</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU)‎, P.O‎. ‎Box19395-4697‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>05</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>Fractional programming is a significant nonlinear planning tool within operation research‎. ‎It finds applications in diverse domains such as resource allocation‎, ‎transportation‎, ‎production programming‎, ‎performance evaluation‎, ‎and finance‎. ‎In practical scenarios‎, ‎uncertainties often make it challenging to determine precise coefficients for mathematical models‎. ‎Consequently‎, ‎utilizing indefinite coefficients instead of definite ones is recommended in such cases‎. ‎Grey systems theory‎, ‎along with probability theory‎, ‎randomness‎, ‎fuzzy logic‎, ‎and rough sets‎, ‎is an approach that addresses uncertainty‎. ‎In this study‎, ‎we address the problem of linear fractional programming with grey coefficients in the objective function‎. ‎To tackle this problem‎, ‎a novel approach based on the variable change technique proposed by Charnes and Cooper‎, ‎along with the convex combination of intervals‎, ‎is employed‎. ‎The article presents an algorithm that determines the solution to the grey fractional programming problem using grey numbers‎, ‎thus capturing the uncertainty inherent in the objective function‎. ‎To demonstrate the effectiveness of the proposed method‎, ‎an example is solved using the suggested approach‎. ‎The result is compared with solutions obtained using the whitening method‎, ‎employing Hu and Wong&#039;s technique and the Center and Greyness Degree Ranking method‎. ‎The comparison confirms the superiority of the proposed method over the whitening method‎, ‎thus suggesting adopting the grey system approach in such situations‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Uncertainty‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Optimization‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Fractional programming‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Grey system‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Grey interval numbers</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10592_3d258d58e119e85194adc03f0522a3d3.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Hybrid Floyd-Warshall and Graph Coloring Algorithm for Finding the Smallest Number of Colors Needed for a Distance Coloring of Graphs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>185</FirstPage>
			<LastPage>194</LastPage>
			<ELocationID EIdType="pii">10626</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.68880.1244</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Hanifa</FirstName>
					<LastName>Mosawi</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎Faculty of Mathematical Sciences,‎ ‎Ferdowsi University of Mashhad,‎ ‎P.O‎. ‎Box 1159‎, ‎Mashhad 91775‎, ‎Iran.</Affiliation>
<Identifier Source="ORCID">0000-0001-8960-588X</Identifier>

</Author>
<Author>
					<FirstName>Mostafa</FirstName>
					<LastName>Tavakolli</LastName>
<Affiliation>Department of Applied Mathematics‎, ‎Faculty of Mathematical Sciences,‎ ‎Ferdowsi University of Mashhad,‎ ‎P.O‎. ‎Box 1159‎, ‎Mashhad 91775‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Khatere</FirstName>
					<LastName>Ghorbani-Moghadam</LastName>
<Affiliation>Mosaheb Institute of Mathematics‎, ‎Kharazmi University‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>08</Month>
					<Day>26</Day>
				</PubDate>
			</History>
		<Abstract>Graph coloring is a crucial area of research in graph theory, with numerous algorithms proposed for various types of graph coloring, particularly graph p-distance coloring‎. In this study, we employ a recently introduced graph coloring algorithm to develop a hybrid algorithm approximating the chromatic number ‎p-distance, where $p$ represents a positive integer number. We apply our algorithm to molecular graphs as practical applications of our findings.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">p-distance coloring‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎p-distance chromatic number‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Graph adjacency matrix‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Hybrid algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10626_1d3b0b6b1881cfc48c06bf561ecafcc0.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Mathematical Modeling and Optimal Control of Carbon Dioxide Emissions</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>195</FirstPage>
			<LastPage>202</LastPage>
			<ELocationID EIdType="pii">10443</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.67777.1233</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Fahimeh</FirstName>
					<LastName>Akhavan Ghassabzade</LastName>
<Affiliation>Department of Mathematics‎, ‎Faculty of Sciences‎, ‎University of Gonabad‎, ‎Gonabad‎, ‎Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Mina</FirstName>
					<LastName>Bagherpoorfard</LastName>
<Affiliation>Department of Mathematics, Fasa Branch, Islamic Azad university, Fasa, Iran.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>05</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>‎This paper aims to demonstrate the flexibility of mathematical models in analyzing carbon dioxide emissions and account for memory effects. ‎The use of real data amplifies the importance of this study‎. ‎This research focuses on developing a mathematical model utilizing fractional-order differential equations to represent carbon dioxide emissions stemming from the energy sector. By comparing simulation results with real-world data, it is determined that the fractional model exhibits superior accuracy when contrasted with the classical model‎. ‎Additionally‎, ‎an optimal control strategy is proposed to minimize the levels of carbon dioxide, CO2, and associated implementation costs‎. ‎The fractional optimal control problem is addressed through the utilization of an iterative algorithm‎, ‎ and the effectiveness of the model is verified by presenting comparative results.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">{Fractional‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Mathematical model‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Optimal control‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Carbon dioxide</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10443_0d3845bc98097debd6059e66539f8c18.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Payame Noor University (PNU)</PublisherName>
				<JournalTitle>Control and Optimization in Applied Mathematics</JournalTitle>
				<Issn>2383-3130</Issn>
				<Volume>9</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimality Conditions for Properly Efficient Solutions of Nonsmooth Multiobjective GSIP</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>203</FirstPage>
			<LastPage>219</LastPage>
			<ELocationID EIdType="pii">10567</ELocationID>
			
<ELocationID EIdType="doi">10.30473/coam.2023.67823.1234</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ali Asghar</FirstName>
					<LastName>Hojatifard</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU)‎,‎ P.O‎. ‎Box 19395-4697‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>Nader</FirstName>
					<LastName>Kanzi</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU)‎,‎ P.O‎. ‎Box 19395-4697‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
<Author>
					<FirstName>‎Shahriar</FirstName>
					<LastName>Farahmand Rad</LastName>
<Affiliation>Department of Mathematics‎, ‎Payame Noor University (PNU)‎,‎ P.O‎. ‎Box 19395-4697‎, ‎Tehran‎, ‎Iran‎.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>05</Month>
					<Day>04</Day>
				</PubDate>
			</History>
		<Abstract>This paper aims to establish first-order necessary optimality conditions for non-smooth multi-objective generalized semi-infinite programming problems‎. ‎These problems involve inequality constraints whose index set depends on the decision vector‎, ‎and all emerging functions are assumed to be locally Lipschitz‎. ‎We introduce a new constraint qualification for these problems‎. ‎Building upon this qualification‎, ‎we derive an upper estimate for the Clarke sub-differential of the value function of the problem‎. ‎Furthermore‎, ‎we demonstrate the necessary optimality conditions for properly efficient solutions to the problem‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Constraint qualification</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Generalized semi-infinite optimization</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Clarke subdifferential</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Marginal function</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mathco.journals.pnu.ac.ir/article_10567_371f1f6f183e2110108e1d9013598022.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
