Vol. 77
Latest Volume
All Volumes
PIER 180 [2024] PIER 179 [2024] PIER 178 [2023] PIER 177 [2023] PIER 176 [2023] PIER 175 [2022] PIER 174 [2022] PIER 173 [2022] PIER 172 [2021] PIER 171 [2021] PIER 170 [2021] PIER 169 [2020] PIER 168 [2020] PIER 167 [2020] PIER 166 [2019] PIER 165 [2019] PIER 164 [2019] PIER 163 [2018] PIER 162 [2018] PIER 161 [2018] PIER 160 [2017] PIER 159 [2017] PIER 158 [2017] PIER 157 [2016] PIER 156 [2016] PIER 155 [2016] PIER 154 [2015] PIER 153 [2015] PIER 152 [2015] PIER 151 [2015] PIER 150 [2015] PIER 149 [2014] PIER 148 [2014] PIER 147 [2014] PIER 146 [2014] PIER 145 [2014] PIER 144 [2014] PIER 143 [2013] PIER 142 [2013] PIER 141 [2013] PIER 140 [2013] PIER 139 [2013] PIER 138 [2013] PIER 137 [2013] PIER 136 [2013] PIER 135 [2013] PIER 134 [2013] PIER 133 [2013] PIER 132 [2012] PIER 131 [2012] PIER 130 [2012] PIER 129 [2012] PIER 128 [2012] PIER 127 [2012] PIER 126 [2012] PIER 125 [2012] PIER 124 [2012] PIER 123 [2012] PIER 122 [2012] PIER 121 [2011] PIER 120 [2011] PIER 119 [2011] PIER 118 [2011] PIER 117 [2011] PIER 116 [2011] PIER 115 [2011] PIER 114 [2011] PIER 113 [2011] PIER 112 [2011] PIER 111 [2011] PIER 110 [2010] PIER 109 [2010] PIER 108 [2010] PIER 107 [2010] PIER 106 [2010] PIER 105 [2010] PIER 104 [2010] PIER 103 [2010] PIER 102 [2010] PIER 101 [2010] PIER 100 [2010] PIER 99 [2009] PIER 98 [2009] PIER 97 [2009] PIER 96 [2009] PIER 95 [2009] PIER 94 [2009] PIER 93 [2009] PIER 92 [2009] PIER 91 [2009] PIER 90 [2009] PIER 89 [2009] PIER 88 [2008] PIER 87 [2008] PIER 86 [2008] PIER 85 [2008] PIER 84 [2008] PIER 83 [2008] PIER 82 [2008] PIER 81 [2008] PIER 80 [2008] PIER 79 [2008] PIER 78 [2008] PIER 77 [2007] PIER 76 [2007] PIER 75 [2007] PIER 74 [2007] PIER 73 [2007] PIER 72 [2007] PIER 71 [2007] PIER 70 [2007] PIER 69 [2007] PIER 68 [2007] PIER 67 [2007] PIER 66 [2006] PIER 65 [2006] PIER 64 [2006] PIER 63 [2006] PIER 62 [2006] PIER 61 [2006] PIER 60 [2006] PIER 59 [2006] PIER 58 [2006] PIER 57 [2006] PIER 56 [2006] PIER 55 [2005] PIER 54 [2005] PIER 53 [2005] PIER 52 [2005] PIER 51 [2005] PIER 50 [2005] PIER 49 [2004] PIER 48 [2004] PIER 47 [2004] PIER 46 [2004] PIER 45 [2004] PIER 44 [2004] PIER 43 [2003] PIER 42 [2003] PIER 41 [2003] PIER 40 [2003] PIER 39 [2003] PIER 38 [2002] PIER 37 [2002] PIER 36 [2002] PIER 35 [2002] PIER 34 [2001] PIER 33 [2001] PIER 32 [2001] PIER 31 [2001] PIER 30 [2001] PIER 29 [2000] PIER 28 [2000] PIER 27 [2000] PIER 26 [2000] PIER 25 [2000] PIER 24 [1999] PIER 23 [1999] PIER 22 [1999] PIER 21 [1999] PIER 20 [1998] PIER 19 [1998] PIER 18 [1998] PIER 17 [1997] PIER 16 [1997] PIER 15 [1997] PIER 14 [1996] PIER 13 [1996] PIER 12 [1996] PIER 11 [1995] PIER 10 [1995] PIER 09 [1994] PIER 08 [1994] PIER 07 [1993] PIER 06 [1992] PIER 05 [1991] PIER 04 [1991] PIER 03 [1990] PIER 02 [1990] PIER 01 [1989]
2007-09-14
Central Force Optimization: a New Metaheuristic with Applications in Applied Electromagnetics
By
Progress In Electromagnetics Research, Vol. 77, 425-491, 2007
Abstract
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 space by analogy to masses moving under the influence of gravity. Equations are developed for the probes' positions and accelerations using the analogy of particle motion in a gravitational field. In the physical universe, objects traveling through threedimensional space become trapped in close orbits around highly gravitating masses, which is analogous to locating the maximum value of an objective function. In the CFO metaphor, "mass" is a userdefined function of the value of the objective function to be maximized. CFO is readily implemented in a compact computer program, and sample pseudocode is presented. As tests of CFO's effectiveness, an equalizer is designed for the well-known Fano load, and a 32-element linear array is synthesized. CFO results are compared to several other optimization methods.
Citation
Richard Formato, "Central Force Optimization: a New Metaheuristic with Applications in Applied Electromagnetics," Progress In Electromagnetics Research, Vol. 77, 425-491, 2007.
doi:10.2528/PIER07082403
References

