NDLI: The Application of Algorithms for Fire-Fighting Search Operations within Buildings

Content Provider	IEEE Xplore Digital Library
Author	Chia-Hao Wu Liang-Chien Chen
Copyright Year	2013
Description	Author affiliation: Dept. of Civil Eng., Nat. Central Univ., Jhongli, Taiwan (Chia-Hao Wu) \|\| Center for Space & Remote Sensing Res., Nat. Central Univ., Jhongli, Taiwan (Liang-Chien Chen)
Abstract	Fire departments already make use of geographic information systems (GIS) to reduce the response time in case of incidents. However, the complex internal structure of buildings on fire may make search and rescue difficult in emergency situations. Search is the act of firefighters' looking for something (e.g. the location of potential victims). Search is possibly one of themost dangerous activities on the fire ground. Sometimes the visibility is zero, and the environment is really hot. Because of limited operating time in the building, the key to a successful search is how quickly firefighters can search. This study is motivated by the need for a micro GIS to represent and analyze 3D spatial data in fire-fighting search operations. The method can minimize the searching time for potential victims. The developed method generates a 3D geometric network model from 2D building plans. To search a whole floor within the building, the genetic algorithmis used to find the optimal locations of rescue teams to deploy. In addition, when firefighters need to search an area in order to find the victims, the ant algorithm is applied to find the shortest path that passes through each room of the area. Finally, the model is implemented to perform fire-fighting search analysis froman underground station.
Starting Page	1383
Ending Page	1387
File Size	280897
Page Count	5
File Format	PDF
ISBN	9780769550169
DOI	10.1109/ICDMA.2013.330
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-06-29
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Automation Geometric Network Model Genetic Algorithm P-median Problem Manufacturing Ant Algorithm Traveling Salesman Problem
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An improved ant colony optimization algorithm with embedded genetic algorithm for the traveling salesman problem

Hybrid Genetic Algorithm for TSP

An Effective Hybrid Ant Colony Algorithm for Solving the Traveling Salesman Problem

A hybrid search algorithm with Hopfield neural network and Genetic algorithm for solving traveling salesman problem

Study on a novel genetic algorithm for the combinatorial optimization problem

Hybrid Ant Colony Optimization Using Memetic Algorithm for Traveling Salesman Problem

An improved genetic algorithm for multiple traveling salesman problem

Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem

Time Ant Colony Algorithm with Genetic Algorithms

The Application of Algorithms for Fire-Fighting Search Operations within Buildings

Similar Documents

An improved ant colony optimization algorithm with embedded genetic algorithm for the traveling salesman problem

Hybrid Genetic Algorithm for TSP

An Effective Hybrid Ant Colony Algorithm for Solving the Traveling Salesman Problem

A hybrid search algorithm with Hopfield neural network and Genetic algorithm for solving traveling salesman problem

Study on a novel genetic algorithm for the combinatorial optimization problem

Hybrid Ant Colony Optimization Using Memetic Algorithm for Traveling Salesman Problem

An improved genetic algorithm for multiple traveling salesman problem

Ant Colony Algorithm and Its Application in Solving the Traveling Salesman Problem

Time Ant Colony Algorithm with Genetic Algorithms

The Application of Algorithms for Fire-Fighting Search Operations within Buildings