File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/CEC.2007.4425072
- Scopus: eid_2-s2.0-55749094180
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A non-revisiting genetic algorithm
Title | A non-revisiting genetic algorithm |
---|---|
Authors | |
Issue Date | 2007 |
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 2007 IEEE Congress on Evolutionary Computation (CEC 2007), Singapore, 25-28 September 2007. In IEEE Transactions on Evolutionary Computation, 2007, p. 4583-4590 How to Cite? |
Abstract | Genetic Algorithm (GA) is a revisiting stochastic algorithm. In other words, a solution that has been visited before may be revisited. The fitness of the solution has to be evaluated each time. Since fitness evaluation is the most computationally intensive process in the execution of the GA, revisits should be minimized or eliminated. In this paper, a novel dynamic binary partitioning tree archive is proposed to eliminate all revisits. It works as follows: When the GA generates a solution, the tree is accessed. A leaf node is appended to the tree if the solution has not been visited before and so has no record in the tree. Otherwise, a search is initiated from the leaf node that is the duplicate to the solution to find the nearest neighbor solution in the search space that is not visited. During this process, whole sub-trees may be pruned if all the leaf nodes it contains are visited. The search naturally implements a self adaptive mutation mechanism. Hence the GA requires no other mutation parameter or mutation scheme. Experimental results reveal that this new GA is superior in performance compared with the standard GA with revisits, and the tree archive is not memory intensive. © 2007 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/196701 |
ISBN | |
ISSN | 2023 Impact Factor: 11.7 2023 SCImago Journal Rankings: 5.209 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yuen, SY | - |
dc.contributor.author | Chow, CK | - |
dc.date.accessioned | 2014-04-24T02:10:34Z | - |
dc.date.available | 2014-04-24T02:10:34Z | - |
dc.date.issued | 2007 | - |
dc.identifier.citation | The 2007 IEEE Congress on Evolutionary Computation (CEC 2007), Singapore, 25-28 September 2007. In IEEE Transactions on Evolutionary Computation, 2007, p. 4583-4590 | - |
dc.identifier.isbn | 978-1-4244-1339-3 | - |
dc.identifier.issn | 1089-778X | - |
dc.identifier.uri | http://hdl.handle.net/10722/196701 | - |
dc.description.abstract | Genetic Algorithm (GA) is a revisiting stochastic algorithm. In other words, a solution that has been visited before may be revisited. The fitness of the solution has to be evaluated each time. Since fitness evaluation is the most computationally intensive process in the execution of the GA, revisits should be minimized or eliminated. In this paper, a novel dynamic binary partitioning tree archive is proposed to eliminate all revisits. It works as follows: When the GA generates a solution, the tree is accessed. A leaf node is appended to the tree if the solution has not been visited before and so has no record in the tree. Otherwise, a search is initiated from the leaf node that is the duplicate to the solution to find the nearest neighbor solution in the search space that is not visited. During this process, whole sub-trees may be pruned if all the leaf nodes it contains are visited. The search naturally implements a self adaptive mutation mechanism. Hence the GA requires no other mutation parameter or mutation scheme. Experimental results reveal that this new GA is superior in performance compared with the standard GA with revisits, and the tree archive is not memory intensive. © 2007 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 | ©2007 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 | A non-revisiting genetic algorithm | - |
dc.type | Conference_Paper | - |
dc.description.nature | published_or_final_version | - |
dc.identifier.doi | 10.1109/CEC.2007.4425072 | - |
dc.identifier.scopus | eid_2-s2.0-55749094180 | - |
dc.identifier.spage | 4583 | - |
dc.identifier.epage | 4590 | - |
dc.publisher.place | United States | - |
dc.customcontrol.immutable | sml 160602 amended | - |
dc.identifier.issnl | 1089-778X | - |