1. Kennedy, J. and R. Eberhart, "Particle swarm optimization," Proc. IEEE Conf. On Neural Networks, Vol. 4, No. 12, 1942-1948, 1995.

2. Special Issue on Particle Swarm Optimization, IEEE Trans. Evol. Comp., Jun. 2004., Vol. 8, No. 3, 2004.

3. Dorigo, M., M. Birattari, and T. Stutzle, "Ant colony optimization," IEEE Comp. Intell. Mag., Vol. 1, No. 4, 28-39, 2006.

4. Special Section on Ant Colony Optimization, IEEE Trans. Evol. Comp., Aug. 2002., Vol. 6, No. 4, 2002.

5. Marion, J., Classical Dynamics of Particles and Systems, 2nd edition, 1970.

6. Brand, L., Differential and Difference Equations, §56, 1966.

7. Power Basic, Inc., http://www.powerbasic.com.

8. Fano, F., "Theoretical limitations on the broadband matching of arbitrary impedances," J. Franklin Inst., Vol. 249, No. 2, 139-154, 1950.
doi:10.1016/S0016-0032(50)91101-X

9. Rodriguez, J., I. García-Tu˜n´on, J. Taboada, and F. Basteiro, "Broadband HF antenna matching network design using a realcoded genetic algorithm," IEEE Trans. Ant. Propag., Vol. 55, No. 3, 611-618, 2007.
doi:10.1109/TAP.2007.891546

10. Carlin, H., "A new approachto gain-bandwidthproblems," IEEE Trans. Circuits Syst., Vol. CAS-24, No. 4, 170-175, 1977.
doi:10.1109/TCS.1977.1084325

11. Dedieu, H., C. Dehollain, J. Neirynck, and G. Rhodes, "A new method for solving broadband matching problems," IEEE Trans. Circuits Syst. I, Vol. 41, No. 9, 561-570, 1994.
doi:10.1109/81.317955

12. Rajo-Iglesias, E. and O. Quevedo-Teruel, "Linear array synthesis using an ant-colony-optimization-based algorithm," IEEE Ant. Prop. Mag., Vol. 49, No. 2, 70-79, 2007.
doi:10.1109/MAP.2007.376644

13. Balanis, C., Antenna Theory: Analysis and Design, §6.4, 1982.

14. Yao, X., Y. Liu, and G. Lin, "Evolutionary programming made faster," IEEE Trans. Evolutionary Computation, Vol. 3, No. 2, 82-102, 1999.
doi:10.1109/4235.771163

15. Emmerich, M. T. M., K. C. Giannakoglou, and B. Naujoks, "Single-and multiobjective evolutionary optimization assisted by Gaussian random field metamodels," IEEE Trans. Evolutionary Computation, Vol. 10, No. 4, 421-439, 2006.
doi:10.1109/TEVC.2005.859463

