Skip to content
Multiagent optimization system (MAOS) for solving the Traveling Salesman Problem (TSP).
Branch: master
Clone or download
Pull request Compare This branch is 5 commits ahead, 53 commits behind wiomax:master.
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.


The multiagent optimization system (MAOS) supports the cooperative search by self-organization of multiple agents situated in an environment with certain sharing public knowledge. Each agent in MAOS is an autonomous entity with individual memory and behavioral components. Based on the MAOS framework, some efficient knowledge components for solving the traveling salesman problem (TSP) are implemented. The experimental results on TSP benchmark data sets show that MAOS-TSP [1] could achieve optimal solutions very efficiently for large-scale instances, and is competitive as compared with state-of-the-art algorithms.

  • Current version: The mini Series V1.00.04 (Java)

License description

See the Creative Commons Non-Commercial License 3.0 for more details.

Please acknowledge the author(s) if you use this code in any way.

Quick start

Execute: Enter the directory "myprojects", then run the file "examples.bat".

Compile: Run "ant" to compile in the command line, or import "Java Project from Existing Ant Build File" in Eclipse IDE.


[1] X.-F. Xie, J. Liu. Multiagent optimization system for solving the traveling salesman problem (TSP). IEEE Transactions on Systems, Man, and Cybernetics - Part B, 2009, 39(2): 489-502. [PDF]

General information

Portal: E-MAIL:

You can’t perform that action at this time.