Abstract
Natural heuristic methods, like the particle swarm optimization and many others, enjoy fast convergence towards optimal solution via inter-particle communications. Many applications of such methods are applied to the optimization in engineering, but only a few to the optimization in statistics. It is especially difficult to implement in the optimization problems of experimental designs as the search space is mostly discrete, while most natural heuristic methods are limited to searching continuous domains. This paper introduces a new natural heuristic method called Swarm Intelligence Based method for optimizing problem with a discrete domain. It includes two new operations, MIX and MOVE, for combining two particles and selecting the best particle respectively. This method is ready for the search of both continuous and discrete domains, and its global best particle is guaranteed to monotonically move towards the optimum. Several demonstrations on the optimization of experimental designs are given at the end of this paper.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Bera R, Roy JS (2013) Thinning of elliptical and concentric elliptical antenna arrays using particle swarm optimization. Microw Rev 19:2–7
Box KHV, Cox DR (1962) Some systematic supersaturated designs. Technometrics 4:489–495
Boyd S, Vandenverghe L (2004) Convex optimization. Cambridge University Press, Cambridge
Braendler D, Hendtlass T (2002) The suitability of particle swarm optimization for training neural hardware. In: International conference on industrial and engineering applications of artificial intelligence and expert system, 190–199 (2002)
Brandstatter B, Baumgartner U (2002) Particle swarm optimization—mass-spring system analogon. IEEE Trans Magn 38:997–1000
Bulutoglu DA (2007) Cyclicly constructed \(E(s^2)\)optimal supersaturated designs. J Stat Plan Inference 137:2413–2428
Bulutoglu DA, Cheng CS (2004) Construction of \(E(s^2)\)-optimal supersaturated designs. Annal Stat 32:1662–1678
Chakrabarti R, Chattopadhyay PK, Basu M, Panigrahi CK (2006) Particle swarm optimization technique for dynamic economic dispatch. J Inst Eng (India) 87:48–54
Chen RB, Hsieh DN, Hung Y, Wang W (2013) Optimizing Latin hypercube designs by particle swarm. Stat Comput 23:663–676
Clerc M (2006) Particle swarm optimization. ISTE, London
Craigen R, Faucher G, Low R, Wares T (2013) Circulant partial Hadamard matrices. Linear Algebra Appl 439:3307–3317
Dawkins R (1976) The selfish gene. Oxford University Press, London
Dorigo M (1992) Learning and Natural Algorithms. PhD thesis, Politecnico di Milano, Italy
Eberhart R, Shi Y (2001) Particle swarm optimization: developments, application and resources. In: IEEE proceedings of the congress on evolutionary computation 1:81–85
Engelbrecht AP (2005) Fundamentals of computational swarm intelligence. Wiley, Chichester
Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38:129–154
Fraser A (1957) Simulation of genetic systems by automatic digital computers. I. Introduction. Aust J Biol Sci 10:484–491
Geramita A, Seberry J (1979) Quadratic forms, orthogonal designs, and Hadamard matrices, Lecture notes in pure and applied mathematics series 45, Marcel Dekker Inc., New York
Gong T, Tuson AL (2008) Particle swarm optimization for quadratic assignment problems—a forma analysis approach. Int J Comput Intell Res 4:177–185
Horadam KJ (2007) Hadamard matrices and their applications. Priceton University Press, Princeton
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conferenec on neural networks 4:1942–1948
Low RM, Stamp M, Craigen R, Faucher G (2005) Unpredictable binary strings. Congr Numer 177:65–75
Morris MD, Mitchell TJ (1995) Exploratory designs for computational experiments. J Stat Plan Inference 43:381–402
Orouskhano M, Orouskhani Y, Mansouri M, Teshnehlab M (2013) A novel cat swarm optimization algorithm for unconstrained optimization problems. I J Inf Technol Comput Sci 11:32–41
Panduro MA, Brizuela CA, Balderas LI, Acosta DA (2009) A comparison of genetic algorithms, particle swarm optimization and the differential evolution method for the design of scannable circular antenna arrays. Prog Electromagn Res B 13:171–186
Passino KM (2002) Biomimicry of bacterial foraging for distributed optimization and control. IEEE Control Syst Mag 22:52–67
Phoa FKH, Chen RB, Wang W, Wong WK (2016) Optimizing two-level supersaturated designs using swarm intelligence techniques. Technometrics 58:43–49
Plackett RL, Burman JP (1946) The design of optimum multifactorial experiments. Biometrika 33:305–325
Seeley TD (1995) The wisdom of the hive. Harvard University Press, Cambridge
Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of IEEE international conference on evolutionary computation, 69–73
Xu H, Phoa FKH, Wong WK (2009) Recent developments in nonregular fractional factorial designs. Stat Surv 3:18–46
Acknowledgments
This work is supported by Career Development Award of Academia Sinica (Taiwan) grant number 103-CDA-M04 and Ministry of Science and Technology (Taiwan) grant numbers 102-2628-M-001-002-MY3 and 104-2118-M-001-016-MY2.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Phoa, F.K.H. A Swarm Intelligence Based (SIB) method for optimization in designs of experiments. Nat Comput 16, 597–605 (2017). https://doi.org/10.1007/s11047-016-9555-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-016-9555-4