16. Doo-Hyun and O. Se-Young "A new mutation rule for evolutionary programming motivated from backpropagation learning," IEEE Trans. Evolutionary Computation, Vol. 4, No. 2, 188-190, 2000.
doi:10.1109/4235.850659

17. Chen, T., Y. Dong, Y. Jiao, and F. S. Zhang, "Synthesis of circular antenna array using crossed particle swarm optimization algorithm," J. of Electromagn. Waves and Appl., Vol. 20, No. 13, 1785-1795, 2006.
doi:10.1163/156939306779292273

18. Lee, K.-C. and J.-Y. Jhang, "Application of particle swarm algorithm to the optimization of unequally spaced antenna arrays," J. of Electromagn. Waves and Appl., Vol. 20, No. 14, 2001-2012, 2006.
doi:10.1163/156939306779322747

19. Lu, Y.-Q. and J.-Y. Li, "Optimization of broadband top-loaded antenna using micro-genetic algorithm," J. of Electromagn. Waves and Appl., Vol. 20, No. 6, 793-801, 2006.
doi:10.1163/156939306776143370

20. Ayestaran, R. Laviada and and F. Las-Heras, "Synthesis of passivedipole arrays witha genetic-neural hybrid method," J. of Electromagn. Waves and Appl., Vol. 20, No. 15, 2123-2135, 2006.
doi:10.1163/156939306779322549

21. Mitilineos, S., S. Thomopoulos, and C. Capsalis, "Genetic design of dual-band, switched-beam dipole arrays, with elements failure correction, retaining constant excitation coefficients," J. of Electromagn. Waves and Appl., Vol. 20, No. 14, 1925-1942, 2006.
doi:10.1163/156939306779322738

22. Tian, Y. and J. Qian, "Ultraconveniently finding multiple solutions of complex transcendental equations based on genetic algorithm," J. of Electromagn. Waves and Appl., Vol. 20, No. 4, 475-488, 2006.
doi:10.1163/156939306776117090

23. Capozzoli, A. and G. D'Elia, "Global optimization and antennas synthesis and diagnosis, Part one: concepts, tools, strategies and performances," Progress In Electromagnetics Research, Vol. 56, 195-232, 2006.
doi:10.2528/PIER04123001

24. Capozzoli, A. and G. D'Elia, "Global optimization and antennas synthesis and diagnosis, Part two: applications to advanced reflector antennas synthesis and diagnosis techniques," Progress In Electromagnetics Research, Vol. 56, 233-261.
doi:10.2528/PIER05032503

25. Chen, X., X., T. Grzegorczyk, and J. A. Kong, "Optimization approach to the retrieval of the constitutive parameters of a slab of general bianisotropic medium," Progress In Electromagnetics Research, Vol. 60, 1-18, 2006.
doi:10.2528/PIER05120601

26. Donelli, M., S. Caorsi, F. De Natale, M. Pastorino, and A. Massa, "Linear antenna synthesis with a hybrid genetic algorithm," Progress In Electromagnetics Research, Vol. 49, 1-22, 2004.
doi:10.2528/PIER03121301

27. Inman, M., J. Earwood, A. Elsherbeni, and C. Smith, "Bayesian optimization techniques for antenna design," Progress In Electromagnetics Research, Vol. 49, 71-86, 2004.
doi:10.2528/PIER04021302

28. Sijher, T. and A. Kishk, "Antenna modeling by infinitesimal dipoles using genetic algorithms," Progress In Electromagnetics Research, Vol. 52, 225-254, 2005.
doi:10.2528/PIER04081801

29. Misra, I. S., R. Chakrabarty, and B. Mangaraj, "Design, analysis and optimization of V-dipole and its three-element Yagi-Uda array," Progress In Electromagnetics Research, Vol. 66, 137-156, 2006.
doi:10.2528/PIER06102604

30. Formato, R., TX 6-459-271, TX 6-461-552, TX 6-468-062, TX 6-464-965, TX 6-522-082, TX 6-540-042, Copyright Office, U.S. Library of Congress, Washington D. C., 10 2006.