×

A memetic particle swarm optimisation algorithm for dynamic multi-modal optimisation problems. (English) Zbl 1307.90210

Summary: Many real-world optimisation problems are both dynamic and multi-modal, which require an optimisation algorithm not only to find as many optima under a specific environment as possible, but also to track their moving trajectory over dynamic environments. To address this requirement, this article investigates a memetic computing approach based on particle swarm optimisation for dynamic multi-modal optimisation problems (DMMOPs). Within the framework of the proposed algorithm, a new speciation method is employed to locate and track multiple peaks and an adaptive local search method is also hybridised to accelerate the exploitation of species generated by the speciation method. In addition, a memory-based re-initialisation scheme is introduced into the proposed algorithm in order to further enhance its performance in dynamic multi-modal environments. Based on the moving peaks benchmark problems, experiments are carried out to investigate the performance of the proposed algorithm in comparison with several state-of-the-art algorithms taken from the literature. The experimental results show the efficiency of the proposed algorithm for DMMOPs.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
90C39 Dynamic programming
PDFBibTeX XMLCite
Full Text: DOI Link

References:

[1] Banous R, International Journal of Systems Science 42 pp 223– (2009)
[2] DOI: 10.1109/TEVC.2005.857074 · Zbl 05452217 · doi:10.1109/TEVC.2005.857074
[3] Branke, J. Kaubler, T., Schmidt, C., and Schmeck, H. (2000), ’A Multi-population Approach to Dynamic Optimisation Problems’, inProceeding of the 4th International Conference on Adaptive Computing in Design and Manufacturing, pp. 299–308
[4] Brits, R. Engelbrecht, A.P., and Bergh, F. (2002), ’Solving Systems of Unconstrained Equations Using Particle Swarm Optimisation’, inProceedings of IEEE Conference on Systems, Man, and Cybernetics, pp. 102–107
[5] DOI: 10.1016/j.amc.2006.12.066 · Zbl 1122.65358 · doi:10.1016/j.amc.2006.12.066
[6] DOI: 10.1007/s00500-008-0357-1 · Zbl 05558140 · doi:10.1007/s00500-008-0357-1
[7] Carneiro MBP, International Journal of Systems Science 23 pp 738– (2009)
[8] DOI: 10.1080/00207720903576472 · Zbl 1290.49079 · doi:10.1080/00207720903576472
[9] Cobb HG, Technical Report AIC-90-001 (1990)
[10] DOI: 10.1016/S0045-7825(01)00323-1 · Zbl 1026.74056 · doi:10.1016/S0045-7825(01)00323-1
[11] DOI: 10.1016/j.ins.2008.01.020 · Zbl 1283.90047 · doi:10.1016/j.ins.2008.01.020
[12] DOI: 10.1007/s10710-006-9014-6 · Zbl 05146471 · doi:10.1007/s10710-006-9014-6
[13] DOI: 10.1109/TEVC.2005.846356 · Zbl 05452035 · doi:10.1109/TEVC.2005.846356
[14] Kennedy, J. (1997), ’The Particle Swarm: Social Adaptation of Knowledge’, inProceedings of IEEE International Conference on Evolutionary Computation, pp. 303–308
[15] Kennedy, J. (2000). ’Stereotyping: Improving Particle Swarm Performance with Cluster Analysis’, inProceedings of IEEE International Conference on Evolutionary Computation, pp. 1507–1512
[16] Kennedy J, Swarm Intelligence (2001)
[17] DOI: 10.1109/TEVC.2005.850260 · Zbl 05452085 · doi:10.1109/TEVC.2005.850260
[18] DOI: 10.1162/106365602760234081 · Zbl 05412730 · doi:10.1162/106365602760234081
[19] Li, C. and Yang, S. (2008), ’Fast Multi-swarm Optimisation for Dynamic Optimisation Problems’, inProceedings of the 4th International Conference on Natural Computation, pp. 624–628
[20] Linnala M, International Journal of Systems Science (2011)
[21] DOI: 10.1109/TSMCB.2006.883270 · doi:10.1109/TSMCB.2006.883270
[22] Liu, X. Wu, Y., and Ye, J. (2008), ’An Improved Estimation of Distribution Algorithm in Dynamic Environments’, inProceeding of the 4th International Conference on Natural Computation, pp. 269–272
[23] Mendes, R. and Mohais, A.S. (2005), ’DynDE: A Differential Evolution for Dynamic Optimisation Problems’, inProceeding of IEEE International Conference on Evolutionary Computation, pp. 2808–2815
[24] DOI: 10.1162/evco.1996.4.1.1 · Zbl 05412775 · doi:10.1162/evco.1996.4.1.1
[25] DOI: 10.1016/j.ins.2011.02.004 · Zbl 05911318 · doi:10.1016/j.ins.2011.02.004
[26] DOI: 10.1109/MCI.2010.936305 · doi:10.1109/MCI.2010.936305
[27] DOI: 10.1109/TEVC.2003.819944 · Zbl 05452044 · doi:10.1109/TEVC.2003.819944
[28] DOI: 10.1109/TSMCB.2005.856143 · doi:10.1109/TSMCB.2005.856143
[29] DOI: 10.1109/TEVC.2005.859468 · Zbl 05452177 · doi:10.1109/TEVC.2005.859468
[30] DOI: 10.1007/s10479-007-0224-y · Zbl 1145.90108 · doi:10.1007/s10479-007-0224-y
[31] DOI: 10.1016/j.cor.2009.09.018 · Zbl 1178.90060 · doi:10.1016/j.cor.2009.09.018
[32] DOI: 10.1016/S0377-2217(02)00871-8 · Zbl 1053.90058 · doi:10.1016/S0377-2217(02)00871-8
[33] DOI: 10.1109/TSMCB.2006.883273 · doi:10.1109/TSMCB.2006.883273
[34] Trojanowski, K. (2007), ’B-cell Algorithm as a Parallel Approach to Optimisation of Moving Peaks Benchmark Tasks’, inProceeding of the 6th International Conference on Computer Information Systems and Industrial Management Applications, pp. 143–148
[35] DOI: 10.1007/s00500-008-0347-3 · Zbl 05558131 · doi:10.1007/s00500-008-0347-3
[36] DOI: 10.1109/TSMCB.2009.2015281 · doi:10.1109/TSMCB.2009.2015281
[37] DOI: 10.1007/s11047-009-9176-2 · Zbl 1205.68498 · doi:10.1007/s11047-009-9176-2
[38] DOI: 10.1007/s10710-009-9089-y · Zbl 05659281 · doi:10.1007/s10710-009-9089-y
[39] DOI: 10.1007/s00500-009-0510-5 · Zbl 05774076 · doi:10.1007/s00500-009-0510-5
[40] DOI: 10.1016/j.amc.2005.11.058 · Zbl 1100.65055 · doi:10.1016/j.amc.2005.11.058
[41] DOI: 10.1109/TEVC.2010.2046667 · Zbl 05921221 · doi:10.1109/TEVC.2010.2046667
[42] DOI: 10.1007/978-3-540-49774-5 · Zbl 1139.68048 · doi:10.1007/978-3-540-49774-5
[43] DOI: 10.1109/TEVC.2007.913070 · Zbl 05740366 · doi:10.1109/TEVC.2007.913070
[44] DOI: 10.1016/j.neucom.2006.02.016 · Zbl 05184787 · doi:10.1016/j.neucom.2006.02.016
[45] DOI: 10.1109/4235.797969 · Zbl 05452215 · doi:10.1109/4235.797969
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.