Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Inherent part of evolutionary algorithms that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes that are used in every evolutionary algorithm like ge- netic algorithms etc.   present experiments (based on our previous) of selected evolutionary algorithms and test functions demon- strating impact of non-random generators on performance of the evolu- tionary algorithms. In our experiments  used differential evolution and SOMA algorithms with functions Griewangk and Rastrigin.  use n pe- riodical deterministic processes (based on deterministic chaos principles) instead of pseudorandom number generators and compare performance of evolutionary algorithms pored by those processes and by pseudo- random number generators. Results presented here has to be understand like numerical demonstration rather than mathematical proofs. Our re- sults (reported sooner and here) suggest hypothesis that certain class of deterministic processes can be used instead of random number generators without loring the performance of evolutionary algorithms.
['Ivan Zelinka', 'Donald Davendra', 'Roman Senkerik', 'Michal Pluhacek', 'Zuzana Kominkova Oplatkova']
I am writing a research paper on a idea On Convergence of Evolutionary Algorithms Powered by Non-random Generators
[{"from": "human", "value": "I am writing a research paper on a idea On Convergence of Evolutionary Algorithms Powered by Non-random Generators"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Inherent part of evolutionary algorithms that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes that are used in every evolutionary algorithm like ge- netic algorithms etc.   present experiments (based on our previous) of selected evolutionary algorithms and test functions demon- strating impact of non-random generators on performance of the evolu- tionary algorithms. In our experiments  used differential evolution and SOMA algorithms with functions Griewangk and Rastrigin.  use n pe- riodical deterministic processes (based on deterministic chaos principles) instead of pseudorandom number generators and compare performance of evolutionary algorithms pored by those processes and by pseudo- random number generators. Results presented here has to be understand like numerical demonstration rather than mathematical proofs. Our re- sults (reported sooner and here) suggest hypothesis that certain class of deterministic processes can be used instead of random number generators without loring the performance of evolutionary algorithms."}]