To date, various kinds of heuristic algorithms and their variants, hybridizations are proposed. However, the algorithms have different performances to different problems. According to the No Free Lunch (NFL) Theory, there is no single algorithm can outperform all others to all possible problems. Hence, it is crucial to give a fair and comprehensive analysis to compare different kinds of heuristic algorithms. In this special session, we would like to call for papers which focus on the comparison of different kinds of algorithms.