MAOS-QAP: Project Portal

MAOS-QAP: Project Portal

MAOS-QAP is a cooperative group optimization system (MAOS) for solving the Quadratic Assignment Problem (QAP). Related Information: MAOS-QAP shares the MAOS kernel with other MAOS applications (e.g. MAOS-GCP and MAOS-TSP), and contains some modules that are specifically for tacking QAP. Please find other related code and software in our Source Code Library. Basic Description What’s New Directories & Files Command Line & Parameters O

Work on solving the Traveling Saleman Problem was published on IEEE Trans. on SMC-B

Work on solving the Traveling Saleman Problem was published on IEEE Trans. on SMC-B

MAOS-TSP is a cooperative group optimization system for solving the Traveling Salesman Problem (TSP). It has been tested and achieved optimal solutions efficiently for large-scale instances. The code can be downloaded here.  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] Abstract: The mu

Work on solving the Graph Coloring Problem was published on Journal of Combinatorial Optimization

Work on solving the Graph Coloring Problem was published on Journal of Combinatorial Optimization

MAOS-GCP is a cooperative group optimization system for solving the Graph Coloring Problem (GCP). It has been tested and achieved optimal solutions efficiently for large-scale instances. The binary code can be downloaded from the portal. Xiao-Feng Xie, Jiming Liu. Graph coloring by multiagent fusion search. Journal of Combinatorial Optimization, 2009, 18(2): 99-123. [DOI] Abstract: A multiagent fusion search is presented for the graph coloring pr