We present an agent approach to solve the nonfixed point-to-point connection problem. The optimization version of this problem is NP-hard and has numerous applications in circuit switching and VLSI design. We use Asynchronous Teams (or A-Teams) technique to search for an optimal global solution. An A-Team is a organization of agents that communicate with each other by means of shared memories. Each agent is a heuristic strategy that can make its own choices about its inputs, scheduling and resource allocation. Computational results comparing our approach against an exact algorithm proposed by Meneses are presented.
Citation:
Fernando de Carvalho Gomes, Cláudio Nogueira de Meneses, Allan G. Lima, Carlos S. Oliveira, "Asynchronous Organizations for Solving the Point-to-Point Connection Problem," icmas, pp.144, Third International Conference on Multi Agent Systems (ICMAS'98), 1998