GA_Traffic The Traveling Salesman Problem (TSP) is maybe the archetypical problem in combinatorial optimization. This problem and its generalizations, vehicle routing problems, have been studied for more than thirty years two entire monograph

有能力约束车辆路径问题混合量子进化算法编码-Vehicle routing problem with capacity constraints coded quantum evolutionary algorithm

vrp 用java写的小程序 解决车辆路径配送问题-vrp solve vehicle routing and distribution problems

JOpt.SDK是一个自动化车辆路线和派送Java/J2SE和.NET.组件的工具。它可以解决旅行推销员的问题（TSP）和时窗限制路线规划的问题。它提供了各种因素限制的最佳化运输路线，如时窗，负载能力，规定行程路线。该组件是基于遗传算法，并自动确定订单任意设置车辆的优化配置。-JOpt.SDK is an automated vehicle routing and delivery of Java/J2SE and.NET. components of the tool. It can solv