【摘要】 图的着色问题是一典型的优化的问题,用蚂蚁算法求解图着色问题,可保证程序运行的高效率及高收敛性,有效避免了解此问题时极易陷入局部极小的缺陷,并且能较快的收敛。本文着重介绍了用蚂蚁算法解k色图的着色问题的详细步骤。其仿真结果表明,充分说明了蚂蚁算法解决优化问题的优越性。更多还原

【Abstract】 Graph coloring was solved by ant altorthms.Ant algorithms can guarantee the high-efficiency and high astringency of procedure running avoiding understanding effectively this problem the hour sinks into the partial dinky blemish easiest,and can tefrain from rash action quickly.The k-Graph Coloring procedure was introduced.The Graph Coloring is a typical optimized problem,the emulation results showed the superiority of ant algorithms in solving optimal broblems更多还原