Diversity enhanced particle swarm optimization algorithm and its application in vehicle lightweight design

다국어 초록 (Multilingual Abstract)

Particle swarm optimization, a widely used metaheuristic algorithm, mimics the cooperation behavior among species. The PSO algorithm has become a new trend owing to its simplicity and strong optimization capacity. However, premature convergence problem is also a serious issue for PSO comparable with other evolutionary algorithms. Diversity loss is generally known as one of the major causes. For enhancing the diversity of swarms during optimization procedure, an improved PSO algorithm named OLAR-PSO-d is proposed, which incorporates design of experiment technique as well as adaptive reset operator into standard PSO. The OLAR-PSO-d algorithm is compared with other 10 heuristic algorithms. The numerical experiments’ results demonstrate the priority of OLAR-PSO-d both in optimization ability and algorithm stability. The proposed algorithm is also used in a vehicle lightweight design problem. The auto-body achieves 20.25 kg weight reduction with meeting all the performance requirements of crashworthiness.

참고문헌 (Reference)

1 M. Clerc, "The swarm and the queen: towards a deterministic and adaptive particle swarm optimization" 3 : 1957-, 2002

2 J. Kennedy, "The particle swarm: Social adaptation of knowledge" 303-308, 1997

3 M. Clerc, "The particle swarm - explosion, stability, and convergence in a multidimensional complex space" 6 (6): 58-73, 2002

4 R. Mendes, "The fully informed particle swarm: Simpler, maybe better" 8 (8): 204-210, 2004

5 J. Kennedy, "Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance" 3 : 1938-, 1999

6 R. L. Iman, "Small sample sensitivity analysis techniques for computer models with an application to risk assessment" 9 (9): 1749-1842, 1980

7 A. Ratnaweera, "Selforganizing hierarchical particle swarm optimizer with timevarying acceleration coefficients" 8 (8): 240-255, 2004

8 R. C. Eberhart, "Particle swarm optimization:developments, applications and resources" 1 : 81-86, 2002

9 J. Kennedy, "Particle swarm optimization" 4 : 1942-1948, 1995

10 R. E. Perez, "Particle swarm approach for structural design optimization" 85 (85): 1579-1588, 2007

11 V. Miranda, "Optimizing large scale problems with metaheuristics in a reduced space mapped by autoencoders—application to the wind-hydro coordination" 29 (29): 3078-3085, 2014

12 S. Rahnamayan, "Opposition-based differential evolution" 12 : 64-79, 2008

13 D. Karaboga, "On the performance of artificial bee colony(ABC)algorithm" 8 : 687-697, 2008

14 L. Zhao, "Multidisciplinary optimization of auto-body lightweight design using modified particle swarm optimizer" 2015

15 S. M. A. Salehizadeh, "Local optima avoidable particle swarm optimization" IEEE 16-21, 2009

16 H. B. Ouyang, "Improved global-bestguided particle swarm optimization with learning operation for global optimization problems" 52 (52): 987-1008, 2016

17 R. C. Eberhart, "Guest editorial special issue on particle swarm optimization" 8 (8): 201-203, 2004

18 M. Khalili, "Global dynamic harmonysearch algorithm : GDHS" 228 : 195-219, 2014

19 G. P. Zhu, "Gbest-guided artificial bee colony algorithm for numerical function optimization" 217 : 3166-3173, 2010

20 T. Peram, "Fitnessdistance-ratio based particle swarm optimization" 2003

21 M. D. Morris, "Exploratory designs for computational experiments" 43 (43): 381-402, 1995

22 Y. H. Shi, "Empirical study of particle swarm optimization" 101-106, 1997

23 D. R. Jones, "Efficient global optimization of expensive black-box functions" 13 (13): 455-492, 1998

24 J. J. Liang, "Dynamic multi-swarm particle swarm optimizer with local search" 1 : 522-528, 2005

25 H. Wang, "Diversity enhanced particle swarm optimization with neighborhood search" 223 (223): 119-135, 2013

26 R. Storn, "Differential evolution : A simple and efficient heuristic for global optimization over continuous spaces" 11 : 341-359, 1997

27 M. Clerc, "Confinements and biases in particle swarm optimization"

28 J. J. Liang, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions" 10 : 281-295, 2006

29 Y. Li, "Competitive and cooperative particle swarm optimization with information sharing mechanism for global optimization problems" 293 (293): 370-382, 2015

30 J. Kennedy, "Bare bones particle swarms" 80-87, 2003

31 J. M. Yang, "Applying family competition to evolution strategies for constrained optimization" 1213 : 201-211, 1997

32 Y. Marinakis, "An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands" 37 (37): 680-701, 2015

33 E. A. Mohammed, "An improved global-best harmony search algorithm" 222 : 94-106, 2013

34 R. Jin, "An efficient algorithm for constructing optimal design of computer experiments" 134 (134): 268-287, 2005

35 Z. H. Zhan, "Adaptive particle swarm optimization" 39 : 1362-1381, 2009

36 C. K. Monson, "Adaptive diversity in PSO" 59-66, 2006

37 A. Meng, "Accelerating particle swarm optimization using crisscross search" 329 (329): 52-72, 2016

38 M. Pant, "A simple diversity guided particle swarm optimization" 8 : 3294-3299, 2007

39 Y. H. Shi, "A modified particle swarm optimizer" 69-73, 1998

40 B. Haddar, "A hybrid quantum particle swarm optimization for the multidimensional knapsack problem" 55 (55): 1-13, 2016

41 J. Sun, "A diversity-guided quantumbehaved particle swarm optimization algorithm" 497-504, 2006

42 J. Riget, "A diversity-guide particle swarm optimizer - the ARPSO" EVALife 2-, 2002

43 M. D. McKay, "A comparison of three methods for selecting values of input variables from a computer code" 21 : 239-245, 1979