Ejection chains, reference structures and alternating path methods for traveling salesman problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Computers and Operations Research
Tabu Search
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem
Journal of Global Optimization
Analysis of Generalized Pattern Searches
SIAM Journal on Optimization
A Template for Scatter Search and Path Relinking
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Scatter Search: Methodology and Implementations in C
Scatter Search: Methodology and Implementations in C
Path relinking for the vehicle routing problem
Journal of Heuristics
A particle swarm pattern search method for bound constrained global optimization
Journal of Global Optimization
Multistart tabu search and diversification strategies for the quadratic assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Neighborhood analysis: a case study on curriculum-based course timetabling
Journal of Heuristics
Path relinking for large-scale global optimization
Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special Issue on scalability of evolutionary algorithms and other metaheuristics for large-scale continuous optimization problems
The particle swarm - explosion, stability, and convergence in amultidimensional complex space
IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
A recent study Yin et al., 2010 showed that combining particle swarm optimization PSO with the strategies of scatter search SS and path relinking PR produces a Cyber Swarm Algorithm that creates a more effective form of PSO than methods that do not incorporate such mechanisms. This paper proposes a Complementary Cyber Swarm Algorithm C/CyberSA that performs in the same league as the original Cyber Swarm Algorithm but adopts different sets of ideas from the tabu search TS and the SS/PR template. The C/CyberSA exploits the guidance information and restriction information produced in the history of swarm search and the manipulation of adaptive memory. Responsive strategies using long term memory and path relinking implementations are proposed that make use of critical events encountered in the search. Experimental results with a large set of challenging test functions show that the C/CyberSA outperforms two recently proposed swarm-based methods by finding more optimal solutions while simultaneously using a smaller number of function evaluations. The C/CyberSA approach further produces improvements comparable to those obtained by the original CyberSA in relation to the Standard PSO 2007 method Clerc, 2008.