摘要
给出了列队竞争算法解组合优化问题的框架和确定变异邻域的两条原则 ,并分别确定了背包问题和旅行商问题的变异邻域 .用列队竞争算法解背包问题显示出极其优良的搜索能力 ,解中国旅行商问题获得了 5条最优路径 .
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 traveling salesman problem are determined respectively. Using of LCA to solve knapsack problem shows that LCA has excellent search ability. Solving traveling 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.
关键词
列队竞争算法
组合优化
背包问题
旅行商问题
line-up competition algorithm
evolutionary algorithm
combinatorial optimization
knapsack problem
traveling salesman problem
