Uptrend on Metaheuristics in Approximate Search Algorithms for Combinatorial Optimization
Yuejin Tan · Computer and Modernization · 2004
This paper classifies and summarizes the metaheuristics in approximate search algorithms for combinatorial optimization,and emphasizes analyzing some strengths and weaknesses of different approaches from two concepts as intensification and diversification.The purpose is to find the uptrend and provide some references and guidance for developing hybrid algorithms combining strengths of different mataheuristics.