搜索资源列表
project
- vrp 用java写的小程序 解决车辆路径配送问题-vrp solve vehicle routing and distribution problems
VRP_GA
- 在VC6.0中实现的使用遗传算法（GA）实现有时间窗约束的车辆路径问题（VRP）。-In VC6.0 achieved using genetic algorithm (GA) to achieve a time window constraint vehicle routing problem (VRP).
tccrouter
- 建模和仿真工具，用于对图形的路由问题，tccrouter是一个java桌面应用程序，提供了一个2D地图构建图形和模拟各种真实世界的路由解决方案：最短路径，小勺，VRP，VRP-TW-a modeling and simulation tool for routing problems on graphs, tccrouter is a java desktop application that provides a 2d map for building graphs and simulatin
geneticVRP
- matlab编程遗传算法代码，解决VRP车辆路径问题-Genetic algorithm matlab programming code to solve VRP Vehicle Routing Problem
distribusi
- vrp using GA to minimize travel time. vehicle routing problem to solve scheduling. from depot to consumer. and the go back to the depot
source
- VRP C/C++ Library of Local Search Heuristics for the Vehicle Routing Problem. ... latest source code can be obtained http://www.coin-or.org/projects/VRPH.xml-VRP C/C++ Library of Local Search Heuristics for the Vehicle Routing Problem. ... latest sou
vrp_ga
- 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
ant_vrp
- 蚁群算法解决中规模车辆路径问题，vrp国际案例验证，可以运行，有图-Ant colony algorithm to solve the scale of vehicle routing problem, VRP international case verification, you can run, there are plans
VRP_algorithm
- 5个求解车辆路径问题（VRP）的MATLAB算法源程序和相应数据（数据也在m文件里），包括三种遗传算法，SA算法和禁忌搜索算法的m文件-5 solving vehicle routing problem (VRP) MATLAB algorithm source and the corresponding data (data is also in the m file), including three kinds of genetic algorithm, SA algorithm and
基于遗传算法的matlab语言车辆路径问题
- 车辆路线问题（VRP）最早是由Dantzig和Ramser于1959年首次提出，它是指一定数量的客户，各自有不同数量的货物需求，配送中心向客户提供货物，由一个车队负责分送货物，组织适当的行车路线，目标是使得客户的需求得到满足，并能在一定的约束下，达到诸如路程最短、成本最小、耗费时间最少等目的。(The vehicle routing problem (VRP) was first proposed by Dantzig and Ramser in 1959, it refers to a cer
ACATSP
- 旅行商问题(Traveling Saleman Problem，TSP)是车辆路径调度问题(VRP)的特例，由于数学家已证明TSP问题是NP难题，因此，VRP也属于NP难题。旅行商问题（TSP）又译为旅行推销员问题、货郎担问题，简称为TSP问题，是最基本的路线问题，该问题是在寻求单一旅行者由起点出发，通过所有给定的需求点之后，最后再回到原点的最小路径成本(Traveling salesman Problem ('ll Saleman Problem, TSP) is a special case
蚁群算法
- 蚁群算法的代码实现，主要是针对车辆路径优化VRP 问题的实现(The vehicle routing problem with ant colony optimization algorithm)