搜索资源列表
ConsoleApplication4
- 用Dijkstra算法求有向图G的v1顶点到其他顶点v的最短路径Path[v]及其距离Dist[v],以学校地点为例-With Dijkstra algorithm for a directed graph G vertices v1 shortest path to other vertex v Path [v] and its distance Dist [v], school locations Case
jiedian
- 在正方形区域内产生均匀分布的随机拓扑,红色信标节点 . 黑色未知节点,初始化节点间距离,跳数矩阵,最短路径算法计算节点间跳数,球每个信标节点的校正值,最小二乘法求未知点坐标-Generate uniformly distributed random topology in the square area, red beacon nodes. Black unknown nodes, the distance between node initialization, hop count matri
mdmtspv_ga
- This code is aimed at solving the multiple depots multiple traveling salesman problem by using genetic algorithm.Finding a (near) optimal solution to a variation of the M-TSP (that has a variable number of salesmen) by setting up a GA to search for t
MTSP
- mtspf_ga.m是主函数，floyed 是计算任意两点最短路径的算法，myLength 是计算距离的函数，lujing是本例子中所需的数据，只需运行ceshide 即可完美解决“最佳灾情巡视路线问题”。-Mtspf_ga.m is the main function, floyed is to calculate the shortest path of any two points of the algorithm, myLength is a function of distance c
Floyd算法程序及PPT讲解
- 使用MATLAB运行，输入距离矩阵，即可得到任意两点之间最短路。采用Floyd算法思想。(Run with MATLAB, enter the distance matrix, you can get the shortest line between any two points. Using the idea of Floyd algorithm.)
理论知识与选题介绍
- VRP问题的目标函数通常有三类： 总配送距离最短 总配送时间最短 总配送费用最少(The objective functions of the VRP problem are usually of three kinds: The total distribution distance is the shortest The total delivery time is the shortest The total distribution cost is at least)
Dijkstra算法
- 迪杰斯特拉算法求最短路径距离，可用于流形测地距离计算中。(Dijkstra algorithm for the shortest path distance, can be used for manifold geodesic distance calculation.)
MPI_Distributed_Genetic_Algorithm-master
- For this project I implemented a parallel formulation for the Traveling Salesman Problem (TSP). The TSP is a NP-hard problem in combinatorial optimization. Given a list of cities with their pairwise distance, the task is to find the shortest route th
Desktop
- 计算v0（1）到v1各点的最近距离，最短路径算法(Calculate the closest distance between V0 (1) to V1 and the shortest path algorithm)
bin
- 求散点到中心点的距离，包括矩阵的变换等等，在中心点已知的情况下求出十个最短的距离(Scatter the distance from the center to the center, including the transformation of the matrix, etc., and find the ten shortest distances in the case where the center is known)
编辑距离
- 程序提示用户输入一行字符串（字符个数不超过80个，该字符串用回车符结束）。并按字母，数字及其他字符分类计数，然后将结果存入以char、digit和other为名的存储单元 字符串转换所需最短的编辑距离(The program prompts the user to enter a string of characters (no more than 80 characters, and the string ends with carriage returns). It is classifi
蚁群算法
- 求解单旅行商问题的智能算法，蚁群算法。 输入城市间赋权向量（城市间路程），即可输出经过所有城市且总路程最短的最小哈密顿环。(telligent algorithm for solving single traveling salesman problem, ant colony algorithm. By inputting the weight vector between cities (the distance between cities), the minimum Hamilton
lanzhouroad
- 兰州道路交通网络信息查询。设计一个简单的能够实现兰州道路交通网络信息查询功能的系统。兰州道路交通网采用邻接矩阵（或邻接表）表示，包括道路交通网邻接矩阵（或邻接表）的建立、路径（或时间）的查询、最短路径（或最短时间）的查找、显示输出等功能；兰州道路交通网中顶点表示地名、图上的弧表示两地之间有路径存在、弧上的权值表示两地之间的距离（或时间）(Information query of road traffic network in Lanzhou. Design a simple system tha
Snake-master
- We use breadth-first search to find the shortest path. We additionally expect the path to be as straight as possible so there will be less scattered empty points on the map, which will improve the AI's success rate. The image below illustrates how
astardemo
- A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(A * search algorithm commonly known as A Star algorithm. A * algorithm is one of the more popular heuristic search algorithms and is
Multiple Traveling Salesmen Problem
- MTSP_GA Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the M-TSP by setting up a GA to search for the shortest route (least distance needed for the salesmen to travel to each city exa
astar-master
- A*算法，A*（A-Star)算法是一种静态路网中求解最短路径最有效的直接搜索方法，也是解决许多搜索问题的有效算法。算法中的距离估算值与实际值越接近，最终搜索速度越快。(A* algorithm and A* (A-Star) algorithm are the most effective direct search methods for solving the shortest path in static road network, and also are effective algo
粒子群算法
- 粒子群算法求解最短旅行距离问题，从而寻求最优化。(Particle swarm optimization is used to solve the shortest travel distance problem, so as to search for optimization.)
AStarPath
- A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(The A* search algorithm is commonly known as the A-star algorithm. The A* algorithm is one of the more popular heuristic search algor
new-DV-Hop-code
- 改进DV-Hop定位算法 首先设置初始量，布置了一个范围为100×100m2的区域，其上随机分布100个传感器节点，其中有10个信标节点，节点的通信半径为30m。 第二步在正方形区域内产生均匀分布的随机拓扑，随机产生节点坐标并将其中十个选定为信标节点，其余九十个设为未知节点，然后画出节点分布图。 第三步通过最短路径法计算未知节点与每个信标节点的最小跳数。 第四步根据前面记录的其他信标节点的位置信息和相距跳数估算平均每跳的实际距离，用跳数估计距离的方法得出未知节点到信标节点的距离。 第五