中文摘要:在项目决策与规划、资源分配、货物装载等工作中 ,提出了多维 0-1背包问题 ,对这一问题 ,国内外学者提出了许多算法。本文推广了文献 [ 7 ]中求解单维 0-1背包问题的蚁群算法 ,并从结合 2-opt等局部优化的蚁群算法求解旅行商问题中得到启示:通过交换策略可以加快算法的收敛速度和获取更高质量的解 ,因此提出了基于交换策略的蚁群算法。再把这种算法与 A I AACA算法[ 8 ]进行比较 ,实验结果显示该算法与 A I AACA算法效果相当 ,用时更少 ,是求解多维 0-1背包问题的有效算法。英文摘要：Abstract:Multi2 di mensi onal 02 1 knap sack p roblem often appears in decisi on making and p r ogramming, res ource distributi on,l oading, and so on . For solving this p roblem, many algorithms have been p roposed by scholars . This paper extends the ant col onyalgorithm which is used for s olving 02 1 knap sack p r oblem in reference[ 7 ], and gets enlightenment fr om the ant col ony algorithmwith 22 op t l ocal op ti mizati on for solving traveling sales man p roblems : Exchange strategy canmake the algorithm have faster conver2gence rate and get better quality s oluti on . So this paper p resents the ant col ony algorithm based on exchange stragegy . Comparedwith A I AACA algorithm, experi ment results demonstrate that the algorithm p r oposed in this paper has the same result but therunti me is shorter . So this algorit m is rather efficient for s olvingmulti2 di mensi onal 02 1 knap sack problem.
展开▼
机译：中文摘要:在项目决策与规划、资源分配、货物装载等工作中 ,提出了多维 0-1背包问题 ,对这一问题 ,国内外学者提出了许多算法。本文推广了文献 [ 7 ]中求解单维 0-1背包问题的蚁群算法 ,并从结合 2-opt等局部优化的蚁群算法求解旅行商问题中得到启示:通过交换策略可以加快算法的收敛速度和获取更高质量的解 ,因此提出了基于交换策略的蚁群算法。再把这种算法与 A I AACA算法[ 8 ]进行比较 ,实验结果显示该算法与 A I AACA算法效果相当 ,用时更少 ,是求解多维 0-1背包问题的有效算法。英文摘要：Abstract:Multi2 di mensi onal 02 1 knap sack p roblem often appears in decisi on making and p r ogramming, res ource distributi on,l oading, and so on . For solving this p roblem, many algorithms have been p roposed by scholars . This paper extends the ant col onyalgorithm which is used for s olving 02 1 knap sack p r oblem in reference[ 7 ], and gets enlightenment fr om the ant col ony algorithmwith 22 op t l ocal op ti mizati on for solving traveling sales man p roblems : Exchange strategy canmake the algorithm have faster conver2gence rate and get better quality s oluti on . So this paper p resents the ant col ony algorithm based on exchange stragegy . Comparedwith A I AACA algorithm, experi ment results demonstrate that the algorithm p r oposed in this paper has the same result but therunti me is shorter . So this algorit m is rather efficient for s olvingmulti2 di mensi onal 02 1 knap sack problem.
展开▼
