搜索资源列表
C-W-savings-algorithm
- C-W节约算法是最经典的求解车辆路径问题的启发式算法。-The Clarke and Wright(1964) savings algorithm is perhaps the most widely known heuristic for the VRP.
backtracking-algorithm-C
- 这是求解VRP和TSP相关问题的回溯算法，基于C语言环境-This is a VRP and TSP solving issues related to backtracking algorithm, based on C language environment
rc1
- 用于vrp车辆调度标准数据，方便学术研究，为他人提供便利。-Vrp standards for vehicle scheduling data to facilitate academic research, to facilitate others.
ant-algorithms-of-vrp
- 采用蚁群算法能够解决31个城市的旅行商问题，相对于遗传算法，模拟退火算法和其他的算法，蚁群算法有其自身的优势-Ant colony algorithm to solve the traveling salesman problem 31 cities, with respect to genetic algorithms, simulated annealing algorithm and other algorithms, ant colony algorithm has its own ad
ant-vrp
- 基于蚁群算法写的关于旅行商问题的代码，功能可以解决基本的问题，希望能帮助大家！下载吧-Ant colony algorithm based on code written by the traveling salesman problem, the function can solve the basic problem, hoping to help you! Download it
PSO
- 目前车辆路径问题是关注的焦点，本程序是解决VRP的基本程序(solve VRP)