<?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>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Zoning constrained machine layout problem with mutual clearances</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24059</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.57877.5453</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Zeynep</FirstName>
					<LastName>Uruk</LastName>
<Affiliation>Department of Industrial Engineering, Sakarya University, Sakarya, Turkey.</Affiliation>

</Author>
<Author>
					<FirstName>Nevra</FirstName>
					<LastName>Kazanci</LastName>
<Affiliation>Department of Industrial Engineering, Sakarya University, Sakarya, Turkey.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>03</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, a single row machine layout problem is considered with zoning constraints and mutual clearances under an enhanced objective of minimizing material flow cost and machine installation cost. The problem is restricted by positive and negative zoning constraints to represent real-life problems. Moreover, the clearances needed between machine pairs are divided into two types, which are must and extra clearances. Extra clearances are reduced through mutual use between adjacent machines to decrease material flow costs. Objective function also considers fixed costs of locating machines which usually neglected in machine layout problems in literature but a necessity in real-life problems. Two mathematical models, namely nonlinear and linear mixed integer programs, are formulated to solve the problem optimally and to compare the effect of linearity and nonlinearity in mathematical programming formulations in terms of solution quality and time. The mathematical models are not effective in terms of time for large problem instances; therefore, a genetic algorithm is proposed to generate high-quality solutions within a reasonable time. It is shown that the genetic algorithm outperforms both the nonlinear and linear mathematical models with lower cost and shorter time.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Restricted single row machine layout problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Zoning constraints</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Mutual clearances</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Machine installation cost</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Flexible Manufacturing Systems (FMS)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24059_600d5fa630e5a8f78ef25121dc136a20.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A modified Russell measure for estimating efficiency changes in the presence of the undesirable outputs and stochastic data</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24151</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2021.58051.5538</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Seyedeh Sara</FirstName>
					<LastName>Hosseini</LastName>
