Traveling Salesman Problem (TSP)
[Chinese version]

The traveling salesman problem (TSP) is a classic combinatorial optimization problem. Although it can be easily formulated, it exhibits various interesting aspects of hard computational problems and has often served as a touchstone for novel approaches. Moreover, TSP has various applications, such as Vehicle Routing Problem (VRP), VLSI design, rearrangement clustering, and predicting protein functions, etc.

Related Papers

  • Xiao-Feng Xie, Jiming Liu. Multiagent optimization system for solving the traveling salesman problem (TSP). IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2009, 39(2): 489-502. [DOI]
  • Xiao-Feng Xie, Jiming Liu. How autonomy oriented computing (AOC) tackles a computationally hard optimization problem. International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), Hakodate, Japan, 2006: 646-653 [DOI]
  • Software Download
    name type* description
    MAOS_TSP SRC JAVA, Multiagent optimizer for solving the Traveling Saleman Problem (TSP) in TSPLIB format
    *abbreviations: SRC=source code; BIN=binary code
    Return to homepage

    Maintained by AdaptiveBox StUdIo, under a Creative Commons Attribution 3.0 License.