IntroductionContext of the studyConceptual frameworkTheoretical frameworkDijkstra's algorithmMaximum capacityPathfinder simulationProblem statementHypothesisNull hypothesisAlternative hypothesisThe significance of the studyScope and delimitations of the studyDefinition of termsReview of related literatureShortest pathDijkstra's algorithmMaximum capacitySimulationIntroductionThe planning of the e vacuation it is an essential element of emergency planning for companies and institutions. In general terms, people should head to a place of safety during evacuation. Situations such as earthquakes, fires, gas leaks or subsidence can be the reason for an evacuation (Künzer, 2016). The persons concerned must independently leave the buildings, business premises or training institutions as quickly as possible and in an orderly manner. In these situations that require evacuation, it is essential to determine where to go to minimize casualties. Say no to plagiarism. Get a tailor-made essay on "Why Violent Video Games Shouldn't Be Banned"? Get an Original Essay In institutions, especially educational institutions, it is important that people inside are aware of reaching for the nearest exit or pay attention to the evacuation process to minimize injury. Students and staff at the institution must be aware of emergency strategies in case something were to happen in the area. There should be a clear route to the nearest exit of the buildings for a suitable evacuation plan and provide adequate instructions around the area to mobilize evacuation in the event of an emergency. In these situations, good evacuation planning must be done. Adequate evacuation planning for the building or establishment should be considered. It can minimize or eliminate injuries during and after the event. In this plan, the exit route directions should be emphasized to determine the people's mobilization of displaced people effectively and efficiently. There are many ways or methods to create or develop an emergency evacuation plan and one of these methods is the shortest route. In graph theory, the shortest path problem is the problem of finding a path between two vertices or nodes in a graph such that the sum of the weights of its constituent edges is minimized. Dijkstra's algorithm, introduced in 1959, provides one of the most efficient algorithms for solving the shortest path problem. In a network you often want to find the shortest path between two nodes. Weights attached to edges can be used to represent quantities such as distance, cost, or time. In general, if we wish to find the minimum distance from a given node of a network, called the source node or initial node, to all nodes in the network, Dijkstra's algorithm is one of the most efficient techniques to implement (“Dijkstra's algorithm, nd”). In general, the distance along a path is the sum of the weights of that path (Biswas, 2005). In the design, the maximum capacity of the accessible building can also be taken into account in relation to the area of ​​the route in which people can pass; this is to estimate that the population could be involved in the evacuation. Evacuation planning is usually performed with the help of simulation tools that can provide a realistic assessment of particular evacuation scenarios, such as Pathfinder simulation. It allows the evacuation plan to be updated based on information about the density of people within closed areas and the interval of the entire evacuation process. Context of the studyDuring the Earthquake Resilience Conference held in Makati City in May 2015, there are five areas in Metro Manila that have been identified as "highly vulnerable" in the event of an earthquake of magnitude 7.2 or stronger due to difficulties of evacuation, being prone to fires and collapses of buildings and their large populations, these vulnerable areas were Bagong Silang and Batasan Hills in Quezon City, Further Hills in Mandaluyong, Lupang Arenda in Taytay, Rizal province, and Baseco complex in Manila. These places are not only those close to fault lines, but also have large populations of mostly low-income families with limited access to basic services. The main campus of Rizal Technological University is located in Mandaluyong City Metro Manila. Mandaluyong City is one of the identified places that will be affected in the event of an earthquake in the valley fault system. Currently, Rizal Technological University has a population of 30,653 students enrolled in the 2014-2015 admission year, the University has been rapid in competitiveness in education and athletics among colleges and universities ("Rizal Technological University" , n.d.). In July 2017, the University conducted a dry run for the annual earthquake drill, held at Gonzales Academic Hall (GAH), the Old Building (OB), the Main Academic Building (MAB), and the former administration of Dr. Josefina V. Estolas Building (DJVEB) Building (industrial technological building) and industrial technological complex (ITC). According to Prof. Nicanor Macabalug of Citizen Army Training-Disaster Risk Reduction Management (CAT-DRRM), all universities took part in the mandatory routine. GAH finished in 7 minutes, while OB and MAB in 7 minutes and 41 seconds and DJVEB in 7 minutes and 50 seconds. Although it took longer than expected, Prof. Macabalug expressed a positive opinion on the exercise and highlighted the importance of carrying a whistle and a flashlight (The Guardian Publication, 2017). Furthermore, in a study by Gloria Nenita V. Velasco (Epidemiological Assessment of Fires in the Philippines, 2010–2012), the National Capital Region (NCR) recorded the highest percentage of fire-related fatalities at 61.4% per region. Mandaluyong ranks eighth (eighth) out of seventeen (17) cities in NCR with 2.9% fire-related fatalities respectively. Determined fires and fire-related fatalities are primarily caused by faulty electrical wiring. The role of the University is to ensure the safety of people within its premises by ensuring the availability of exit routes which are a very significant part of such an educational institution. An exit route should consist of corridors, corridors, stairs and corridors leading to an exit gate, the path or way outside the exit gate leading away from the building with relevant emergency lighting and signage (University of Stanford, 2014). The absence of different requirements for the exit route in the plant can negatively influence the determination of the optimal route corresponding to the emergency cases necessary for evacuation. This could cause a delay in evacuation and could also cause casualties. The researchers are interested in knowing the emergency route plan of the Rizal University of Technology building, especially the Administration Building (Industrial Technology Building) and the Industrial Technology Complex (ITC), currently Dr. Josefina V. . Estolas Building (DJVEB) to develop a proposed effective route to allow people to evacuate the building in a short period. The researchers will use Dijkstra's algorithm to identify the shortest path, the maximum capacity forcalculate the carrying capacity of each building and Pathfinder simulation to determine the total travel time of evacuees. Pathfinder is an emergency exit simulator that includes a built-in user interface and animated 3D results. (Thunderhead Engineering Consultants Inc.) Pathfinder allows researchers to evaluate evacuation models more quickly and produce more realistic graphs. Conceptual Framework Rizal University of Technology Premises: Administration Building (ITB) currently Prophet Building and Industrial Technology Complex (ITC) currently Dr. Josefina V. Estolas Building (DJVEB). Observation of the current evacuation plan. Measurement of distances of nodes of departure leading to the exit. Definition of the maximum capacity of each building. Determination of the total travel time of evacuees using the Pathfinder simulation. Propose documents for the improvement of the emergency route. Theoretical framework Dijkstra's algorithm Dijkstra's algorithm will be used to find the shortest route in the emergency evacuation plan of the ITB and ITC building in the RTU campus.Maximum capacityThe maximum capacity will be used to calculate the carrying capacity of each building that can occupy the space as corridors/corridors during an emergency. Pathfinder Simulation The Pathfinder simulation will be used to determine the total travel time of evacuees from the departure node to the exit. Problem Statement The main purpose of this study is to identify what is the shortest and most efficient route that will serve as a guide to a safe location during an emergency, the maximum carrying capacity of each building, and the total travel time of evacuees. This study specifically seeks answers to the following problems and sub-problems: What is the layout of the RTU campus? What is the current floor plan in: Administration Building (Industrial Technology Building) Industrial Technology Complex (ITC) What is the minimum distance of the doors of the following buildings that will form a quadrilateral using Dijkstra's algorithm? Administration Building (ITB) Industrial Technological Complex (ITC)What is the carrying capacity of the following buildings?Administrative Building (ITB)Industrial Technological Complex (ITC)Using the current route, what is the total travel time of evacuees to evacuate to the Administrative Building (ITB) and in the industrial technological complex (ITC)? Using the proposed route, what is the total travel time of evacuees to evacuate in the Administration Building (ITB) and Industrial Technological Complex (ITC)? There is a significant difference between the total travel time of evacuees in the current calculated route using Dijkstra's algorithm and the path proposed by the researchers? Hypothesis Null HypothesisThere is no significant difference between the total travel time of evacuees in the current route route calculated using Dijkstra's algorithm and the route proposed by the researchers. Alternative hypothesis There is a significant difference between the total travel time of evacuees in the current route calculated using Dijkstra's algorithm and the route proposed by the researchers. of the studyThis study will benefit the following:To students and employees, this study can help them familiarize themselves with the effective evacuation route in case of emergency and increase their awareness in organizing evacuation by identifying the optimal emergency route .For management, this study will encourage them to develop an effective pathway and provisions that will substantially improve the University's disaster preparedness performance. At the University, this study will provide an updated evacuation route plan that will help improve the performance of facilities anduniversity systems. Scope and Delimitations of the Study The researchers will conduct the study at the Rizal Technological University-Boni Campus. The study limits its coverage to the school premises, in particular the administration building (industrial technology building) and the industrial technology complex (ITC). Additionally, researchers only consider earthquake and fire-related incidents since it is almost possible for an emergency to occur in the area. Definition of Terms To provide clarity, researchers define the following terms as to how they are used in the study. Algorithm: A series of steps that are followed to solve a mathematical problem or complete a computer process. Behavior - the way one acts or behaves, especially towards others. In this study, behavior refers to the act of evacuees moving from the door to the quadrangle strictly following the designated direction produced by the algorithm. Exit Path – is a continuous, unobstructed way of traveling from any point in a building or structure to an exit leading to the exterior of the building or structure. Nodes – a place where lines of a network cross or meet . In this study, the nodes refer to doors, stairs, exit paths of each building and quadrangle. Simulation: The imitative representation of the operation of one system or process using the operation of another. Review of Related Literature Shortest Path In the study by Sabri et al. , the shortest path algorithm is used as a suitable exit route to evacuate evacuees. It is more efficient to evacuate evacuees from danger to a safe location, especially for evacuees who are unfamiliar with the building. It will also guide evacuees easily and easily to find the shortest route in the safest way and, consequently, reduce injuries to evacuees during evacuation. These objectives were created to overcome the problem of difficulties faced by displaced people in finding the best routes, including the shortest and safest route. It is believed that the result of the shortest route can help the evacuee choose a suitable exit route to evacuate. For future improvements, one of the goals is to find the shortest path considering the existence of obstacles during the evacuation process. This could result in the shortest and safest route during the evacuation. The optimality of a solution is difficult to measure, a common theme throughout the literature is that evacuation plans should minimize evacuation time. In other words, minimizing evacuation time means minimizing the total evacuation time for all people. Dijkstra's algorithm An article produced by Sabri et al. there are three steps involved to reach the evacuation route. The first step is the building layout plan, followed by creating the visibility graph or network, and finally using Dijkstra's algorithm to find the shortest path. Based on the experimental study, the result shows that Dijkstra's algorithm produced a significant path to evacuate the building safely. Although there are other factors to consider, this preliminary result showed a promising result that can be extended to improve the capability of the algorithm. In conclusion, it is believed that the shortest route obtained can help the evacuee to choose an appropriate exit route to evacuate safely. The researchers chose Dijkstra's algorithm as it can efficiently produce the shortest path for route selection. This search goal is to find the shortest distance between a node and all other nodes and satisfy.