File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CEC.2010.5586046
- Scopus: eid_2-s2.0-79959466837
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation
Title | Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation |
---|---|
Authors | |
Issue Date | 2010 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235 |
Citation | The 6th IEEE World Congress on Computational Intelligence cum IEEE Congress on Evolutionary Computation (WCCI-CEC 2010), Barcelona, Spain, 18-23 July 2010. In IEEE Transactions on Evolutionary Computation, 2010, p. 1-8 How to Cite? |
Abstract | In continuous non-revisiting genetic algorithm (cNrGA), the solution set with different order leads to different density estimation and hence different mutation step size. As a result, the performance of cNrGA depends on the order of the evaluated solutions. In this paper, we propose to remove this dependence by a search space re-partitioning strategy. At each iteration, the strategy re-shuffles the solutions into random order. The re-ordered sequence is then used to construct a new density tree, which leads to a new space partition sets. Afterwards, instead of randomly picking a mutant within a partition, a new adaptive one-gene-flip mutation is applied. Motivated from the fact that the proposed adaptive mutation concerns only small amount of partitions, we propose a new density tree construction algorithm. This algorithm refuses to partition the sub-regions which do not contain any individual to be mutated, which simplifies the tree topology as well as speeds up the construction time. The new cNrGA integrated with the proposed re-partitioning strategy (cNrGA/RP/OGF) is examined on 19 benchmark functions at dimensions ranging from 2 to 40. The simulation results show that cNrGA/RP/OGF is significantly superior to the original cNrGA at most of the test functions. Its average performance is also better than those of six benchmark EAs. © 2010 IEEE. |
Description | Special Session on Evolutionary Computer Vision |
Persistent Identifier | http://hdl.handle.net/10722/196678 |
ISBN | |
ISSN | 2023 Impact Factor: 11.7 2023 SCImago Journal Rankings: 5.209 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chow, CK | - |
dc.contributor.author | Yuen, SY | - |
dc.date.accessioned | 2014-04-24T02:10:33Z | - |
dc.date.available | 2014-04-24T02:10:33Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | The 6th IEEE World Congress on Computational Intelligence cum IEEE Congress on Evolutionary Computation (WCCI-CEC 2010), Barcelona, Spain, 18-23 July 2010. In IEEE Transactions on Evolutionary Computation, 2010, p. 1-8 | - |
dc.identifier.isbn | 978-1-4244-6909-3 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.uri | http://hdl.handle.net/10722/196678 | - |
dc.description | Special Session on Evolutionary Computer Vision | - |
dc.description.abstract | In continuous non-revisiting genetic algorithm (cNrGA), the solution set with different order leads to different density estimation and hence different mutation step size. As a result, the performance of cNrGA depends on the order of the evaluated solutions. In this paper, we propose to remove this dependence by a search space re-partitioning strategy. At each iteration, the strategy re-shuffles the solutions into random order. The re-ordered sequence is then used to construct a new density tree, which leads to a new space partition sets. Afterwards, instead of randomly picking a mutant within a partition, a new adaptive one-gene-flip mutation is applied. Motivated from the fact that the proposed adaptive mutation concerns only small amount of partitions, we propose a new density tree construction algorithm. This algorithm refuses to partition the sub-regions which do not contain any individual to be mutated, which simplifies the tree topology as well as speeds up the construction time. The new cNrGA integrated with the proposed re-partitioning strategy (cNrGA/RP/OGF) is examined on 19 benchmark functions at dimensions ranging from 2 to 40. The simulation results show that cNrGA/RP/OGF is significantly superior to the original cNrGA at most of the test functions. Its average performance is also better than those of six benchmark EAs. © 2010 IEEE. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=4235 | - |
dc.relation.ispartof | IEEE Transactions on Evolutionary Computation | - |
dc.rights | ©2010 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.title | Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation | - |
dc.type | Conference_Paper | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/CEC.2010.5586046 | - |
dc.identifier.scopus | eid_2-s2.0-79959466837 | - |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 8 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 160603 amended | - |
dc.identifier.issnl | 1089-778X | - |