<?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>Parseh Designers Transportation Research Institute</PublisherName>
				<JournalTitle>Quarterly Journal of Transportation Engineering</JournalTitle>
				<Issn>2008-6598</Issn>
				<Volume>12</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2020</Year>
					<Month>09</Month>
					<Day>22</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Developing a Mathematical Model for a Location-Routing Vehicle Problem with Customer Satisfaction and Pick up Delivery</ArticleTitle>
<VernacularTitle>Developing a Mathematical Model for a Location-Routing Vehicle Problem with Customer Satisfaction and Pick up Delivery</VernacularTitle>
			<FirstPage>101</FirstPage>
			<LastPage>114</LastPage>
			<ELocationID EIdType="pii">58248</ELocationID>
			
<ELocationID EIdType="doi">10.22119/jte.2020.58248</ELocationID>
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Pedram</FirstName>
					<LastName>Memari</LastName>
<Affiliation>Faculty of Industrial Engineering, Department of Engineering, Tehran University, Tehran, Iran</Affiliation>
<Identifier Source="ORCID">0000-0002-2916-2092</Identifier>

</Author>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Partovi</LastName>
<Affiliation>Faculty of Industrial Engineering, Department of Engineering, Tehran University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Fariborz</FirstName>
					<LastName>Jolai</LastName>
<Affiliation>Faculty of Industrial Engineering, Department of Engineering, Tehran University, Tehran, Iran</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Tavakkoli-Moghaddam</LastName>
<Affiliation>Faculty of Industrial Engineering, Department of Engineering, Tehran University, Tehran, Iran</Affiliation>
<Identifier Source="ORCID">0000-0002-6757-926X</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2017</Year>
					<Month>07</Month>
					<Day>16</Day>
				</PubDate>
			</History>
		    <Abstract>This study considers a location-routing problem (LRP) with multiple depots and hard time windows for customers. The aim of this paper is to select optimal locations for depots and plan scheduling and routing of heterogeneous vehicle fleets. Therefore, it minimizes costs of establishment of depots and reduce transportation time by finding the optimum routs simultaneously. Customer satisfaction is important for each organization; hence, a hard time window is considered for customers. The main approach of this study is considered location-routing problem simultaneously for reducing location-routing costs and it work effectively. To validate the model, an augmented epsilon-constraint is used to solve small-sized problems. Because the problem is NP-hard, it takes too long time and needs too much space memory to solve large-sized problems optimally. Deterministic algorithms cannot solve the large-size problems. Thus, a well-known multi-objective evolutionary algorithm, namely non-dominated sorting genetic algorithm (NSGA-II), is proposed. Gap between augmented epsilon-constraint and NSGA-II show accuracy. The results are analyzed and compared in order to show the efficiency of the proposed NSGA-II.</Abstract>
			<OtherAbstract Language="FA">This study considers a location-routing problem (LRP) with multiple depots and hard time windows for customers. The aim of this paper is to select optimal locations for depots and plan scheduling and routing of heterogeneous vehicle fleets. Therefore, it minimizes costs of establishment of depots and reduce transportation time by finding the optimum routs simultaneously. Customer satisfaction is important for each organization; hence, a hard time window is considered for customers. The main approach of this study is considered location-routing problem simultaneously for reducing location-routing costs and it work effectively. To validate the model, an augmented epsilon-constraint is used to solve small-sized problems. Because the problem is NP-hard, it takes too long time and needs too much space memory to solve large-sized problems optimally. Deterministic algorithms cannot solve the large-size problems. Thus, a well-known multi-objective evolutionary algorithm, namely non-dominated sorting genetic algorithm (NSGA-II), is proposed. Gap between augmented epsilon-constraint and NSGA-II show accuracy. The results are analyzed and compared in order to show the efficiency of the proposed NSGA-II.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Multi-objective location-routing problem</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Customer Satisfaction</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Pick-up delivery</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">meta-heuristic algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jte.sinaweb.net/article_58248_e595c1d49bf4a26f8e14ce59812af80e.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
