基于图的蚁群算法求解一类0-1规划问题

Solving the 0-1 Programming Problem by the Ant Colony Algorithm Based on Directed Graph

基于图的蚁群算法求解一类0-1规划问题.此算法将0-1规划问题抽象为一个有向图,模拟蚂蚁的觅食行为,由一组蚂蚁反复地在图上运动搜索,最终得到最优解.在给出算法的具体步骤后,用3个具体算例对算法进行测试.结果表明该算法具有良好的收敛性和稳定性.

An ant colony algorithm based on the 0-1 programming problem is used to solve a 0-1 programming problem. The algorithm firstly abstracts the problem as a directed graph,and then simulates the ants＇ foraging which makes a group of ants traverse on the directed graph repeatedly and the optimization solution and optimal value can be obtained in the end. The procedure of the algorithm is described in detail,and its convergence and stability are confirmed by the experimental results of three 0-1 programming problems.