NDLI: Non-revisiting Genetic Algorithm with Constant Memory

Content Provider	IEEE Xplore Digital Library
Author	Yang Lou Shiu Yin Yuen
Copyright Year	2015
Description	Author affiliation: Dept. of Electron. Eng., City Univ. of Hong Kong, Hong Kong, China (Yang Lou; Shiu Yin Yuen)
Abstract	The continuous Non-revisiting Genetic Algorithm (cNrGA) uses the entire search history and parameter-less adaptive mutation to significantly enhance search performance. Experimental results show that it has better performance than Covariance Matrix Adaptation Evolution Strategy (CMA-ES), a state of the art evolutionary algorithm. Storing the search history is natural and costs little when fitness evaluations are expensive. However, if the number of evaluations required is substantial, some memory management is desirable. In this paper, we propose two pruning mechanisms to keep the memory used constant. They are Random pruning and Least Recently Used pruning. The idea is to prune a node when a memory threshold is reached and a new node is required to be inserted, thus keeping the overall memory used constant. Experimental results show that both strategies can maintain the performance of cNrGA, up to the limit when 90% of the nodes are not recorded. This suggests that cNrGA can be extended to use in situations when the number of fitness evaluations are much larger than before with no significant effect on statistical performance, which widens the applicability of cNrGA to include more practical problems that require larger number of fitness evaluations before converging to the global optimum.
Starting Page	1714
Ending Page	1719
File Size	226669
Page Count	6
File Format	PDF
e-ISBN	9781479986972
DOI	10.1109/SMC.2015.301
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-10-09
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	History Memory management Evolutionary computation Genetic algorithms Cities and towns Covariance matrices Partitioning algorithms binary space partition tree Non-revisiting genetic algorithms least recently used pruning random pruning
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Non-revisiting genetic algorithm with adaptive mutation using constant memory

Continuous non-revisiting genetic algorithm

Continuous non-revisiting genetic algorithm with overlapped search sub-region

A non-revisiting Genetic Algorithm

Fixed, random or fuzzy adaptive parameters in an evolutionary algorithm

Hyperspectral image segmentation using Binary Partition Trees

Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation

Representational redundancy in evolutionary algorithms

Parallel Model of Evolutionary Computing Based on Genetic Algorithm

Non-revisiting Genetic Algorithm with Constant Memory

Similar Documents

Non-revisiting genetic algorithm with adaptive mutation using constant memory

Continuous non-revisiting genetic algorithm

Continuous non-revisiting genetic algorithm with overlapped search sub-region

A non-revisiting Genetic Algorithm

Fixed, random or fuzzy adaptive parameters in an evolutionary algorithm

Hyperspectral image segmentation using Binary Partition Trees

Continuous non-revisiting genetic algorithm with random search space re-partitioning and one-gene-flip mutation

Representational redundancy in evolutionary algorithms

Parallel Model of Evolutionary Computing Based on Genetic Algorithm

Non-revisiting Genetic Algorithm with Constant Memory