用GA遗传算法求解VRP车辆配送问题，以及VRP的特殊情况TSP旅行商问题,GA Genetic Algorithm for VRP with the distribution of vehicles, as well as the special circumstances of VRP Traveling Salesman Problem TSP

在VC6.0中实现的使用遗传算法（GA）实现有时间窗约束的车辆路径问题（VRP）。-In VC6.0 achieved using genetic algorithm (GA) to achieve a time window constraint vehicle routing problem (VRP).

利用遗传算法用于研究车辆配送多个客户点的问题，并且有时间窗限制以及配送率。-Genetic Algorithm for Vehicle Distribution multiple customers point problem, and there is a time window constraints and the distribution rate.

Programs that use the method of genetic problem solving the VRP program, very practical, experimental, graduation can be used to run, with complete results and figure, well, this algorithm can be used to obtain optimal exact or approximate optimal so

最优路径遗传算法，用于搜寻最优路径，可根据需要修改目标函数，最小成本、最短时间等(Genetic alogrithm for optimal-path searching ,available for finding out the best path,constrained by minimum-cost,minimum-time.etc.)