旅行商(TSP)问题用标准遗传算法（GA）在matlab下实现的。-The traveling salesman problem (TSP) using standard genetic algorithm (GA) under Matlab.

运用delphi7进行编程，能够解决TSP旅行商问题的基本遗传算法的实现，其中参数可自定义-Programming using delphi7, able to solve the TSP traveling salesman problem of the realization of the basic genetic algorithm, the parameter can be customized

应用遗传算法解决旅行商（TSP）问题，算法中的染色体交叉过程改进了基本遗传算法的交叉办法。改程序可以求解30个城市的旅行商问题，也可以稍作修改继续扩展为更多城市的旅行商问题。-Applying the genetic algorithm to solve the traveling salesman (TSP) problem, the algorithm improves the process of chromosomal crossover compared to traditional

This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for t