scholarly journals Evacuation Planning Optimization Based on a Multi-Objective Artificial Bee Colony Algorithm

2019 ◽  
Vol 8 (3) ◽  
pp. 110 ◽  
Author(s):  
Olive Niyomubyeyi ◽  
Petter Pilesjö ◽  
Ali Mansourian
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Spatial Optimization ◽  
Evacuation Planning ◽  
Computational Time ◽  
Neighborhood Search ◽  
Multi Objective ◽  
Bee Colony ◽  
Fitness Value ◽  
Conflicting Objectives

Evacuation is an important activity for reducing the number of casualties and amount of damage in disaster management. Evacuation planning is tackled as a spatial optimization problem. The decision-making process for evacuation involves high uncertainty, conflicting objectives, and spatial constraints. This study presents a Multi-Objective Artificial Bee Colony (MOABC) algorithm, modified to provide a better solution to the evacuation problem. The new approach combines random swap and random insertion methods for neighborhood search, the two-point crossover operator, and the Pareto-based method. For evacuation planning, two objective functions were considered to minimize the total traveling distance from an affected area to shelters and to minimize the overload capacity of shelters. The developed model was tested on real data from the city of Kigali, Rwanda. From computational results, the proposed model obtained a minimum fitness value of 5.80 for capacity function and 8.72 × 108 for distance function, within 161 s of execution time. Additionally, in this research we compare the proposed algorithm with Non-Dominated Sorting Genetic Algorithm II and the existing Multi-Objective Artificial Bee Colony algorithm. The experimental results show that the proposed MOABC outperforms the current methods both in terms of computational time and better solutions with minimum fitness values. Therefore, developing MOABC is recommended for applications such as evacuation planning, where a fast-running and efficient model is needed.

scholarly journals A Comparative Study of Four Metaheuristic Algorithms, AMOSA, MOABC, MSPSO, and NSGA-II for Evacuation Planning

Algorithms ◽  
2020 ◽  
Vol 13 (1) ◽  
pp. 16 ◽  
Author(s):  
Olive Niyomubyeyi ◽  
Tome Eduardo Sicuaio ◽  
José Ignacio Díaz González ◽  
Petter Pilesjö ◽  
Ali Mansourian
Keyword(s):  
Urban Communities ◽  
Spatial Optimization ◽  
Metaheuristic Algorithms ◽  
Evacuation Planning ◽  
Computational Time ◽  
Nsga Ii ◽  
Multi Objective ◽  
Bee Colony ◽  
Spatial Objectives ◽  
High Level

Evacuation planning is an important activity in disaster management to reduce the effects of disasters on urban communities. It is regarded as a multi-objective optimization problem that involves conflicting spatial objectives and constraints in a decision-making process. Such problems are difficult to solve by traditional methods. However, metaheuristics methods have been shown to be proper solutions. Well-known classical metaheuristic algorithms—such as simulated annealing (SA), artificial bee colony (ABC), standard particle swarm optimization (SPSO), genetic algorithm (GA), and multi-objective versions of them—have been used in the spatial optimization domain. However, few types of research have applied these classical methods, and their performance has not always been well evaluated, specifically not on evacuation planning problems. This research applies the multi-objective versions of four classical metaheuristic algorithms (AMOSA, MOABC, NSGA-II, and MSPSO) on an urban evacuation problem in Rwanda in order to compare the performances of the four algorithms. The performances of the algorithms have been evaluated based on the effectiveness, efficiency, repeatability, and computational time of each algorithm. The results showed that in terms of effectiveness, AMOSA and MOABC achieve good quality solutions that satisfy the objective functions. NSGA-II and MSPSO showed third and fourth-best effectiveness. For efficiency, NSGA-II is the fastest algorithm in terms of execution time and convergence speed followed by AMOSA, MOABC, and MSPSO. AMOSA, MOABC, and MSPSO showed a high level of repeatability compared to NSGA-II. It seems that by modifying MOABC and increasing its effectiveness, it could be a proper algorithm for evacuation planning.

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Elite-guided multi-objective artificial bee colony algorithm

2015 ◽  
Vol 32 ◽  
pp. 199-210 ◽  
Author(s):  
Ying Huo ◽  
Yi Zhuang ◽  
Jingjing Gu ◽  
Siru Ni
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Multi Objective ◽  
Bee Colony
Sign in / Sign up

Export Citation Format

Share Document