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.

Genetic Algorithm Path Planning Program for Solving Shortest Path Problems

A MATLAB-based genetic algorithm path planning program designed to solve shortest path optimization problems with evolutionary computation techniques.

MATLAB Implementation of Genetic Algorithm for Shortest Path Problems

Genetic Algorithm and Ant Colony Optimization for Solving Shortest Path Problems with MATLAB Code Implementation