ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem

Anton Duca; Ibrahim Hameed

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem

Topics: Ant Colony Optimization ; Applications: Games and Entertainment Technologies, Evolutionary Robotics, Evolutionary Art and Design, Industrial and Real World applications, Computational Economics and Finance

In Proceedings of the 12th International Joint Conference on Computational Intelligence - Volume 0IJCCI, 115-122, 2020

Authors: Anton Duca ¹ and Ibrahim Hameed ²

Affiliations: ¹ Politehnica University of Bucharest, Faculty of Electrical Engineering, Bucharest, Romania ; ² NTNU University, Faculty of Information Technology and Electrical Engineering, Alesund, Norway

Keyword(s): Ant Algorithms, Optimization, Non-Destructive Electromagnetic Testing (NDET), Inverse Problems.

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.133.139.28

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Duca, A. and Hameed, I. (2020). ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem. In Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020) - ECTA; ISBN 978-989-758-475-6; ISSN 2184-3236, SciTePress, pages 115-122. DOI: 10.5220/0009980001150122

@conference{ecta20,
author={Anton Duca. and Ibrahim Hameed.},
title={ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem},
booktitle={Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020) - ECTA},
year={2020},
pages={115-122},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009980001150122},
isbn={978-989-758-475-6},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 12th International Joint Conference on Computational Intelligence (IJCCI 2020) - ECTA
TI - ACO Algorithms to Solve an Electromagnetic Discrete Optimization Problem
SN - 978-989-758-475-6
IS - 2184-3236
AU - Duca, A.
AU - Hameed, I.
PY - 2020
SP - 115
EP - 122
DO - 10.5220/0009980001150122
PB - SciTePress