Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: 图论算法库 C++ 语言实现 代码内容 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 - -graph theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit Platform: |
Size: 4096 |
Author: |
Hits:
Description: 蚂蚁算法的matlab实现规则来源于大自然的进化。而大自然的进化根据刚才讲的也体现为多样性和正反馈的巧妙结合。而这样的巧妙结合又是为什么呢？为什么在你眼前呈现的世界是如此栩栩如生呢？答案在于环境造就了这一切，之所以你看到栩栩如生的世界，是因为那些不能够适应环境的多样性与正反馈的结合都已经死掉了，被环境淘汰了！-Ant Algorithm matlab from the realization of the rules of nature and evolution. The evolutionary nature of the basis of the speakers also reflected in the diversity and the unique combination of positive feedback. This ingenious combination is Why? Why is presented in front of your eyes the world is so lifelike it? The answer lies in the environment has created all this, because you see life-like world, is because those who could not adapt to the environment of diversity and the combination of positive feedback have been dead and was out of the environment! Platform: |
Size: 2048 |
Author:孙子平 |
Hits:
Description: matlab程序实现 最短路径问题 最短路径问题是图论研究中的一个经典算法问题， 旨在寻找图（由结点和路径组成的）中两结点之间的最短路径-matlab program to achieve the shortest path problem shortest path problem is the study of graph theory, a classical algorithm for the problem, aimed at finding a plan (by the node and path composed of) two nodes of the shortest path between Platform: |
Size: 2048 |
Author:孙子平 |
Hits:
Description: 最短路径的matlab文件，最短路径无论是在数据结构还是在图论中，都占有比较重要的地位-The shortest path of matlab files, shortest path, whether in data structures or graph theory has played an important role compared Platform: |
Size: 3072 |
Author:小明 |
Hits:
Description: 蚁群算法 适合寻找最优问题，实现最短路径。-Ant colony algorithm for finding the optimal problem, the realization of the shortest path. Platform: |
Size: 3072 |
Author:孙根本 |
Hits:
Description: 代码很好的实现了基于a-star的最短路径寻找算法，并可以对寻找的路径有一个限制-Code is a good realization of a-star-based shortest path search algorithms, and can find the path there is a limit Platform: |
Size: 20480 |
Author:赵红丽 |
Hits:
Description: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6. Platform: |
Size: 47104 |
Author:肖翔 |
Hits:
Description: 此代码是在matlab环境下用Dijkstra算法求最短路径，希望对大家有帮助-This code is used Dijkstra shortest path algorithm matlab environment, we hope to help Platform: |
Size: 1024 |
Author:zhuying |
Hits:
Description: 最短路径解决公交车路径规划问题的MATLAB代码实现(Shortest Path to Solve the Problem of Bus Route Planning MATLAB Code) Platform: |
Size: 53248 |
Author:Steveabc |
Hits:
Description: 基于最短路径解决公交车路径规划问题的MATLAB代码实现(Shortest Path to Solve the Problem of Bus Route Planning MATLAB Code) Platform: |
Size: 53248 |
Author:Steveabc |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm)) Platform: |
Size: 37888 |
Author:解码 |
Hits:
Description: 改进DV-Hop定位算法
首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。
第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。
第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。
第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。
第五步用极大似然估计法求未知节点坐标
(Improved DV-Hop localization algorithm first set the initial amount, layout 100100m2 the area of a range of 100 sensor nodes randomly distributed on the 10 beacon node, the node communication radius of 30m. The second step in the square area to generate uniformly distributed random topology, random coordinates of the nodes and ten of the selected beacon node, the remaining 90 is set to unknown node, and then draw the node distribution diagram. The third step is to calculate the minimum number of hops of the unknown node and each beacon node through the shortest path method. The fourth step according to the location information of the other beacon nodes in the previous record and away from hops to estimate the average hop distance and hop count to estimate the distance to come to the distance of the unknown node to beacon nodes. The fifth step maximum likelihood estimation method and the unknown coordinates of the nodes) Platform: |
Size: 1024 |
Author:robinkk4 |
Hits:
Description: 基于蚁群算法的机器人路径规划MATLAB源码，使用网格离散化的方法对带有障碍物的环境建模，使用邻接矩阵存储该环境，使得问题转化为蚁群算法寻找最短路径。(Robot path planning MATLAB source code based on ant colony algorithm, using grid discretization method to model the environment with obstacles, using adjacency matrix to store the environment, making the problem into ant colony algorithm to find the shortest path.) Platform: |
Size: 5120 |
Author:suitdog |
Hits:
Search - shortest path code matlab