Dual-Population Ant Colony Optimization for Solving the 75-City Chinese TSP Problem
This toolkit implements a dual-population ant colony algorithm to solve the shortest path problem for 75 Chinese cities, which represents a classical Traveling Salesman Problem (TSP). The package includes MATLAB implementation with main.m as the entry point, featuring parameter customization and iterative optimization capabilities.