搜索资源列表
粒子群算法计算最短路径
- 优化问题是工业设计中经常遇到的问题,许多问题最后都可以归结为优化问题. 为了解决各种各样的优化问题,人们提出了许多优化算法,比较著名的有爬山法、遗传算法等.优化问题有两个主要问题:一是要求寻找全局最小点,二是要求有较高的收敛速度. 爬山法精度较高,但是易于陷入局部极小. 遗传算法属于进化算法( Evolutionary Algorithms) 的一种,它通过模仿自然界的选择与遗传的机理来寻找最优解. 遗传算法有三个基本算子:选择、交叉和变异. 但是遗传算法的编程实现比较复杂,首先需要对问题进行编
蚁群算法解决车辆最优路径问题
- 蚁群算法解决车辆最优路径问题，供大家学习交流用了！这个是很不错的代码，功能齐全！,Ant colony algorithm to solve the optimal vehicle routing problem, for we learn to use the! This is a very good code, a full-featured!
矢量地图路径寻优的程序实现
- A* 算法矢量地图路径寻优的程序实现 VC实现最优路径-A* algorithm for vector map the path optimization process to achieve
85809936aodv
- 移动网络中，AODV和DSR路由算法的matlab程序，根据已知节点可选出最优路径-Mobile networks, AODV and DSR routing algorithm matlab program, the node can be selected according to the known optimal path
Traffic
- 交通咨询，实现最优路径查询(时间，花费等....）可查询任意两个城市之间，以及一个城市到其他城市的走少花费-Transport Advisory and achieve the optimal path query (time, cost, etc. ....) can be found between any two cities, as well as a city to move to other cities with less
ant
- 一种可运行的最优路径蚁群算法,可以用于机器人路径寻优等方向-An optimal path running ant colony algorithm, robot path can be used to find the direction of Excellence
Road
- 公交查询系统 实现了站点查询 ，三次换乘算法，可查出最优路径-Public transportation system of the site inquiries inquiries, transfer of three algorithms to identify the optimal path
VBMO
- 用vb编的mo最优路径选择，包括地图的放大缩小等功能。-Vb for the mo with optimal path selection, including the map zoom functions.
k_path
- a* 算法，最优路径，地理信息系统源码， 写的不错，值的一看。-a* algorithm, the optimal path, geographic information system source code, written well, the value of a look.
123
- 数据结构课程设计 校园导航系统 学校中10个地点的最优路径问题-Data structure course design school campus navigation system of 10 locations the optimal path problem
tsppso
- 运用粒子群算法pso来解决旅行商问题中的最优路径的选择。-TSP PSO
dijkstraVB
- 最短路径搜索算法 最优路径 dijkstra算法_VB- the shortest search patch
A
- 本文件为C语言编写，A星寻路算法，自动寻找最优路径-This document is written in C, A Star pathfinding algorithm, automatically find the optimal path. .
aca
- matlab中实现蚁群优化算法在30个城市中寻找一条最优路径。有说明文档。-Ant colony Optimization int matlab and provide a txt document which contains 30 city coordinate
Dynamic-path-planning-
- 最优路径规划，一直是运筹学、最优控制、移动机器人等学科和方向的研究热点-Optimal path planning, has been the operations research, optimal control, mobile robots and other disciplines and research focus in the direction of
最优路径
- 这是一个有关于最优路径的示范代码的压缩文件(This is a compression file on the demonstration code of the best path)
迪杰斯特拉求最优路径
- 根据邻接矩阵，使用迪杰斯特拉法找出两点的最优路径节点和总距离(According to the adjacency matrix, Dijkstra method is used to find the optimal path node and total distance of two points)
区域最优选址
- 采用地图匹配算法实现最优路径选址的MATLAB程序(Map matching algorithm for optimal route location)
基于python的最优路径规划
- 基于蚁群算法的python程序，用于最优路径规划,仅做参考！(Python program based on ant colony algorithm for optimal path planning, only for reference!)
蚁群算法_最优路径（二维）
- 有关蚁群最优算法，求最优路径，亲测有效，欢迎下载。(For the ant colony optimization algorithm, find the optimal path, pro-test is effective, welcome to download)