<?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>7</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2015</Year>
					<Month>10</Month>
					<Day>23</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Optimal Allocation of Emergency Service Vehicles with Batch Arrival of Demand</ArticleTitle>
<VernacularTitle>Optimal Allocation of Emergency Service Vehicles with Batch Arrival of Demand</VernacularTitle>
			<FirstPage>31</FirstPage>
			<LastPage>44</LastPage>
			<ELocationID EIdType="pii">14039</ELocationID>
			
			
			<Language>FA</Language>
<AuthorList>
<Author>
					<FirstName>Roya</FirstName>
					<LastName>Davoudi</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName>Farzad</FirstName>
					<LastName>Dehghanian</LastName>
<Affiliation></Affiliation>

</Author>
<Author>
					<FirstName>Mohammadali</FirstName>
					<LastName>Pirayesh</LastName>
<Affiliation></Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2014</Year>
					<Month>03</Month>
					<Day>13</Day>
				</PubDate>
			</History>
		<Abstract>This paper deals with the problem of allocation of emergency service vehicles (ESVs) to emergency service stations in order to maximize the expected covering of the demands. Most of the previous studies in this area assume that every call needs only one ESV; however real experiences demonstrate that these assumptions are not valid. Hence, in this paper we are going to develop a model that could dedicate more than one ESV to each call. For this purpose, we use the queue theory with batch arrivals to calculate the availability rate of ESVs in each station. A mixed integer programming model is provided to determine the optimal number of ESVs in each predetermined emergency stations. A real case study is implemented in Mashhad for finding the number of ESVs in gas emergency stations. Model is optimally solved by CPLEX and results are discussed and some analyses on parameters of the model are done.</Abstract>
			<OtherAbstract Language="FA">This paper deals with the problem of allocation of emergency service vehicles (ESVs) to emergency service stations in order to maximize the expected covering of the demands. Most of the previous studies in this area assume that every call needs only one ESV; however real experiences demonstrate that these assumptions are not valid. Hence, in this paper we are going to develop a model that could dedicate more than one ESV to each call. For this purpose, we use the queue theory with batch arrivals to calculate the availability rate of ESVs in each station. A mixed integer programming model is provided to determine the optimal number of ESVs in each predetermined emergency stations. A real case study is implemented in Mashhad for finding the number of ESVs in gas emergency stations. Model is optimally solved by CPLEX and results are discussed and some analyses on parameters of the model are done.</OtherAbstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Optima allocation</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">emergency services</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">ESV</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">emergency stations</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://jte.sinaweb.net/article_14039_181cf41ce37cf9128e1d95896661c5c9.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
