主要介绍了dvhop算法的源代码，先计算平均每跳的距离，再根据跳数求出锚节点与未知节点的距离，再用三边测量法求出未知节点坐标,Dvhop algorithm introduces the source code, to calculate the average distance of each jump, then jump a few calculated in accordance with anchor nodes and unknown distance from the node,

利用matlab仿真GPS坐标转换，即知道一点的GPS坐标利用测出来的距离俯仰方位信息计算另外一点的GPS坐标。-GPS coordinates conversion using matlab simulation, that is to know that the GPS coordinates use the distance measured from the pitching position information to calculate the GPS coordinates of

用遗传算法写的求解TSP问题 四种情况 多旅行商单出发点 多旅行商多出发点 单旅行商以点的坐标计算及以距离矩阵计算-Written by using genetic algorithms for solving TSP problems, four cases: more than a single starting point for traveling salesman, multi-traveling salesman more than a starting point, a singl

提供两个点坐标，可以利用本程序，计算两点距离，简单好用。-Coordinates of two points, you can use this procedure to calculate the distance to two points, easy-to-use.

TSP问题（又名：旅行商问题，货郎担问题）遗传算法通用matlab程序 D是距离矩阵，n为种群个数 参数a是中国31个城市的坐标 C为停止代数，遗传到第 C代时程序停止,C的具体取值视问题的规模和耗费的时间而定 m为适应值归一化淘汰加速指数,最好取为1,2,3,4,不宜太大 alpha为淘汰保护指数,可取为0~1之间任意小数,取1时关闭保护功能,建议取0.8~1.0之间的值 R为最短路径,Rlength为路径长度- TSP problem (also known as: traveling