Bidirectional ACO intelligent fire evacuation route optimization

To study the impact of the psychological and behavioral characteristics of people, fire environment, and evacuation routes on fire evacuation efficiency, this study focuses on a university library as the research subject. A fuzzy logic algorithm is employed to analyze how psychological and behavioral traits influence initial evacuation speed during a fire. Also, fire data simulated using PyroSim software is integrated, with gas temperature, CO concentration, and visibility quantified through empirical formulas to adjust the reduction factor of evacuation speed, examining the effects of fire-generated products on evacuation performance. By incorporating fire environment factors into the heuristic function and refining pheromone update rules through iterative strategies, the ant colony algorithm is enhanced to achieve path planning. Results show that the psychological–environmental-route correction method improves evacuation efficiency by 16.2% compared to traditional methods without correction. This demonstrates that the proposed correction method can improve the efficiency of building fire evacuation and provides theoretical support and technical solutions for future library fire safety management.

The ant colony optimization (ACO) algorithm is improved and further integrated with the immune algorithm (IA) to address its problems, such as slow convergence, local optimum, and premature convergence in the path planning. An algorithm integrating IA and improved ant colony optimization (IACO) is, therefore, put forward to realize the optimal planning of global path for an unmanned surface vehicle (USV). First, the ACO algorithm was improved in three aspects, that is, generation of initial pheromones, transition probability, and update of pheromones. The proposed IA-IACO algorithm combined the advantages of IA and IACO, sped up the convergence, and enhanced the optimization capability and operational efficiency. Second, the IA-IACO algorithm was designed and applied in the global path planning of an unmanned surface vehicle, achieving great global optimization and convergence. Finally, a path smoothing algorithm was devised to achieve the implementable, economic, and stable path while guaranteeing the safe navigation of the USV. A simulation test was carried out to prove the effectiveness and superiority of the designed global path planning algorithm in the practical engineering.

The critical tasks during evacuation process is how to find the right ways in order to escape from the danger place to a safe place. In process of finding the right ways, most of the evacuees are panicked. Subsequently, make the process more difficult. With that occurrence, the main objectives of this research study are to identify the suitable shortest path algorithm for evacuation in high rise building, then design and develop an evacuation route via shortest path algorithm in order to obtain an exit route to evacuate by using Optimization and Artificial Intelligence Technique. The objectives that involved are to help the evacuees to find the best routes during evacuation process. Six phases of methods are raised to accomplish the objectives by utilizing the Dijkstra and Ant Colony Optimization Algorithm. The first step is started from the original building layout. Then transform the layout into 2D layout plan. After that, import the matrix data to generate graph theory. Next step is utilizing the both approaches to achieve the shortest path. The preliminary result has shown positive result which can deliver the shortest path to help evacuees.

Ant colony optimization (ACO) algorithm is a metaheuristic inspired by the behavior of real ants in their search for the shortest path to food sources. The ACO algorithm takes on these characteristics of robust, positive feedback distributed computing, easy fusing with other algorithms. But the basic ACO algorithm has some deficiencies of premature and stagnation phenomenon in the evolution process, and is easily trapped into local optimal solution. And it is difficult to explore other solutions in the neighbor space. So a improved ACO(DPSEMACO) algorithm based on dual population strategy, bi-directional dynamic adjust evaporation factor strategy of the pheromone and parallel strategy is proposed to solve the traveling salesman problem(TSP). In the DPSEMACO algorithm, the ants are divided into the two subpopulations by borrowing the mutual cooperation mechanism of biological community, which evolve separately and exchange information timely. The bi-directional dynamic adjusting evaporation factor strategy of the pheromone is used to change the corresponding path pheromone of different subpopulations in order to avoid to trap into a local optimum. The parallel strategy can avoid falling into a local optimum. And the DPSEMACO algorithm can expand the search space and improve the overall searching performance by repeated changing the pheromone of the each subpopulation and adaptive adjusting evaporation factor. Finally, in order to prove the optimization performance of the proposed DPSEMACO algorithm, some classic TSP instances are selected from the TSPLIB in this paper. And some existing methods are selected to compare the optimization performance with the proposed DPSEMACO algorithm. The experimental results demonstrate that the proposed DPSEMACO algorithm is feasible and effective in solving TSP, and takes on a good global searching ability and high convergence speed.

