Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  studies the idea of separating the explored and unexplored regions in the search space to improve change detection and optima tracking. When an optimum is found, a simple sampling technique is used to estimate the basin of attraction of that optimum. This estimated basin is marked as an area already explored. Using a special tree-based data structure named KD-Tree to divide the search space, all explored areas can be separated from unexplored areas. Given such a division, the algorithm can focus more on searching for unexplored areas, spending only minimal resource on monitoring explored areas to detect changes in explored regions. The experiments show that the proposed algorithm has competitive performance, especially when change detection is taken into account in the optimisation process. The new algorithm was proved to have less computational complexity in term of identifying the appropriate sub-population/region for each individual.  also carry out investigations to find out why the algorithm performs ll. These investigations reveal a positive impact of using the KD-Tree.
['Trung Thanh Nguyen', 'Ian Jenkinson', 'Zaili Yang']
I am writing a research paper on a idea An experimental study of combining evolutionary algorithms with KD-tree to solving dynamic optimisation problems
[{"from": "human", "value": "I am writing a research paper on a idea An experimental study of combining evolutionary algorithms with KD-tree to solving dynamic optimisation problems"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  studies the idea of separating the explored and unexplored regions in the search space to improve change detection and optima tracking. When an optimum is found, a simple sampling technique is used to estimate the basin of attraction of that optimum. This estimated basin is marked as an area already explored. Using a special tree-based data structure named KD-Tree to divide the search space, all explored areas can be separated from unexplored areas. Given such a division, the algorithm can focus more on searching for unexplored areas, spending only minimal resource on monitoring explored areas to detect changes in explored regions. The experiments show that the proposed algorithm has competitive performance, especially when change detection is taken into account in the optimisation process. The new algorithm was proved to have less computational complexity in term of identifying the appropriate sub-population/region for each individual.  also carry out investigations to find out why the algorithm performs ll. These investigations reveal a positive impact of using the KD-Tree."}]