Line-up competition algorithm solving combinatorial optimization problems

The framework is given for solving combinatorial optimization problems with line-up competition algorithm (LCA) presented by the author in his Ph. D dissertation, and the two principles of determining mutation adjacent region are presented. Based on the two principles, the mutation adjacent regions of knapsack problem and travelling salesman problem are determined respectively. Using of LCA to solve knapsack problem shows that LCA has excellent search ability. Solving travelling salesman problem of China with LCA, the optimal five routes have been now obtained. The examples of this paper show that LCA is an efficient algorithm in solving combinatorial optimization problems.