• Corpus ID: 37224994

Central Force Optimization Applied to the PBM Suite of Antenna Benchmarks

@article{Formato2010CentralFO,
  title={Central Force Optimization Applied to the PBM Suite of Antenna Benchmarks},
  author={Richard A. Formato},
  journal={ArXiv},
  year={2010},
  volume={abs/1003.0221}
}
Central Force Optimization (CFO) is a new nature-inspired deterministic multi-dimensional search and optimization metaheuristic based on the metaphor of gravitational kinematics. CFO is applied to the PBM antenna benchmark suite and the results compared to published performance data for other optimization algorithms. CFO acquits itself quite well. CFO's gradient-like nature is discussed, and it is speculated that a "generalized hyperspace derivative" might be defined for optimization problems… 
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.
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.
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.
Implementing Central Force optimization on the Intel Xeon Phi
  • Thomas Charest, R. Green
  • Computer Science
    2020 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  • 2020
TLDR
Results show that parallelizing CFO provides promising speedup values from 5-35 on the multi-core CPU and 1-12 on the Intel Xeon Phi Co-processor.
π 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.
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 metaheuristic optimisation
Central Force Optimisation (CFO) is a nature-inspired conceptual framework with roots in gravitational kinematics, a branch of physics that models the motion of masses moving under the in uence of
Variable Z0 applied to the optimal design of multi-stub matching network and a meander monopole
Variable Z0, a new concept in antenna design and optimization, is applied to two optimization problems: a multi-stub matching network (MSMN) using biogeography-based optimization (BBO), and an ultra
Physics Based Metaheuristic Algorithms for Global Optimization
TLDR
All of the current physics based metaheuristic optimization algorithms have been searched, collected, and introduced with the performed studies.
...
...

References

SHOWING 1-10 OF 35 REFERENCES
CENTRAL FORCE OPTIMIZATION: A NEW META-HEURISTIC WITH APPLICATIONS IN APPLIED ELECTROMAGNETICS
Central Force Optimization (CFO) is a new deterministic multi-dimensional search metaheuristic based on the metaphor of gravitational kinematics. It models “probes” that “fly” through the decision
Central force optimization: A new deterministic gradient-like optimization metaheuristic
TLDR
The possibility of creating a new “hyperspace directional derivative” using the Unit Step function to create positive-definite “masses” in “CFO space” is suggested, suggesting that CFO merits further investigation.
Antenna benchmark performance and array synthesis using central force optimisation
Central force optimisation (CFO) is a new deterministic multi-dimensional search evolutionary algorithm (EA) inspired by gravitational kinematics. CFO is a simple technique that is still in its
Central force optimisation: a new gradient-like metaheuristic for multidimensional search and optimisation
  • R. Formato
  • Business
    Int. J. Bio Inspired Comput.
  • 2009
This paper introduces central force optimisation, a novel, nature-inspired, deterministic search metaheuristic for constrained multidimensional optimisation in highly multimodal, smooth, or
Improved Cfo Algorithm for Antenna Optimization
TLDR
An improved Central Force Optimization algorithm for antenna optimization is presented and exhibits excellent performance against recognized antenna benchmark problem specifically designed to evaluate optimization evolutionary algorithms for antenna applications.
AN IMPROVED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR PATTERN SYNTHESIS OF PHASED ARRAYS
TLDR
Simulation results show that the refined pinpointing search ability and the global search ability of the proposed IPSO are significantly improved when compared to the particle swarm optimization (PSO) and Genetic Algorithm (GA).
Linear Antenna Array Design with Use of Genetic, Memetic and Tabu Search Optimization Algorithms
TLDR
This paper presents efficient methods of genetic algorithm, memetic algorithm and tabu search algorithm for the synthesis of linear antenna design to optimize the spacings between the elements of the linear array to produce a radiation pattern with minimum SLL and null placement control.
Benchmark Antenna Problems for Evolutionary Optimization Algorithms
TLDR
The ability of the proposed test suite to find strong and weak points of any EA is illustrated by a complete study of four broadly used evolutionary algorithms carried out with the aid of the new test functions.
Resonant returns to close approaches: Analytical theory ?
We extend ¨ Opik's theory of close encounters of a small body (either an asteroid or a comet) by explicitly introducing the nodal distance and a time coordinate. Assuming that the heliocentric motion
...
...