How autonomy oriented computing (AOC) tackles a computationally hard optimization problem

  • Authors:

  • Xiao-Feng Xie;Jiming Liu

  • Affiliations:

  • Hong Kong Baptist University, Kowloon Tong, Hong Kong;Hong Kong Baptist University, Kowloon Tong, Hong Kong

  • Venue:
  • AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The hard computational problems, such as the traveling salesman problem (TSP), are relevant to many tasks of practical interest, which normally can be well formalized but are difficult to solve. This paper presents an extended multiagent optimization system, called MAOSE, for supporting cooperative problem solving on a virtual landscape and achieving high-quality solution(s) by the self-organization of autonomous entities. The realization of an optimization algorithm then can be described in three parts: a) encode the representation of the problem, which provides the virtual landscape and possible auxiliary knowledge; b) construct the memory elements at the initialization stage; and c) design the generate-and-test behavior guided by the law of socially-biased individual learning, through tailoring to the domain structure. The implementation is demonstrated on the TSP in details. The extensive experimental results on real-world instances in TSPLIB show its efficiency as comparing to other algorithms.