A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization
Abstract Bi-Level Optimization Problems (BLOPs) are a class of challenging problems with
two levels of optimization tasks. The main goal is to optimize the upper level problem which …
two levels of optimization tasks. The main goal is to optimize the upper level problem which …
[PDF][PDF] Swarm computational intelligence design for a high integrity protection system
The search meta-heuristic procedure that mimics the process of biological natural selection
is an embedded part of artificial intelligence (AI). This is regularly used for obtaining the …
is an embedded part of artificial intelligence (AI). This is regularly used for obtaining the …
[PDF][PDF] Mean Field Annealing for Pattern Classification using different response functions: A Comparative Approach.
H Rady - Journal of the ACS, 2010 - asc.journals.ekb.eg
Mean Field Annealing (MFA) merges collective computation and annealingproperties of
Hopfield Neural Networks (HNN) and Stochastic SimulatedAnnealing (SSA), respectively, to …
Hopfield Neural Networks (HNN) and Stochastic SimulatedAnnealing (SSA), respectively, to …
[PDF][PDF] Stochastic Simulated Annealing Algorithms using Different Annealing Schedules: An Analytical Approach
H Rady - Journal of the ACS, 2010 - journals.ekb.eg
Simulated Annealing is one of the most important meta-heuristics or
generalpurposealgorithms of combinatorial optimization, due to its convergence …
generalpurposealgorithms of combinatorial optimization, due to its convergence …