An ant system algorithm for the neutralization problem

Authors:
Ramazan Algin;Ali Fuat Alkaya;Vural Aksakalli;Dindar Öz
Affiliations:
Department of Computer Engineering, Marmara University, Istanbul, Turkey;Department of Computer Engineering, Marmara University, Istanbul, Turkey;Department of Industrial Engineering, Istanbul Sehir University, Istanbul, Turkey;Department of Computer Engineering, Marmara University, Istanbul, Turkey
Venue:
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Year:
2013

Citing 5
Cited 0

Ant Colony Optimization

Ant Colony Optimization
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Disambiguation Protocols Based on Risk Simulation

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Performance evaluation of constraint-based path selection algorithms

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a path planning problem wherein an agent needs to safely and swiftly navigate from a given source location to a destination through an arrangement of disk-shaped obstacles. The agent possesses a limited neutralization capability in the sense that it can neutralize a certain number of obstacles enroute and pass through them safely upon neutralization. Optimal utilization of such a capability is called the neutralization problem. This problem is essentially a shortest path problem with resource constraints, which has been shown to be NP-Hard except for some trivial variants. In this study, we propose an ant system algorithm for the neutralization problem. In the proposed algorithm, the state transition rule makes use of certain problem-specific information to guide the ants. We show how the parameters of the algorithm can be fine-tuned for enhanced performance and we present limited computational experiments including a real-world naval minefield dataset. Our experiments suggest that the proposed algorithm finds high quality solutions in general with reasonable computational resources.