Parameter-free deterministic global search with simplified central force optimization

Authors:
Richard A. Formato
Affiliations:
Registered Patent Attorney & Consulting Engineer, Harwich, MA
Venue:
ICIC'10 Proceedings of the 6th international conference on Advanced intelligent computing theories and applications: intelligent computing
Year:
2010

Citing 5
Cited 1

GSA: A Gravitational Search Algorithm

Information Sciences: an International Journal
Group search optimizer: an optimization algorithm inspired by animal searching behavior

IEEE Transactions on Evolutionary Computation
Central force optimisation: a new gradient-like metaheuristic for multidimensional search and optimisation

International Journal of Bio-Inspired Computation
publication spotlight: CIS publication spotlight

IEEE Computational Intelligence Magazine
Ant colony optimization

IEEE Computational Intelligence Magazine

Robust solver based on modified particle swarm optimization for improved solution of diffusion transport through containment facilities

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note describes a simplified parameter-free implementation of Central Force Optimization for use in deterministic multidimensional search and optimization. The user supplies only the objective function to be maximized, nothing more. The algorithm's performance is tested against a widely used suite of twenty three benchmark functions and compared to other state-of-the-art algorithms. CFO performs very well.