Chaotic Arc Adaptive Grasshopper Optimization
نویسندگان
چکیده
منابع مشابه
Adaptive annealing for chaotic optimization
The chaotic simulated annealing algorithm for combinatorial optimization problems is examined in the light of the global bifurcation structure of the chaotic neural networks. We show that the result of the chaotic simulated annealing algorithm is primarily dependent upon the global bifurcation structure of the chaotic neural networks and unlike the stochastic simulated annealing infinitely slow...
متن کاملMulti-objective Grasshopper Optimization Algorithm based Reconfiguration of Distribution Networks
Network reconfiguration is a nonlinear optimization procedure which calculates a radial structure to optimize the power losses and improve the network reliability index while meeting practical constraints. In this paper, a multi-objective framework is proposed for optimal network reconfiguration with the objective functions of minimization of power losses and improvement of reliability index. T...
متن کاملThe Case for Chaotic Adaptive
| Chaotic routers are randomizing, non-minimal adaptive packet routers designed for use in the communication networks of parallel computers. Chaotic routers combine the exibility found in adaptive routing with a design simple enough to be competitive with the most streamlined oblivious routers. We review chaotic routing and compare it with other contemporary network routing approaches, includin...
متن کاملAn Adaptive Chaotic Neural Network
The non-linear dynamics of a chaotic attractor offer a number of useful features to the developer of neuromorphic systems. Included in these is the ability for efficient memory storage and recall. A chaotic attractor has a potentially infinite number of Unstable Periodic Orbits (UPO) embedded within it. These orbits can be stabilised with the application of delayed feedback inhibition. This res...
متن کاملMaintaining Arc Consistency using Adaptive Domain Ordering
Solving a Constraint Satisfaction Problem (CSP) by Maintaining Arc Consistency (MAC) [Sabin and Freuder, 1994] has been one of the most widely-used methods. Since Arc Consistency (AC) is enforced at every node in a search tree, its efficiency is critical to the whole algorithm. We propose a new MAC algorithm based on AC-3.1 [Zhang and Yap, 2001] in which the AC component is capable of starting ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: 2169-3536
DOI: 10.1109/access.2021.3052800