基于Agent的整数线性规划问题的求解算法

An Agent-based Algorithm for Integer Linear Programming

Agent技术自 2 0世纪 80年代起一直是分布式人工智能的研究热点。本文主要将先进的 Agent技术和传统的整数线性规划求解算法——分枝定界法相结合 ,给出了具体的基于 A gent的求解算法 。

The agent technology has been the central points in distributed Artificial Intelligence research field since 1980s. This article introduces an agent-based algorithm to solve the integer linear programming problem. It combines the advanced agent technology and traditional branch-and-bound method together. So it reduces the time complexity of achieving the solutions.