<?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 Qom</PublisherName>
				<JournalTitle>Journal of Engineering Management and Soft Computing</JournalTitle>
				<Issn>3116-0158</Issn>
				<Volume>12</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>04</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Maximizing the flow of used goods by designing a reverse logistics network using meta-heuristic methods</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>184</FirstPage>
			<LastPage>203</LastPage>
			<ELocationID EIdType="pii">4301</ELocationID>
			
<ELocationID EIdType="doi">10.22091/jemsc.2026.14496.1324</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Gholam Hassan</FirstName>
					<LastName>Shirdel</LastName>
<Affiliation>Department of Computer Sciences, University of Qom, Qom, IRAN.</Affiliation>
<Identifier Source="ORCID">0000-0003-2759-4606</Identifier>

</Author>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Fadhil</LastName>
<Affiliation>Department of Mathematics, University of Qom, Qom, IRAN.</Affiliation>
<Identifier Source="ORCID">0000-0001-7341-2258</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>11</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<Abstract>In supply chains, the goal is usually to meet demand at the lowest cost. But there are cases where either the transportation costs are insignificant or, such as in critical situations, the supply of more goods has a much higher priority than the costs. In such cases, instead of minimizing the cost, we should maximize the transfer flow values. In this case, the supply chain network minimization problem (minimum cost flow) becomes a type of flow maximization problem (maximum flow). In this paper, we have addressed a type of flow maximization problem in supply chains. First, we have defined and modeled it, then, considering its complex structure, we have obtained a suitable approximate solution for it by using a meta-heuristic method.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">supply chain</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Goods</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Reverse Logistics Network</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Maximum Flow</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Genetic algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jemsc.qom.ac.ir/article_4301_1b201147bcf3c89ecf52fea1ba997dff.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
