Location:
Search - vrp in matlab
Search list
Description: 应用遗传算法是被认为求解NP难题的有效手段之一,求解物流配送车辆路径优化问题时,在传统遗传算法的基础上,并引入了免疫算法的思想,实验结果表明该算法具有更好的全局和局部搜索能力和收敛速度,可有效地解决物流配送车辆路径优化问题。-Application of genetic algorithms to solve NP is considered an effective means of problem solving to optimize logistics and distribution vehicle routing problem, in the traditional genetic algorithm based on immune algorithm and the introduction of ideas, experimental results show that the algorithm has a better overall and local search ability and convergence speed, which can effectively solve the logistics and distribution VRP.
Platform: |
Size: 7168 |
Author: 王博文 |
Hits:
Description: 详细讲述模拟退火算法的理论原理。并TSP问题为例进行讲解，并各处多种语言的源代码，包括c，matlab以及delphi。
-Simulated annealing algorithm described in detail the theory of principle. And TSP as an example to explain the problem and the source code of various languages, including c, matlab, as well as delphi.
Platform: |
Size: 25600 |
Author: lian |
Hits:
Description: VRP问题的遗传算法程序 matlab写的，经典，智能算法-the procedures of VRP problem which is
compiled by GA and running in matlab.
Platform: |
Size: 7168 |
Author: 武开 |
Hits:
Description: 31个城市的VRP进行蚁群算法求解的matlab源码-31 cities, ant colony algorithm for VRP to the matlab source code
Platform: |
Size: 2048 |
Author: 叶宏 |
Hits:
Description: 进化算法及其在全局优化和VRP中的应用的毕业论文-Evolutionary Algorithm and Its
Application in GlobalOptimization and Vehicle Routing Problem
Platform: |
Size: 532480 |
Author: 炯炯 |
Hits:
Description: 用matlab解决vrp问题,本程序为遗传算法解决基本VRP问题的例程。各供货点距离矩阵及遗传算法参数在VRP.M中给出。以路径长度作为遗传算法的适应度函数，约束函数通过在LEN中增加惩罚因子体现，本程序简便起见将不满足约束的直接加100；-Vrp matlab to solve the problem with the program for the genetic algorithm to solve the basic problem VRP routines. The delivery point distance matrix and genetic algorithm parameters are given in VRP.M. Path length as a genetic algorithm with fitness function, constraint function by adding penalty factor reflects LEN, this program does not meet the constraints of simplicity will direct plus 100
Platform: |
Size: 4096 |
Author: leo mao |
Hits:
Description: using ACO to solve VRP in matlab,a litle code
Platform: |
Size: 2048 |
Author: Allen |
Hits:
Description: 浙江大学数学建模比赛2013B题Matlab源码，主要使用遗传算法和模拟退火解决自行车调度问题，此处为有时间窗的VRP问题，注释详尽，方便改进维护-Zhejiang University Mathematical Contest in Modeling 2013B title Matlab source code, detailed notes, easy to improve maintenance
Platform: |
Size: 245760 |
Author: Outrace |
Hits:
Description: this code solves vehicle routing problem using simulated annealing algorithm in matlab.
in this code , we create different models and then evaluate them using SA algorithm.
one of the advantage of this code , is that code is splitting different sections.
and the output of this code is represented vehicles and customers graphically.
Platform: |
Size: 3072 |
Author: mojtaba |
Hits:
Description: vrp code with ant colony in matlab
Platform: |
Size: 2048 |
Author: mohammad.b |
Hits:
Description: 使用matlab编写遗传算法，解决车辆路径最优化问题。-VRp using GA methods
Platform: |
Size: 7168 |
Author: 杨木木 |
Hits:
Description: 利用Matlab编写的程序，GA算法解决车辆调度问题VRP-Programs written in Matlab, GA algorithm to solve vehicle scheduling problem VRP
Platform: |
Size: 7168 |
Author: 曹子建 |
Hits:
Description: 用matlab解决vrp问题,本程序为遗传算法解决基本VRP问题的例程。各供货点距离矩阵及遗传算法参数在VRP-
Vrp with matlab solve problems, the present program to solve the basic problem of genetic algorithm VRP routines. Each delivery point distance matrix and genetic algorithm parameters in VRP
Platform: |
Size: 20480 |
Author: lxg |
Hits:
Description: 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 tabu search algorithm m file
Platform: |
Size: 29696 |
Author: 涂超 |
Hits:
Description: 采用matlab语言编写，解决线路规划问题即VRP(solving VRP in matlab)
Platform: |
Size: 21504 |
Author: superjsnow
|
Hits:
Description: 车辆路线问题（VRP）最早是由Dantzig和Ramser于1959年首次提出，它是指一定数量的客户，各自有不同数量的货物需求，配送中心向客户提供货物，由一个车队负责分送货物，组织适当的行车路线，目标是使得客户的需求得到满足，并能在一定的约束下，达到诸如路程最短、成本最小、耗费时间最少等目的。(The vehicle routing problem (VRP) was first proposed by Dantzig and Ramser in 1959, it refers to a certain number of customers, each with different number of demand for goods distribution center to provide goods to customers by a team responsible for the distribution of goods, organize appropriate route, which aims to satisfy the needs of customers. And under certain constraints, such as to achieve the shortest distance, minimum cost and cost least time to.)
Platform: |
Size: 5120 |
Author: niada
|
Hits:
Description: 本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法，通过种群初始化，选择，交叉，变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知，通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without time limit. Using the genetic algorithm of vehicle and customer corresponding permutation coding, through the initialization of population, selection, crossover and mutation, the shortest route of vehicle delivery is obtained. Through MATLAB simulation results, we can see that the route of delivery through genetic algorithm is 61.5000km, which is 5.5km shorter than the random delivery path 67km. The results show that the genetic algorithm can solve the VRP problem effectively.)
Platform: |
Size: 96256 |
Author: 阿雨
|
Hits:
Description: 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。
算法按照tsp问题去解决，但是在最后计算路径的时候有区别。
比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。
计算路径的时候把城市依次放入派送线路中,
每放入一个城市前，检查该城市放入后是否会超过车辆最大载重
如果没有超过就放入
如果超过，就重新开始一条派送路线
……
直到最后一个城市放完
就会得到多条派送路线
这样处理比较简单可以把vrp问题转为tsp问题求解
但是实际效果还需要验证。(First of all, a ant ant class is implemented, and the ant class is used to search.
The algorithm is solved according to the TSP problem, but there is a difference in the final calculation of the path.
For example, there are 10 cities, and 1 of cities are distribution stations. The path for ants to search is 1,3,5,9,4,10,2,6,8,7.
When calculating the path, place the city in the delivery route,
Before entering a city, check whether the city will exceed the maximum load of the vehicle after it is put in
If it's not over, put it in
If it's over, start a delivery route again
......
Until the last city is over
You'll get multiple delivery routes
This approach is relatively simple, you can change the VRP Problem to TSP problem solving
But the actual results need to be verified.)
Platform: |
Size: 40806400 |
Author: Ywain
|
Hits:
Description: 首先实现一个ant蚂蚁类，用此蚂蚁类实现搜索。
算法按照tsp问题去解决，但是在最后计算路径的时候有区别。
比如有10个城市,城市1是配送站，蚂蚁搜索的得到的路径是1,3,5,9,4,10,2,6,8,7。
计算路径的时候把城市依次放入派送线路中,
每放入一个城市前，检查该城市放入后是否会超过车辆最大载重
如果没有超过就放入
如果超过，就重新开始一条派送路线
……
直到最后一个城市放完
就会得到多条派送路线
这样处理比较简单可以把vrp问题转为tsp问题求解
但是实际效果还需要验证。(First, we implement a ant ant class, and use this ant class to search.
The algorithm is solved according to the TSP problem, but there are differences when calculating the path at last.
For example, there are 10 cities, 1 of cities are distribution stations, and the path of ants search is 1,3,5,9,4,10,2,6,8,7.
When calculating the path, put the city into the delivery line in turn.
Before placing a city, check whether the city will exceed the maximum vehicle load after putting it into the city.
If it's not over, put it in
If it's over, start a new route.
......
Until the last city is finished
There will be multiple delivery routes
This process is relatively simple and can transform the VRP problem into TSP problem solving.
But the actual effect needs to be verified.)
Platform: |
Size: 2048 |
Author: henrylalala |
Hits:
Description: 假设在一个供求关系系统中，车辆从货源取货，配送到对应的若干配送点。车辆存在最大载货量，且配送可能有时间限制。需要合理安排取货时间，组织适当的行车路线，使用户需求得到满足，同时使某个代价函数最小，比如总工作时间最少、路径最短等。
可以看出TSP问题是VRP问题的一种简单特殊形式。因此，VRP也是一种NP hard 问题。
目前解决此种问题的办法有多种，主要以启发式算法为主。包括退火算法、遗传算法、蚁群算法、禁忌算法等，本文介绍两种比较简单算法：C-W节约算法和遗传算法。(Assume that in a supply and demand relationship system, the vehicle picks up the goods from the source and delivers them to the corresponding distribution points. There is a maximum amount of cargo in the vehicle and there may be a time limit for delivery. It is necessary to arrange the picking time reasonably, organize the appropriate driving route, and satisfy the user's needs, and at the same time minimize a certain cost function, such as the minimum total working time and the shortest path.
It can be seen that the TSP problem is a simple and special form of the VRP problem. Therefore, VRP is also an NP hard problem.
At present, there are many ways to solve this kind of problem, mainly based on heuristic algorithms. Including annealing algorithm, genetic algorithm, ant colony algorithm, tabu algorithm, etc. This paper introduces two simple algorithms: C-W saving algorithm and genetic algorithm.)
Platform: |
Size: 4096 |
Author: HappyppaH |
Hits: