| dc.description.abstract | In this paper, we present a unique approach to solve the Neutralization of Conflict
Areas problem using an Ant Colony Optimization technique. The Neutralization of
Conflict Areas is a known problem, and over the years, considerable research has been
conducted to find strategies [7] to solve the problem. To effectively deal with this kind of
problem, many search algorithms and techniques have been proposed. The Ant Colony
Optimization technique has been very successful in solving problems such as the travelling
salesman problem, vehicle routing problem, and routing and scheduling problems. The
suggested approach to the problem presented here is to find routes for conflict areas and
then neutralize the conflict areas. To find routes to conflict areas, we used the concept of a
Dynamic Source Routing protocol. To find the shortest paths, we used the Ant Colony
Optimization technique. The goal of this paper is to suggest a swarm-based approach to
find conflict areas, neutralize conflict areas, and recruit help from other resource units
when needed to neutralize conflict areas.
The proposed solution has been implemented in a simulator. We simulate how two
different sets of cooperating ants called explorer ants and worker ants, with different
operational abilities work together in finding and neutralizing conflict areas and also in
getting help from other resources areas. The solution can be visualized using a graphical
user interface. The framework that we implement will allow for experimentation with a
wide variety of experimental parameters. | en_US |
