<?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>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Electrical Engineering</JournalTitle>
				<Issn>2588-2910</Issn>
				<Volume>55</Volume>
				<Issue>Issue 3 (Special Issue)</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>12</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Using a Tuning Parameter to Compromise Computation Time and Shipping Cost in an MDVRP</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>323</FirstPage>
			<LastPage>332</LastPage>
			<ELocationID EIdType="pii">5328</ELocationID>
			
<ELocationID EIdType="doi">10.22060/eej.2022.21404.5474</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad Amin</FirstName>
					<LastName>Zajkani</LastName>
<Affiliation>Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Rahimi Baghbadorani</LastName>
<Affiliation>Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran</Affiliation>
<Identifier Source="ORCID">0000-0001-6058-2485</Identifier>

</Author>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Haeri</LastName>
<Affiliation>Department of Electrical Engineering, Sharif University of Technology, Tehran, Iran</Affiliation>
<Identifier Source="ORCID">0000-0001-8509-4525</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2022</Year>
					<Month>05</Month>
					<Day>19</Day>
				</PubDate>
			</History>
		<Abstract>Vehicle routing in last-mile delivery plays a decisive role in the new world of people’s &lt;br /&gt;lifestyles. At present, a growing number of people order their needs online, and this forces companies  to employ innovative delivery logistics to reduce their last-mile shipping costs. The goal is to minimize the cost of travel that depends on the Euclidean distance between customers. Companies require solving vehicle routing problems (VRP) in a reasonable time. In this paper, a new approach is introduced that solves the multi-depot vehicle routing problem (MDVRP) in real-time. We propose a new method by clustering and decomposing the main problem into smaller ones using a tuning parameter α . This approach could reduce the solution time noticeably (up to 95%) while the shipping cost is still reasonable.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Vehicle Routing Problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Tuning parameter</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Computation time</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Complexity</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">clustering</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://eej.aut.ac.ir/article_5328_59de0175dc17bcf0f4fb5ae6ae3f444f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
