Memetic Variation Local Search vs. Life-Time Learning in Electrical Impedance Tomography

Authors:
Jyri Leskinen;Ferrante Neri;Pekka Neittaanmäki
Affiliations:
Department of Mathematical Information Technology, Agora, University of Jyväskylä, (Agora), Finland FI-40014;Department of Mathematical Information Technology, Agora, University of Jyväskylä, (Agora), Finland FI-40014;Department of Mathematical Information Technology, Agora, University of Jyväskylä, (Agora), Finland FI-40014
Venue:
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Year:
2009

Citing 7
Cited 0

Electrical Impedance Tomography

SIAM Review
Real-coded memetic algorithms with crossover hill-climbing

Evolutionary Computation - Special issue on magnetic algorithms
Statistical inverse problems: discretization, model reduction and inverse crimes

Journal of Computational and Applied Mathematics - Special issue: Applied computational inverse problems
A genetic algorithm approach to image reconstruction in electricalimpedance tomography

IEEE Transactions on Evolutionary Computation
Meta-Lamarckian learning in memetic algorithms

IEEE Transactions on Evolutionary Computation
Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems

IEEE Transactions on Evolutionary Computation
A Fast Adaptive Memetic Algorithm for Online and Offline Control Design of PMSM Drives

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, various metaheuristics for a numerical optimization problem with application to Electric Impedance Tomography are tested and compared. The experimental setup is composed of a real valued Genetic Algorithm, the Differential Evolution, a self adaptive Differential Evolution recently proposed in literature, and two novel Memetic Algorithms designed for the problem under study. The two proposed algorithms employ different algorithmic philosophies in the field of Memetic Computing. The first algorithm integrates a local search into the operations of the offspring generation, while the second algorithm applies a local search to individuals already generated in the spirit of life-time learning. Numerical results show that the fitness landscape and difficulty of the optimization problem heavily depends on the geometrical configuration, as well the proposed Memetic Algorithms seem to be more promising when the geometrical conditions make the problem harder to solve.