The traveling salesman problem (TSP) is an NP-hard problem. Thus far, a large number of researchers have proposed different ant colony optimization (ACO) algorithms to solve the TSP. These algorithms inevitably encounter problems such as long convergence time and the tendency to easily fall into local optima. On the basis of the ACO algorithm, this study proposes a dynamic adaptive ACO algorithm (DAACO). DAACO realizes the diversity of initialization of the ACO algorithm by dynamically determining the number of ants to be prevented from falling into local optimization. DAACO also adopts a hybrid local selection strategy to increase the quality of ant optimization and reduce the optimization time. Among the 20 instances of the TSPLIB dataset, the DAACO algorithm obtains 19 optimal values, and the solutions of 10 instances are better than those of other algorithms. The experimental results on the TSPLIB dataset show that the DAACO algorithm has obvious advantages in terms of convergence time, solution quality, and average value relative to existing state-of-the-art ACO algorithms.

With the continuous acceleration of the building process of urban modernization in China, the scale of buildings continues to expand, and more and more information equipment and electrical equipment are applied to high-rise buildings, which brings new challenges to the design of electricity for high-rise buildings. In order to ensure the normal operation of electric equipment and choose the reasonable electricity consumption and reduce the cost of investment and maintenance, it is necessary to discuss the wiring optimization problems of high-rise buildings. Therefore, this paper chooses the ant colony optimization to optimize the wiring design of the electrical equipment of the building intelligently. Based on the biological model of ant colony optimization, the traditional ant colony optimization is improved, and the ant colony optimization is proposed in the continuous space optimization problem. It optimizes the routing path of high-rise buildings by simulating the shortest path of the ant colony to find food. The computing results of power parameters show that, the improved ant colony optimization model proposed in this paper can shorten the length of high-rise building wiring, the control of voltage drop, line loss and other power parameters can improve the economic benefit of the algorithm, and it is feasible in the optimization of high-rise building wiring.

High-rise teaching buildings are complex public buildings that combine the evacuation risks of school buildings and high-rise buildings. In this regard, studying fire product transport patterns and personnel evacuation characteristics of high-rise school buildings is crucial for safe and rapid evacuation. In this paper, we applied Pyrosim2018 software to build a model of a teaching building and performed numerical fire simulation to analyze temperature, CO gas, and visibility to determine the available evacuation time ASET; meanwhile, we performed evacuation simulation by Pathfinder 2019 to determine the required evacuation time and analyze the congestion problem during evacuation. By improving the evacuation route, secondary simulations were conducted and compared with the previous results. The results show that visibility is the main factor affecting evacuation in of the event of a fire in this school building. Based on the visibility analysis, it is recommended that personnel evacuate from floors four and above within 709.2 S when the fire location is at a specific position on the third floor. While the original safety exits of the school building can avoid a large number of casualties, they cannot guarantee the safe evacuation of all people, and planning a reasonable evacuation route can obviously relieve the evacuation pressure in the high-rise corridor.

In order to improve the search result and low evolution speed, and avoid the tendency towards stagnation and falling into the local optimum of ant colony optimization(ACO) in solving the complex function, the traditional ant colony optimization algorithm is analyzed in detail, an improved ant colony optimization(IWSMACO) algorithm based on information weight factor and supervisory mechanism is proposed in this paper. In the proposed IWSMACO algorithm, the information weight factor is added to the path selection and pheromone adjustment mechanisms in order to dynamically adjust path selection probability and randomly select the behavior rules for further intelligentializing the ant colony. The supervisory mechanism added the dynamic convergence criterion of supervisory distance and used the optimal pheromone update strategy to self-adaptively select the excellent ants for updating the pheromone trails, and improve the solution qualities of each iteration, better guide the later ants for learning. Finally, the proposed IWSMACO algorithm is carried out by 12 TSP instances. The simulation experiment results show that the proposed IWSMACO algorithm can not only avoid falling into the local optimum, but also enhance the convergence speed. And it takes on remarkable optimized ability and higher search accuracy.

Ant-TD: Ant colony optimization plus temporal difference reinforcement learning for multi-label feature selection

