<?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>16</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A greedy heuristic algorithm to solve a vehicle routing problem-based model for planning and coordinating multiple resources in emergency response to bushfires</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">24250</ELocationID>
			
<ELocationID EIdType="doi">10.24200/sci.2022.57476.5258</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Asudeh</FirstName>
					<LastName>Shahidi</LastName>
<Affiliation>Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Reza</FirstName>
					<LastName>Ramezanian</LastName>
<Affiliation>Department of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran.</Affiliation>

</Author>
<Author>
					<FirstName>Shahrooz</FirstName>
					<LastName>Shahparvari</LastName>
<Affiliation>School of Accounting, Information Systems and Supply Chain, College of Business and Law, RMIT University, Melbourne,
Australia.</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>01</Month>
					<Day>05</Day>
				</PubDate>
			</History>
		<Abstract>Uncoordinated responses are problematic in various operations, especially in crucial circumstances such as bushfires, where they are associated with decreased efficiency, effectiveness, and safety. This paper presents a new Vehicle Routing Problem (VRP) model for routing, scheduling, and coordinating bushfire-related resources, including Ground Resources (GR) and Aerial Resources (ARs) in the suppression phase of a bushfire event. The coordination must be in a way that ARs&#039; operations are allowed prior to GRs&#039; operations; otherwise, aerial interference is unhelpful. The problem is Non deterministic Polynomial time (NP)-hard and cannot be solved in polynomial time using exact methods, but due to the crucial circumstances of bushfires, it should be solved in a reasonable time. Therefore, we propose a greedy heuristic algorithm to solve it. Dividing the bushfire area into a set of  fire sites, we solved instances with different numbers of  fire sites using both CPLEX and the greedy algorithm and compared the results. CPLEX fails to solve the instances with more than three  fire sites, but the greedy algorithm solves the largest instance having 9  fire sites in less than 1 minute. The negligible Relative Percent Difference (RPD) of the greedy algorithm in the first  five instances indicates that our proposed algorithm is reliable.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Coordination</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Vehicle Routing Problem (VRP)</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Scheduling</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Bushfire suppression</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Greedy heuristic algorithm</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://scientiairanica.sharif.edu/article_24250_eb2dd0ae2304818f615280c7a6b5218a.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
