S-metric based multi-objective fireworks algorithm

作者: Lang Liu , Shaoqiu Zheng , Ying Tan

DOI: 10.1109/CEC.2015.7257033

关键词: Multi-objective optimizationOptimization problemSwarm intelligenceComputer scienceMetric (mathematics)Solution setPareto principleMathematical optimizationLinear programmingMulti-swarm optimizationBenchmark (computing)

摘要: Fireworks Algorithm(FWA) is a recently developed swarm intelligence algorithm for single objective optimization problems which gains very promising performances in many areas. In this paper, we extend the original FWA to solve multi-objective with help of S-metric. The S-metric frequently used quality measure solution sets comparison evolutionary algorithms (EMOAs). Besides, can also be evaluate contribution among set. Traditional usually perform (μ + 1) strategy and update external archive one by one, while proposed based fireworks algorithm(S-MOFWA) performs μ) strategy, thus converging faster set pareto solutions three steps: 1)Exploring space mimicking explosion fireworks; 2)Performing simple selection choosing next generation according their S-metric; 3)Utilizing an maintain best ever found, new definition novel updating μ process. experimental results on benchmark functions suggest that S-MOFWA outperforms other well-known algorithms, i.e. NSGA-II, SPEA2 PESA2 terms convergence covered measure.

参考文章(46)
Wenrui He, Guyue Mi, Ying Tan, Parameter Optimization of Local-Concentration Model for Spam Detection by Using Fireworks Algorithm international conference on swarm intelligence. pp. 439- 450 ,(2013) , 10.1007/978-3-642-38703-6_52
Bei Zhang, Minxia Zhang, Yu-Jun Zheng, Improving Enhanced Fireworks Algorithm with New Gaussian Explosion and Population Selection Strategies international conference on swarm intelligence. pp. 53- 63 ,(2014) , 10.1007/978-3-319-11857-4_7
Joshua Knowles, Local-Search and Hybrid Evolutionary Algorithms for Pareto Optimization [Thesis].University of Reading, UK;2002.. ,(2002)
Kalyanmoy Deb, Manikanth Mohan, Shikhar Mishra, Towards a Quick Computation of Well-Spread Pareto-Optimal Solutions Lecture Notes in Computer Science. pp. 222- 236 ,(2003) , 10.1007/3-540-36970-8_16
Jianhua Liu, Shaoqiu Zheng, Ying Tan, The Improvement on Controlling Exploration and Exploitation of Firework Algorithm international conference on swarm intelligence. pp. 11- 23 ,(2013) , 10.1007/978-3-642-38703-6_2
Nicola Beume, Günter Rudolph, Faster s-metric calculation by considering dominated hypervolume as klee's measure problem. computational intelligence. pp. 233- 238 ,(2006)
Xiang Yang, Ying Tan, Sample Index Based Encoding for Clustering Using Evolutionary Computation international conference on swarm intelligence. pp. 489- 498 ,(2014) , 10.1007/978-3-319-11857-4_55
E.J. Hughes, Multiple single objective Pareto sampling congress on evolutionary computation. ,vol. 4, pp. 2678- 2684 ,(2003) , 10.1109/CEC.2003.1299427
Michael Emmerich, Nicola Beume, Boris Naujoks, None, An EMO algorithm using the hypervolume measure as selection criterion international conference on evolutionary multi criterion optimization. pp. 62- 76 ,(2005) , 10.1007/978-3-540-31880-4_5
Ying Tan, Yuanchun Zhu, Fireworks Algorithm for Optimization Lecture Notes in Computer Science. pp. 355- 364 ,(2010) , 10.1007/978-3-642-13495-1_44