Pseudorandomness in Central Force Optimization

@article{Formato2010PseudorandomnessIC,
  title={Pseudorandomness in Central Force Optimization},
  author={Richard A. Formato},
  journal={ArXiv},
  year={2010},
  volume={abs/1001.0317}
}
  • R. Formato
  • Published 2 January 2010
  • Computer Science
  • ArXiv
Central Force Optimization is a deterministic metaheuristic for an evolutionary algorithm that searches a decision space by flying probes whose trajectories are computed using a gravitational metaphor. CFO benefits substantially from the inclusion of a pseudorandom component (a numerical sequence that is precisely known by specification or calculation but otherwise arbitrary). The essential requirement is that the sequence is uncorrelated with the decision space topology, so that its effect is… 
View PDF on arXiv
27 Citations
Highly Influential Citations
1
Background Citations
6
Methods Citations
5

Figures and Tables from this paper

27 Citations

Neighborhood topologies in central force optimization
  • Robert C. Green
  • Computer Science
    2017 IEEE Symposium Series on Computational Intelligence (SSCI)
  • 2017
TLDR
Use of different neighborhood topologies on the computation time, functional evaluations, probe corrections, solution quality, convergence, and parameter selection of the CFO algorithm produces results that are very similar to those of the Standard or Fully Connected topology commonly used with CFO.
A multi-start central force optimization for global optimization
Parameter-Free Deterministic Global Search with Central Force Optimization
TLDR
A parameter-free implementation of Central Force Optimization for deterministic multidimensional search and optimization with hardwired internal parameters so that none is user-specified.
Central force optimization on a GPU: a case study in high performance metaheuristics
TLDR
This study presents the first parallel implementation of CFO on a Graphics Processing Unit (GPU) using the NVIDIA Compute Unified Device Architecture (CUDA) and demonstrates substantial speedups depending on problem size and complexity.
π Fraction-Based Optimization of the PBM Antenna Benchmarks
  • R. Formato
  • Computer Science
    Decision Science in Action
  • 2018
TLDR
The utility of π fractions is illustrated by using them in two different optimizers, one deterministic and the other probabilistic, which are applied with quite good results to the PBM antenna benchmarks, a set of difficult real-world engineering problems, thereby demonstrating the utility ofπ fractions in all types of optimizers.
Central Force Optimization on a GPU: A case study in high performance metaheuristics using multiple topologies
TLDR
This work has implemented the concept of local neighborhoods and implemented CFO on a Graphics Processing Unit (GPU) using the NVIDIA Compute Unified Device Architecture (CUDA) extensions for C/C++ to decrease CFO's computational time.
Comparative Results: Group Search Optimizer and Central Force Optimization
This note compares the performance of two multidimensional search and optimization algorithms: Group Search Optimizer and Central Force Optimization. GSO is a new state-of-the-art algorithm that has…
Synthesis of unequally-spaced linear array using modified central force optimisation algorithm
TLDR
The comparison of the simulations of different algorithms shows that the MCFO technique is superior to other evolutionary algorithms such as the genetic algorithm, ant colony optimisation, PSO algorithm, and gravitational search algorithm, as well as other improved CFO algorithms.
Intelligent State Space Pruning with local search for power system reliability evaluation
TLDR
This paper focuses on the presentation of a binary version of the deterministic Central Force Optimization (CFO) optimization algorithm and a discussion of the role that ISSP may play in the reliability evaluation of the smart grid.
Training neural networks using Central Force Optimization and Particle Swarm Optimization: Insights and comparisons
...
...

References

SHOWING 1-5 OF 5 REFERENCES
Evolutionary programming made faster
TLDR
A "fast EP" (FEP) is proposed which uses a Cauchy instead of Gaussian mutation as the primary search operator and is proposed and tested empirically, showing that IFEP performs better than or as well as the better of FEP and CEP for most benchmark problems tested.
Locating and tracking multiple dynamic optima by a particle swarm model using speciation
This paper proposes an improved particle swarm optimizer using the notion of species to determine its neighborhood best values for solving multimodal optimization problems and for tracking multiple…
A FAST PARTICLE SWARM OPTIMIZATION
TLDR
This paper introduces a new "fast particle swarm optimization" (FPSO) that does not evaluate all new positions owning a fitness and associated reliability value of each particle of the swarm and the reliability value is only evaluated using the true fitness function if the reliabilityvalue is below a threshold.
A novel optimization algorithm: space gravitational optimization
TLDR
The proposed algorithm is based on the Einstein's general theory of relativity, which utilizes the concept of gravitational field to search for the global optimal solution for a given problem.
a, k AS EXT LOCAL i%, m% a = 10## : k = 100## : m% = 4 '[NOTE IN CORRECTION 02-03-2010: Coefficient “a” was incorrectly set to 5 in the original version
  • LOCAL Offset,
  • 2010