The present study aims to conduct a quantitative evaluation of evacuation route safety using the Ant Colony Optimization (ACO) algorithm for risk management in central Tokyo. Firstly, the similarity in safety was focused on while taking into consideration road blockage probability. Then, by classifying roads by means of the hierarchical cluster analysis, the congestion rates of evacuation routes using ACO simulations were estimated. Based on these results, the multiple evacuation routes extracted were visualized on digital maps by means of Geographic Information Systems (GIS), and their safety was evaluated. Furthermore, the selection of safe evacuation routes between evacuation sites for cases when the possibility of large-scale evacuation after an earthquake disaster is high is made possible. As the evaluation method is based on public information, by obtaining the same geographic information as the present study, it is effective in other areas, regardless of whether the information is from the past or future. Therefore, in addition to spatial reproducibility, the evaluation method also has high temporal reproducibility. Because safety evaluations are conducted on evacuation routes based on quantified data, the selected highly safe evacuation routes have been quantitatively evaluated, and thus serve as an effective indicator when selecting evacuation routes.

Test case prioritization technology improves the efficiency of software testing by optimizing the execution order of test cases, which is an important research topic of software regression testing. In order to solve the problem of requirement-based test case prioritization, this paper proposed a solution based on ant colony optimization algorithm and gave its two different implementation methods: distance-based and index-based implementation. Firstly, a general indicator based on requirements was designed to evaluate the test cases. Secondly, the concept of test case attractivity was proposed, and the definition of the distance between test cases was given based on it. Finally, the main design strategies such as the pheromone update strategy, the optimal solution update strategy, and the local optimal mutation strategy were given. The experimental results show that the method has good global optimization ability, and its overall effect is better than particle swarm optimization algorithm, genetic algorithm and random testing.

With the continuous deepening of scientific development and technological innovation, many algorithms have been derived from the research on robot path planning, including the current research on ant colony algorithm. It is often accompanied by a series of problems such as slow convergence speed, seeking optimal solutions according to local conditions, insufficient optimization ability, and inability to complement the diversity of ant colony species and convergence speed. In view of the current shortcomings, first, the initial pheromone distribution is uneven, which can avoid the useless search behavior trajectory of the ants during the movement process, thereby speeding up the solution speed and saving time; secondly, based on the advantages of the A* algorithm, the introduction into its algorithm The heuristic search function further improves the heuristic function of the traditional ant colony algorithm and maximizes the speed of the search. Considering the influence factors of energy consumption factors on the experiment in actual situations, a new heuristic function is formed by combining with traditional factors, a simulation environment is built, and the proposed method is verified and compared through a set of examples. The results show that the improved ant colony algorithm is in the optimal path. It has better performance in length and number of iterations, and has practical engineering significance for robot path planning.KeywordsAnt colony algorithmA* algorithmPath planningMATLAB simulation

Staircase evacuation is the major means of fire evacuation for current high-rise residential buildings. However, its feasibility may be questioned as more and more senior citizens live there in the future. The weakness in physical strength and mobility impairment of elderly people may impede the successful implementation of staircase evacuation. It is therefore reasonable to consider using elevators for overall evacuation in high-rise residential buildings. However, enhancing the fire protection of elevators and efficiently controlling the elevator-aided evacuation operations are two major difficulties for applying elevators in building fire evacuation. Recently, the use of smart control for building facility management has become a hot issue in built environment studies. An enabling solution for smart elevator-aided building fire evacuation (SEABFE) is proposed in this article. The solution supports the SEABFE by determining the safer and more efficient elevator-aided evacuation strategy based on real-time fire ground and evacuation progress on the scene. A simulated case study of fire evacuation in a typical high-rise residential building shows that the proposed SEABFE can be successfully performed. Apart from keeping the elevator operation safe, the planned elevator-aided evacuation strategy may save 38.0% of the time compared with the strategy using only staircases in the scene.

Collective data mining in the ant colony decision tree approach

The move towards high-rise buildings in metro cities to accommodate an increasing population has various cons. In high-rise buildings, fire is a huge disaster. According to global statistics on fire accidents in high-rise buildings, elderly persons are the most vulnerable, as they are less likely to respond swiftly and evacuate than other inhabitants. To address this concerns, this research will examine the behaviors of older occupants in high-rise buildings during a fire and their perceptions of egress components. The study also inquired the elderly to come up with disaster solutions based on their knowledge and experience. Environmental-behaviour research methods have been used to detect elderly issues in high-rise residential buildings in India. In this study, it was found that their vulnerability is a big factor in their lack of knowledge and awareness about fire, as well as their limited mobility, low vision, hearing loss, insecurities, and behaviour when there is an emergency. The study also revealed that the behaviour of the elderly is different from that of the rest of the people during fire. This entails taking into account the specific needs of the elderly during fire management. This research can further assist policymakers in upgrading fire safety regulations to make them more effective and inclusive.