ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem

Anton Duca, Ibrahim Hameed

Abstract

The paper proposes and studies the efficiency of the ant colony optimization (ACO) algorithms for solving an inverse problem in non-destructive electromagnetic testing (NDET). The inverse problem, which consists in finding the shape and parameters of cracks in conducting plates starting from the signal of an eddy current testing (ECT) probe, is formulated as a discrete optimization problem. Two of the most widely known ant algorithms are adapted and applied to solve the optimization problem. The influence over the optimization algorithms performances of some problem specific local search strategies is also analyzed.

Download


Paper Citation