Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies

European Journal of Operational Research

Volumn 201, Issue 2, 2010, Pages 377-389

  Yin, Peng Yeng ^a   Glover, Fred ^b   Laguna, Manuel ^c   Zhu, Jia Xian ^a  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b OptTek Systems Inc   (United States)

^c UNIVERSITY OF COLORADO   (United States)

Author keywords

Dynamic social network; Metaheuristics; Particle swarm optimization; Path relinking; Scatter search

Indexed keywords

ADAPTIVE MEMORY; ADAPTIVE MEMORY STRATEGY; BENCHMARK FUNCTIONS; COMPLEX OPTIMIZATION; CONTINUOUS NONLINEAR FUNCTIONS; EXPERIMENTAL CONDITIONS; GLOBAL MINIMA; GLOBAL SOLUTIONS; METAHEURISTICS; OPTIMIZATION FRAMEWORK; PATH RELINKING; SCATTER SEARCH; STANDARD PSO; SWARM ALGORITHMS;

ALGORITHMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 70349286048     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.03.035     Document Type: Article

References (28)

1. Campos V., Glover F., Laguna M., and Martí R. An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization 21 4 (2001) 397-414
2. Clerc M., and Kennedy J. The particle swarm explosion, stability, and convergence in a multidimensional complex space. IEEE Transaction on Evolutionary Computation 6 (2002) 58-73
3. Coello Coello C.A., Pulido G.T., and Lechuga M.S. Handling multiple objectives with particle swarm optimization. IEEE Transaction on Evolutionary Computation 8 (2004) 256-279
4. Duarte, A., Marti, R., Glover, F. (2007). Adaptive memory programming for global optimization. Research Report, University of Valencia, Valencia, Spain.
5. Duarte, A., Marti, R., Glover, F. (2008). Hybrid scatter-tabu search for unconstrained global optimization. Submitted to Annals of Operations Research.
6. Eberhart, R.C., Shi, Y. (1998). Evolving artificial neural networks. In: Proceedings of International Conference on Neural Networks and Brain, pp. 5-13.
7. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sciences 8 1 (1977) 156-166
8. Glover F. Tabu search and adaptive memory programming - Advances, applications and challenges. In: Helgason, Barr, and Kennington (Eds). Interfaces in Computer Science and Operations Research (1996), Kluwer Academic Publishers 1-75
9. Glover, F. (1998) A template for scatter search and path relinking. Artificial Evolution. Lecture Notes in Computer Science 1363, 13-54.
10. Glover F., and Laguna M. Tabu Search (1997), Kluwer Academic Publishers, Boston
11. Glover F., and McMillan C. The general employee scheduling problem: An integration of management science and artificial intelligence. Computers and Operations Research 13 4 (1986) 563-593
12. Glover F., Laguna M., and Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics 29 3 (2000) 653-684
13. Hedar A., and Fukushima M. Tabu search directed by direct search methods for nonlinear global optimization. European Journal of Operational Research 170 2 (2006) 329-349
14. Hirsch M.J., Meneses C.N., Pardalos P.M., and Resende M.G.C. Global optimization by continuous grasp. Optimization Letters 1 2 (2007) 201-212
15. Hvattum, L.M., Glover, F. (2007). Finding local optima of high-dimensional functions using direct search methods. Research Report, Molde University, Molde, Norway.
16. Kennedy, J., Eberhart, R.C. (1995). Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. IV, pp. 1942-1948.
17. Laguna M., and Marti R. Scatter Search: Methodology and Implementation in C (2003), Kluwer Academic Publishers., London
18. Laguna M., and Marti R. Experimental testing of advanced scatter search designs for global optimization of multimodal functions. Journal of Global Optimization 33 (2005) 235-255
19. Liang J.J., Qin A.K., Suganthan P.N., and Baskar S. Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation 10 3 (2006) 281-295
20. Malek M., Guruswamy M., Pandya M., and Owens H. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem. Annals of Operations Research 21 (1987) 59-84
21. Mendes R., Kennedy J., and Neves J. The fully informed particle swarm: Simpler, maybe better. IEEE Transaction on Evolutionary Computation 8 (2004) 204-210
22. Miranda V., Keko H., and Jaramillo A. EPSO: Evolutionary particle swarms. In: Jain L.C., Palade V., and Srinivasan D. (Eds). Advances in Evolutionary Computing for System Design (2007), Springer 139-167
23. Mladenovic N., and Hansen P. Variable neighborhood search. Computers and Operations Research 24 (1997) 1097-1100
24. Shigenori N., Takamu G., Toshiku Y., and Yoshikazu F. A hybrid particle swarm optimization for distribution state estimation. IEEE Transaction on Power Systems 18 (2003) 60-68
25. Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report, Nanyang Technology University of Singapore.
26. Taillard, E.D. (2005). Few guidelines for analyzing methods. Tutorial, Metaheuristic International Conference (MIC'05), Vienna, August 2005.
27. Vaz A.I.F., and Vicente L.N. A particle swarm pattern search method for bound constrained global optimization. Journal of Global Optimization 39 (2007) 197-219
28. Yin P.Y. A discrete particle swarm algorithm for optimal polygonal approximation of digital curves. Journal of Visual Communication and Image Representation 15 (2004) 241-260