Transiently chaotic simulated annealing based on intrinsic nonlinearity of memristors for efficient solution of optimization problems
Optimization problems are ubiquitous in scientific research, engineering, and daily lives.
However, solving a complex optimization problem often requires excessive computing …
However, solving a complex optimization problem often requires excessive computing …
A noisy chaotic neural network for solving combinatorial optimization problems: Stochastic chaotic simulated annealing
L Wang, S Li, F Tian, X Fu - IEEE Transactions on Systems …, 2004 - ieeexplore.ieee.org
Recently Chen and Aihara have demonstrated both experimentally and mathematically that
their chaotic simulated annealing (CSA) has better search ability for solving combinatorial …
their chaotic simulated annealing (CSA) has better search ability for solving combinatorial …
Chaos engineering and its application to parallel distributed processing with chaotic neural networks
K Aihara - Proceedings of the IEEE, 2002 - ieeexplore.ieee.org
Chaotic dynamics and its possible applications are considered from the viewpoint of
engineering. Various applications, even to consumer products such as household …
engineering. Various applications, even to consumer products such as household …
[HTML][HTML] An optimization algorithm based on chaotic behavior and fractal nature
MS Tavazoei, M Haeri - Journal of Computational and Applied Mathematics, 2007 - Elsevier
In this paper, we propose a new optimization technique by modifying a chaos optimization
algorithm (COA) based on the fractal theory. We first implement the weighted gradient …
algorithm (COA) based on the fractal theory. We first implement the weighted gradient …
A new optimization algorithm based on chaos
H Lu, H Zhang, L Ma - Journal of Zhejiang University-Science A, 2006 - Springer
In this article, some methods are proposed for enhancing the converging velocity of the COA
(chaos optimization algorithm) based on using carrier wave two times, which can greatly …
(chaos optimization algorithm) based on using carrier wave two times, which can greatly …
A unified framework for chaotic neural-network approaches to combinatorial optimization
T Kwok, KA Smith - IEEE Transactions on Neural networks, 1999 - ieeexplore.ieee.org
As an attempt to provide an organized way to study the chaotic structures and their effects in
solving combinatorial optimization with chaotic neural networks (CNN), a unifying framework …
solving combinatorial optimization with chaotic neural networks (CNN), a unifying framework …
Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework
T Kwok, KA Smith - Neural Networks, 2000 - Elsevier
The aim of this paper is to study both the theoretical and experimental properties of chaotic
neural network (CNN) models for solving combinatorial optimization problems. Previously …
neural network (CNN) models for solving combinatorial optimization problems. Previously …
Imperialist competitive algorithm using chaos theory for optimization (CICA)
The Imperialist Competitive Algorithm (ICA) that was recently introduced has shown its good
performance in optimization problems. This novel optimization algorithm is inspired by socio …
performance in optimization problems. This novel optimization algorithm is inspired by socio …
基于多目标混沌优化算法的水资源配置研究
黄显峰, 邵东国, 顾文权, 代涛 - 水利学报, 2008 - jhe.ches.org.cn
本文将多目标混沌优化算法, 应用于水资源优化配置中, 该方法将多目标属性与混沌遍历性耦合
起来, 将混沌序列放大到优化变量的取值范围进行迭代寻优, 避免了搜索过程陷入局部极小点 …
起来, 将混沌序列放大到优化变量的取值范围进行迭代寻优, 避免了搜索过程陷入局部极小点 …
Global bifurcation structure of chaotic neural networks and its application to traveling salesman problems
I Tokuda, T Nagashima, K Aihara - Neural Networks, 1997 - Elsevier
This paper studies global bifurcation structure of the chaotic neural networks applied to
solve the traveling salesman problem (TSP). The bifurcation analysis clarifies the dynamical …
solve the traveling salesman problem (TSP). The bifurcation analysis clarifies the dynamical …