<Affiliation>Department of Mathematics, Islamic Azad University, Qazvin Branch, Qazvin, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Farzipoor Saen</LastName>
<Affiliation>Department of Operations Management and Business Statistics, College of Economics and Political Science, Sultan Qaboos University, Muscat, Oman.</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Kazemi Matin</LastName>
<Affiliation>Department of Mathematics, College of Science, Sultan Qaboos University, Muscat, Oman.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>04</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>Although Data Envelopment Analysis (DEA) assumes deterministic data, a great volume of data might be stochastic. The Global Malmquist Productivity Index (GMPI) is a highly effective instrument for productivity analysis in DEA. This paper extends GMPI in the presence of stochastic data. Our new stochastic DEA model is a Chance-Constrained Programming (CCP) model, which is converted to a deterministic programming problem with a linear objective function and quadratic constraints. For efficiency evaluation purposes, in this paper, the weak disposability principle is used to model Russell’s measure in the presence of undesirable outputs. The main contribution of this paper is to develop a global Russell model with stochastic data. A case study is presented to illustrate the applicability of the proposed models.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Data envelopment analysis (DEA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Stochastic data</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">undesirable outputs</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Modified Russell Measure (MRM)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Global Malmquist Productivity Index (GMPI)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24151_9b6e62858e82a755fcce70013c328717.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Multi-objective low-carbon hybrid flow-shop scheduling via an improved teaching-learning-based optimization algorithm</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24165</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.58317.5665</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Wenjie</FirstName>
					<LastName>Wang</LastName>
<Affiliation>Key Laboratory of High Efficiency and Clean Mechanical Manufacture (Ministry of Education), National Demonstration Center for Experimental Mechanical Engineering Education, School of Mechanical Engineering, Shandong University, Jinan, China.</Affiliation>

</Author>
<Author>
					<FirstName>Xuesheng</FirstName>
					<LastName>Zhou</LastName>
<Affiliation>College of Engineering, Nanjing Agricultural University, Nanjing, China.</Affiliation>

</Author>
<Author>
					<FirstName>Guangdong</FirstName>
					<LastName>Tian</LastName>
<Affiliation>Key Laboratory of High Efficiency and Clean Mechanical Manufacture (Ministry of Education), National Demonstration Center for Experimental Mechanical Engineering Education, School of Mechanical Engineering, Shandong University, Jinan, China.</Affiliation>

</Author>
<Author>
					<FirstName>Amir M.</FirstName>
					<LastName>Fathollahi-Fard</LastName>
<Affiliation>Department of Electrical Engineering, École de Technologie Supérieure, University of Québec, Montréal, Canada.</Affiliation>

</Author>
<Author>
					<FirstName>Peng</FirstName>
					<LastName>Wu</LastName>
<Affiliation>School of Econ &amp; Management, Fuzhou University, Fuzhou, China.</Affiliation>

</Author>
<Author>
					<FirstName>Chaoyong</FirstName>
					<LastName>Zhang</LastName>
<Affiliation>State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, China.</Affiliation>

</Author>
<Author>
					<FirstName>Chengwen</FirstName>
					<LastName>Liu</LastName>
<Affiliation>Department of Shop Management in Ruixing Group Co., Ltd., Taian, China.</Affiliation>

</Author>
<Author>
					<FirstName>Zhiwu</FirstName>
					<LastName>Li</LastName>

						<AffiliationInfo>
						<Affiliation>Institute of Systems Engineering, Macau University of Science and Technology, Macau, China.</Affiliation>
						</AffiliationInfo>

						<AffiliationInfo>
						<Affiliation>School of Electro-Mechanical Engineering, Xidian University, Xi’an, China.</Affiliation>
						</AffiliationInfo>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>05</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>In this article, for achieving effective and environmentally friendly production scheduling, we investigate a Multi-objective Low-carbon Hybrid Flow-shop Scheduling Problem (MLHFSP) with the consideration of machines with varied energy usage ratios. The problem is formulated by a multi-objective mathematical model with two optimization objectives, i.e., minimizing Total Carbon Emission (TCE) and makespan (Cmax). We primarily analyse the formation of TCE and derive its mathematical expression. MLHFSP is Non-deterministic Polynomial-hard (NP-hard), therefore, to tackle the model, an Improved multi-objective Teaching-Learning-Based Optimization (ITLBO) algorithm is proposed. The ITLBO algorithm mainly contains global search-based teaching phase and local search-based learning phase. In ITLBO, a solution is represented by two vectors, i.e., job sequence vector and machine assignment vector. Sigma method is utilized to quantify each individual, and to avoid local optimum, Sequential Neighbourhood Search (SNS) method is also adopted. Experimental results validate the feasibility and effectiveness of the proposed ITLBO in addressing MLHFSP. The research findings help manufacturing engineers to seek a sophisticated balance between carbon emission reduction and makespan reduction.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Production Scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Carbon emission</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Makespan</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Hybrid flow-shop scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Teaching-Learning-Based Optimization (TLBO)</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24165_8f25327bf67db45be41e7c8b4769d0ee.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Improved CEM–RBS control charts for monitoring the process mean using ranked–based sampling designs</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24168</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.57495.5268</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Muhammad</FirstName>
					<LastName>Tayyab</LastName>
<Affiliation>Department of Statistics, National College of Business Administration and Economics, Lahore, Pakistan.</Affiliation>

</Author>
<Author>
					<FirstName>Wasif</FirstName>
					<LastName>Yasin</LastName>
<Affiliation>Department of Statistics, National College of Business Administration and Economics, Lahore, Pakistan.</Affiliation>

</Author>
<Author>
					<FirstName>Asma</FirstName>
					<LastName>Arshad</LastName>
<Affiliation>Department of Statistics, National College of Business Administration and Economics, Lahore, Pakistan.</Affiliation>

</Author>
<Author>
					<FirstName>Muhammad</FirstName>
					<LastName>Noor-ul-Amin</LastName>
<Affiliation>Department of Statistics, COMSATS University Islamabad, Lahore Campus, Pakistan.</Affiliation>

</Author>
<Author>
					<FirstName>Muhammad</FirstName>
					<LastName>Hanif</LastName>
<Affiliation>Department of Statistics, National College of Business Administration and Economics, Lahore, Pakistan.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>01</Month>
					<Day>08</Day>
				</PubDate>
			</History>
		<Abstract>In this study, different Ranked-Based Sampling (RBS) schemes are used to design a sensitive control chart to monitor the small or moderate shifts in the process mean, and are named combined Exponentially Weighted Moving Average (EWMA) Moving Average (MA) RBS (CEM-RBS) control charts. The Average Run-Length (ARL) and the Standard Deviation of the Run-Length (SDRL) are computed through Monte Carlo (MC) simulation runs to evaluate the performance of the proposed charts in comparison with the existing charts such as MA, EWMA, EWMA-MA, and the EWMA under RBS control charts. It is proved through a comparative study that the proposed CEM–RBS charts indicate a significant improvement in the performance of the EWMA-MA chart by using the RBS concept. A real dataset-based example is also included to explain the concept in detail.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Average Run–Length (ARL)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Control chart</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">exponentially weighted moving average (EWMA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Ranked set sampling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Monte Carlo simulation</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24168_66629dc988951697474e99165f5692de.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Reliability-redundancy allocation problem of a queueing system considering energy consumption</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24169</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.58080.5562</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Kamyar</FirstName>
					<LastName>Sabri-Laghaie</LastName>
<Affiliation>Department of Industrial Engineering, Urmia University of Technology, Urmia, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Mahdi</FirstName>
					<LastName>Fathi</LastName>
<Affiliation>Department of Information Technology and Decision Sciences, G. Brint Ryan College of Business, University of North Texas, Denton, Texas, USA.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>04</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>In Reliability-Redundancy Allocation Problem (RRAP), the reliability and redundancy of components in a given system configuration are determined while considering some problem-specific constraints. RRAP can be applied in various industries. Moreover, queueing systems are among the most common systems in the manufacturing and service industries. Failure in queueing systems can result in unwanted severe damages. Reliability analysis of queueing systems should be conducted concerning their performance measures. Therefore, a RRAP of a queueing system considering queueing costs is studied in this article. The proposed cost function includes queueing, repair, and energy consumption costs. A Memetic Algorithm (MA) is used to obtain optimal redundancy and failure rates of components and the system’s service rate, which affects the energy consumption level. Extensive numerical experiments and sensitivity analyses are performed to present the problem’s applicability and the proposed algorithm.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Reliability-Redundancy Allocation Problem (RRAP)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Memetic Algorithm (MA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Queueing system</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Availability</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Markov chain modeling</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24169_ab935b81379c7cca9ca701a8fa8650fb.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Simulation optimization approach for dynamic and stochastic closed loop supply chain network</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24175</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.58224.5626</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Ayşe Tuğba</FirstName>
					<LastName>Dosdoğru</LastName>
<Affiliation>Department of Industrial Engineering, Adana Alparslan Türkeş Science and Technology University, Adana, Turkey.</Affiliation>

</Author>
<Author>
					<FirstName>Asli</FirstName>
					<LastName>Boru İpek</LastName>
<Affiliation>Department of Industrial Engineering, Adana Alparslan Türkeş Science and Technology University, Adana, Turkey.</Affiliation>

</Author>
<Author>
					<FirstName>Mustafa</FirstName>
					<LastName>Göçken</LastName>
<Affiliation>Department of Industrial Engineering, Adana Alparslan Türkeş Science and Technology University, Adana, Turkey.</Affiliation>

</Author>
<Author>
					<FirstName>Eren</FirstName>
					<LastName>Özceylan</LastName>
<Affiliation>Department of Industrial Engineering, Gaziantep University, Gaziantep, Turkey.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>05</Month>
					<Day>11</Day>
				</PubDate>
			</History>
		<Abstract>In this paper, four Simulation Optimization (SO) models are developed by combining simulation and Genetic Algorithm (GA). In the proposed models, optimal values of inventory control parameters and the number of facilities to be opened are determined simultaneously for periodic review and continuous review systems, respectively. Furthermore, single-product and multi-components of Closed-Loop Supply Chain (CLSC) network are created considering two different objective functions of review systems to gain a sustainable competitive advantage for companies. We seek to offer valuable insights for creating robust and user-friendly CLSC network where the forward network includes suppliers, plants, retailers, and customers, and reverse network includes collection centers, disassembly centers, refurbishing centers, and disposal center. The results of this study demonstrated that four SO models have a significant potential to satisfy the customer’s needs since the average service level of the models is at least 81.8%. The total supply chain cost can be decreased at least 3% and at most 22% on average with the proposed continuous review model whose objective is the minimization of differences between the total overordering cost and the total underordering cost (C-D). Furthermore, the total lost sales cost can be improved at least 15% and at most 89% on average with the C-D model.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Simulation Optimization (SO)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">genetic algorithm (GA)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Closed-Loop Supply Chain (CLSC)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">continuous review system</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">periodic review system</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24175_4f372af992d5addcf0ddfbd0868aa95c.pdf</ArchiveCopySource>
</Article>

<Article>
<Journal>
				<PublisherName>Sharif University of Technology</PublisherName>
				<JournalTitle>Scientia Iranica</JournalTitle>
				<Issn>1026-3098</Issn>
				<Volume>32</Volume>
				<Issue>12</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>05</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimizing a bi-objective multi-period fish closed-loop supply chain network design by three multi-objective meta-heuristic algorithms</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24221</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2021.57930.5477</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Maedeh</FirstName>
					<LastName>Fasihi</LastName>
<Affiliation>Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Tavakkoli-Moghaddam</LastName>
<Affiliation>School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Seyyed Esmaeil</FirstName>
					<LastName>Najafi</LastName>
<Affiliation>Department of Industrial Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran.</Affiliation>
<Identifier Source="ORCID">0000-0002-8734-5436</Identifier>

</Author>
<Author>
					<FirstName>Mostafa</FirstName>
					<LastName>Hajiaghaei-Keshteli</LastName>
<Affiliation>Tecnologico de Monterrey, Escuela de Ingenieríay Ciencias, Puebla, Mexico.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>03</Month>
					<Day>18</Day>
				</PubDate>
			</History>
		<Abstract>Attention to a food Supply Chain (SC) has increased recently due to population growth and increased demand for food. Aquaculture development is advantageous as fish is a crucial constituent of the food basket of households. This study first presents a new bi-objective and multi-period mathematical model of a fish Closed-Loop Supply Chain (CLSC). The model is addressed by utilizing the Multi-Objective Keshtel Algorithm (MOKA), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Simulated Annealing (MOSA). The Taguchi method is employed to tune these metaheuristics to attain superior performance, and the ε-constraint method is used in solving small-sized problems to validate them. The results show that the exact method cannot solve large-sized problems.&lt;br /&gt;The solutions are compared in terms of different performance metrics. Using the ‘Filtering/Displaced Ideal Solution’ (F/DIS) method, NSGA-II and MOKA with a direct distance of 0.4228 and 0.8976 have the first and second performance ranks, respectively. Also, a case study including a trout CLSC in the north of Iran is investigated. The results and the case study show that the developed model can be applied to the proposed solution approach.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Closed-Loop Supply Chain (CLSC)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">meta-heuristic algorithms</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Reverse logistics</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bi-objective and multi-period model</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Fish supply chain</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24221_fd1a7fb9d1ed55acd080a46103f7964a.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
