A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space

Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing effor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on magnetics 2015-03, Vol.51 (3), p.1-4
Hauptverfasser: Ho, Siu Lau, Zhu, Linhang, Yang, Shiyou, Huang, Jin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 4
container_issue 3
container_start_page 1
container_title IEEE transactions on magnetics
container_volume 51
creator Ho, Siu Lau
Zhu, Linhang
Yang, Shiyou
Huang, Jin
description Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper.
doi_str_mv 10.1109/TMAG.2014.2358628
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TMAG_2014_2358628</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7093614</ieee_id><sourcerecordid>3703447691</sourcerecordid><originalsourceid>FETCH-LOGICAL-c245t-dd1e1f5630ddca7e74ffdf5883a24dac4de99ef91b778920bd2e13a413f204f3</originalsourceid><addsrcrecordid>eNo9kMFKAzEQhoMoWKsPIF4WPG_NJNnd5FiL1kLFor15WNLNRLZsk5rsCr69KS2ehpn5_hn4CLkFOgGg6mH9Op1PGAUxYbyQJZNnZARKQE5pqc7JiFKQuRKluCRXMW5TKwqgI_I5zd5Rd9nMGzTZyu-HTvetd_mjjmmwcE3AHbo-IUvUwbXuK7M-pMUPhojZKvhNh7uYtS7dcH3rBj_E7GOvG7wmF1Z3EW9OdUzWz0_r2Uu-fJsvZtNl3jBR9LkxgGCLklNjGl1hJaw1tpCSayaMboRBpdAq2FSVVIxuDEPgWgC3jArLx-T-eHYf_PeAsa-3fggufayhlAWTShQ8UXCkmuBjDGjrfWh3OvzWQOuDwvqgsD4orE8KU-bumGkR8Z-vqOIlCP4H4_ttWg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1685289453</pqid></control><display><type>article</type><title>A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space</title><source>IEEE Electronic Library (IEL)</source><creator>Ho, Siu Lau ; Zhu, Linhang ; Yang, Shiyou ; Huang, Jin</creator><creatorcontrib>Ho, Siu Lau ; Zhu, Linhang ; Yang, Shiyou ; Huang, Jin</creatorcontrib><description>Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper.</description><identifier>ISSN: 0018-9464</identifier><identifier>EISSN: 1941-0069</identifier><identifier>DOI: 10.1109/TMAG.2014.2358628</identifier><identifier>CODEN: IEMGAQ</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Evolutionary computation ; Genetic algorithms ; Inverse problems ; Magnetism ; Optimization ; Search problems ; Sociology ; Statistics</subject><ispartof>IEEE transactions on magnetics, 2015-03, Vol.51 (3), p.1-4</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2015</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c245t-dd1e1f5630ddca7e74ffdf5883a24dac4de99ef91b778920bd2e13a413f204f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7093614$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7093614$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ho, Siu Lau</creatorcontrib><creatorcontrib>Zhu, Linhang</creatorcontrib><creatorcontrib>Yang, Shiyou</creatorcontrib><creatorcontrib>Huang, Jin</creatorcontrib><title>A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space</title><title>IEEE transactions on magnetics</title><addtitle>TMAG</addtitle><description>Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper.</description><subject>Evolutionary computation</subject><subject>Genetic algorithms</subject><subject>Inverse problems</subject><subject>Magnetism</subject><subject>Optimization</subject><subject>Search problems</subject><subject>Sociology</subject><subject>Statistics</subject><issn>0018-9464</issn><issn>1941-0069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMFKAzEQhoMoWKsPIF4WPG_NJNnd5FiL1kLFor15WNLNRLZsk5rsCr69KS2ehpn5_hn4CLkFOgGg6mH9Op1PGAUxYbyQJZNnZARKQE5pqc7JiFKQuRKluCRXMW5TKwqgI_I5zd5Rd9nMGzTZyu-HTvetd_mjjmmwcE3AHbo-IUvUwbXuK7M-pMUPhojZKvhNh7uYtS7dcH3rBj_E7GOvG7wmF1Z3EW9OdUzWz0_r2Uu-fJsvZtNl3jBR9LkxgGCLklNjGl1hJaw1tpCSayaMboRBpdAq2FSVVIxuDEPgWgC3jArLx-T-eHYf_PeAsa-3fggufayhlAWTShQ8UXCkmuBjDGjrfWh3OvzWQOuDwvqgsD4orE8KU-bumGkR8Z-vqOIlCP4H4_ttWg</recordid><startdate>201503</startdate><enddate>201503</enddate><creator>Ho, Siu Lau</creator><creator>Zhu, Linhang</creator><creator>Yang, Shiyou</creator><creator>Huang, Jin</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>7U5</scope><scope>8BQ</scope><scope>8FD</scope><scope>JG9</scope><scope>L7M</scope></search><sort><creationdate>201503</creationdate><title>A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space</title><author>Ho, Siu Lau ; Zhu, Linhang ; Yang, Shiyou ; Huang, Jin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c245t-dd1e1f5630ddca7e74ffdf5883a24dac4de99ef91b778920bd2e13a413f204f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Evolutionary computation</topic><topic>Genetic algorithms</topic><topic>Inverse problems</topic><topic>Magnetism</topic><topic>Optimization</topic><topic>Search problems</topic><topic>Sociology</topic><topic>Statistics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ho, Siu Lau</creatorcontrib><creatorcontrib>Zhu, Linhang</creatorcontrib><creatorcontrib>Yang, Shiyou</creatorcontrib><creatorcontrib>Huang, Jin</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>METADEX</collection><collection>Technology Research Database</collection><collection>Materials Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on magnetics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ho, Siu Lau</au><au>Zhu, Linhang</au><au>Yang, Shiyou</au><au>Huang, Jin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space</atitle><jtitle>IEEE transactions on magnetics</jtitle><stitle>TMAG</stitle><date>2015-03</date><risdate>2015</risdate><volume>51</volume><issue>3</issue><spage>1</spage><epage>4</epage><pages>1-4</pages><issn>0018-9464</issn><eissn>1941-0069</eissn><coden>IEMGAQ</coden><abstract>Evolutionary algorithms (EAs) have become the standards and paradigms for solving inverse problems. However, their two inherited operations, namely, the crossover and mutation operations, are complicated and difficult, both in theory and in numerical implementations. In this regard, increasing efforts have been devoted to EAs which are based on probabilistic models (EAPMs) to overcome the shortcomings of available EAs. The population-based incremental learning (PBIL) is an EAPM; moreover, it can bridge the gap between machine learning and the EAs, hence enjoying several merits compared with other EAs. However, lukewarm efforts have been devoted to PBILs, especially the real coded PBILs, in the study of inverse problems in electromagnetics. In this regard, a novel real coded PBIL is being proposed in this paper. In the proposed real coded PBIL, a probability matrix is proposed to randomly generate a population, and the updating formulas for this probability matrix using the so far searched best solution and the best solution of the current population are introduced to strike a balance between convergence performance and solution quality. The proposed real coded PBIL algorithm is numerically experimented on several case studies and promising results are reported in this paper.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TMAG.2014.2358628</doi><tpages>4</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0018-9464
ispartof IEEE transactions on magnetics, 2015-03, Vol.51 (3), p.1-4
issn 0018-9464
1941-0069
language eng
recordid cdi_crossref_primary_10_1109_TMAG_2014_2358628
source IEEE Electronic Library (IEL)
subjects Evolutionary computation
Genetic algorithms
Inverse problems
Magnetism
Optimization
Search problems
Sociology
Statistics
title A Real Coded Population-Based Incremental Learning for Inverse Problems in Continuous Space
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T15%3A06%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Real%20Coded%20Population-Based%20Incremental%20Learning%20for%20Inverse%20Problems%20in%20Continuous%20Space&rft.jtitle=IEEE%20transactions%20on%20magnetics&rft.au=Ho,%20Siu%20Lau&rft.date=2015-03&rft.volume=51&rft.issue=3&rft.spage=1&rft.epage=4&rft.pages=1-4&rft.issn=0018-9464&rft.eissn=1941-0069&rft.coden=IEMGAQ&rft_id=info:doi/10.1109/TMAG.2014.2358628&rft_dat=%3Cproquest_RIE%3E3703447691%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1685289453&rft_id=info:pmid/&rft_ieee_id=7093614&rfr_iscdi=true