Table of ContentsIntroductionBackground of the StudyConceptual FrameworkTheoretical FrameworkDijkstra AlgorithmMaximum CapacityPathfinder SimulationProblem StatementHypothesisNull HypothesisAlternative HypothesisThe Significance of the StudyScope and Delimitations of the StudyDefinition of TermsReview of the related literatureShortest pathDijkstra's algorithmMaximum capacitySimulationIntroductionEvacuation planning is an essential element of emergency planning for businesses and organizations. Generally speaking, people should move to a safe place during evacuation. Situations such as earthquakes, fires, gas leaks or subsidence may warrant evacuation (Künzer, 2016). Affected persons should leave buildings, commercial premises or educational establishments as quickly and in an orderly manner as possible. 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 Should Not Be Banned”? Get an Original EssayIn establishments, especially educational establishments, it is important that people inside are aware of reaching the nearest exit or pay attention to the evacuation process to minimize injury. Students and school staff should be aware of emergency strategies if something could happen in the area. There should be a clear path leading to the nearest exit from the buildings for an adequate evacuation plan and provide adequate instructions around the area to mobilize evacuation in the event of an emergency. Faced with these situations, good evacuation planning must be carried out. Proper evacuation planning for the building or establishment should be considered. This can minimize or eliminate injuries during and after the event. In this plan, the directions of the exit path should be highlighted to be determined by the people in order to mobilize the evacuees 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. to solve the shortest path problem. In a network, we frequently want to find the shortest path between two nodes. Weights attached to edges can be used to represent quantities such as distances, costs or times. Generally speaking, if we want to find the minimum distance from a given node in a network, called the source node or starting node, to all nodes in the network, Dijkstra's algorithm is one of the most effective techniques. more efficient to implement ("Dijkstra's algorithm, nd"). In general, the distance along a path is the sum of the weights of that path (Biswas, 2005). The maximum capacity of the building accessible in regarding the area of ​​the path that people can travel can also be taken into account when planning; this is to estimate that the population could be involved in the evacuation is usually carried out. using simulation tools that can give a realistic assessment of particular evacuation scenarios, such as the Pathfinder simulation It allows the evacuation plan to be updated accordingly.information on the density of people inside the closed areas and on the interval of the entire evacuation process. Background of the Study During the Seismic Resilience Conference in Makati in May 2015, five areas in Metro Manila were identified as "highly vulnerable" in the event of an earthquake of magnitude 7.2 or greater due to of evacuation difficulties, being prone to fires and collapse of buildings and their large populations, these vulnerable areas were Bagong Silang and Batasan Hills in Quezon City, AddHills 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 a large population consisting mainly of low-income families with limited access to basic services. The main campus of Rizal Technological University is located in Metro Mandaluyong, Manila. Mandaluyong City is one of the identified locations that will be affected in the event of an earthquake in the valley fault system. Currently, Rizal Technological University has 30,653 students enrolled since the 2014-2015 admission year. The university has been fast in competitiveness in education and athletics among colleges and universities (“Rizal Technological University,” n.d.). In 2017, the University conducted a dry run for the annual seismic exercise, held at Gonzales Academic Hall (GAH), Old Building (OB), Main Academic Building (MAB), and Dr. Josefina Building V. Estolas (DJVEB), former administration. Building (Industrial Technology Building) and Industrial Technology Complex (ITC). According to Professor Nicanor Macabalug of Citizen Army Training-Disaster Risk Reduction Management (CAT-DRRM), all colleges participated in the mandatory routine. GAH finished in 7 minutes, while OB and MAB finished in 7 minutes and 41 seconds and DJVEB was verified in 7 minutes and 50 seconds. Despite the fact that it took longer than expected, Professor Macabalug gives a positive outlook on the exercise and mentioned the importance of bringing 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) had the highest proportion of fire-related casualties at 61.4 % by region. Mandaluyong is eighth (8th) among seventeen (17) cities in the NCR with 2.9% fire-related casualties respectively. Fires and fire-related casualties are mainly caused by faulty electrical wiring. The role of the University is to ensure the safety of people within its premises, ensuring the availability of exit routes which constitute a very important part of such an educational institution. An exit path shall consist of corridors, hallways, stairs and aisles leading to an exit door, the path or path outside the exit door that leads away from the building with the associated emergency lighting and signaling (Stanford University, 2014). The absence of multiple egress path requirements within the facility can make it difficult for individuals to determine the optimal path for emergency cases that need to be evacuated. This could delay evacuation and cause casualties. Researchers are interested in knowing the emergency route plan of the Rizal Technological University building, especially the Administration Building (Industrial Technology Building) and Industrial Technology Complex (ITC), currently Dr. Josefina V. . Estolas Building (DJVEB) to develop a proposal forefficient path for people to evacuate the building in a short period of time. Researchers will use Dijkstra's algorithm to identify the shortest path, maximum capacity to calculate the carrying capacity of each building, and Pathfinder simulation to determine the total travel time of evacuees. Pathfinder is an emergency evacuation simulator that includes an integrated user interface and animated 3D results. (Thunderhead Engineering Consultants Inc.) Pathfinder allows researchers to evaluate evacuation models faster and produce more realistic graphs. Conceptual Framework Rizal Technological University premises: Administrative Building (ITB) currently Profeta Building and Industrial Technology Complex (ITC) currently Dr. Josefina V. Estolas Building (DJVEB).Observe the current evacuation plan.Measure the distances of starting nodes leading to the exit. Define the maximum capacity of each building. Determine the total travel time of evacuees using Pathfinder simulation. Propose documents for emergency path improvement. Theoretical framework Dijkstra's algorithm Dijkstra's algorithm will be used to find the shortest path in the emergency evacuation plan of the ITB and ITC building of the RTU campus. Maximum capacity The maximum capacity will be used to calculate the carrying capacity of each building that can occupy the space such as the corridors/corridors in case of emergency. Pathfinder SimulationThe Pathfinder simulation will be used to determine the total travel time of evacuees from the starting node to the exit.Problem StatementThe main objective of this study is to identify what is the shortest and efficient path which will serve as a guide to get to a safe place in 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 layout plan in:Administrative Building (Industrial Technology Building)Industrial Technology Complex (ITC)What is the minimum door distance of the following buildings will quadrilateral using Dijkstra's algorithm?Administrative Building (ITB)Industrial Technology Complex (ITC)What is the load capacity of the following buildings?Administrative Building (ITB)Industrial Technology Complex (ITC) Using the current path, what is the total travel time for evacuees to evacuate the Administration Building (ITB) and the Industrial Technology Complex (ITC)? Using the proposed path, what is the total travel time of evacuees to evacuate the Administration Building (ITB) and Industrial Technology Complex (ITC)? Is there a significant difference between the total travel time of evacuees in the current path calculated using Dijkstra's algorithm and the path proposed by the researchers?HypothesisNull hypothesisThere is no significant difference between the total travel time of the evacuees in the current path calculated using the using Dijkstra's algorithm and the path proposed by the researchers. Alternative hypothesis There is a significant difference between the total travel time of evacuees in the current path calculated using Dijkstra's algorithm and the path proposed by the researchers. of the studyThis study will benefit the following: For students and employees, this study can help them to become familiar with the effective evacuation route in case of emergency and make them aware of arranging evacuation in identifying the optimal emergency path. To the management, this study will encourage them to develop an effective route and arrangements that will significantly improve the performance ofUniversity disaster preparedness. At the University, this study will provide an updated evacuation route plan that will help improve the performance of University structures and systems. Scope and Limitations of the Study The researchers will conduct the study at the campus of Rizal Technological University-Boni. The study demarcates its coverage to the school premises specifically in the administrative building (industrial technology building) and the industrial technology complex (ITC). Additionally, researchers only consider earthquakes and fires because it is almost possible for an emergency to occur in the area. Definition of Terms For clarity, the researchers define the following terms on how they are used in the study. Algorithm – a set of steps that are followed to solve a mathematical problem or to complete a computer process. Behavior – the way one acts or conducts oneself, especially towards others. In this study, behavior refers to the act of evacuees moving from the gate to the quadrangle strictly following the designated direction produced by the algorithm. Egress Path - is a continuous, unobstructed means of travel from any point on a building or structure to an exit. facing the exterior of the building or structure.Nodes – a place where the lines of a network cross or meet. In this study, nodes refer to the 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 the appropriate 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 the evacuees in a simple and smooth manner to find the shortest path in the safest manner and accordingly reduce injuries to evacuees during evacuation. These goals were achieved to overcome the problem of difficulties faced by evacuees in finding the best routes, including the shortest and safest path. It is believed that the shortest path result can help the evacuee choose a suitable exit route to evacuate. For future improvements, one of the objectives is to find the shortest path considering the existence of an obstacle during the evacuation process. This may involve the shortest and safest route during 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 to follow to create the evacuation route. The first step is to build a 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 an important route to evacuate the building safely. Although other factors need to be considered, this preliminary result showed promise that can be extended to improve the capabilities of the algorithm. In conclusion, it is believed that the shortest path obtained can help evacuees choose a :.