搜索资源列表
Vehicle-Routing-Problem
- 车辆行驶路线优化（Vehicle Routing Problem）-traffic route optimization (Vehicle Routing Problem)
chenxu
- 已知北京、上海、广州、昆明和西安五城市航线里程如图。分别实现： 1）找到北京到昆明的最短路径。 2）找到北京到昆明，必须途径上海的路径。 3）找到北京到昆明，必须途径上海，但不能去广州的路径。 -known Beijing, Shanghai, Guangzhou, Kunming and Xi'an City route five mileage figure. Were achieved : 1) to Kunming to Beijing to find t
tsp.rar
- 旅行商问题，总共30个城市，计算最优路线和最短路径,Traveling Salesman Problem, a total of 30 cities, calculating the optimal route and the shortest path
GA
- 基于改进的遗传算法的无人机攻击航路规划设计-Improved genetic algorithm-based attack UAV Route Planning
astar
- A*算法在寻找路径中效率比较高，在此利用a*算法求解最短路径。-use A* algorithm searching the optimul route.
ACOforTSP
- tsp问题的群蚁算法实现，其中c为测试矩阵，代表各点的相对坐标，NC_max 最大迭代次数 ，m蚂蚁个数，Alpha 表征信息素重要程度的参数，Beta 表征启发式因子重要程度的参数，Rho 信息素蒸发系数，Q 信息素增加强度系数，R_best 各代最佳路线，L_best 各代最佳路线的长度，运行后得到最佳路线和收敛曲线-ant problem tsp algorithm group, of which c for the test matrix, the representative of
gjlx
- 一个用VB写的公交路线自己随意改的程序，鼠标控制路线-A bus route with VB written in their own procedures for random change, mouse control line
mtsp_ga
- 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 exactly o
tsp_ga
- SP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA) Finds a (near) optimal solution to the TSP by setting up a GA to search for the shortest route (least distance for the salesman to travel to each city exactly once and return to t
FindPathIdea
- 寻路算法新思维,一种新的AI寻路方式——矢量寻路算法。-Algorithm for Route new thinking, a new kind of AI pathfinding way- Vector Routing Algorithms.
ACATSP
- C表示 n个城市的坐标，为n×2的矩阵 NC_max为最大迭代次数 m表示蚂蚁个数 Alpha 表征信息素重要程度的参数 Beta 表征启发式因子重要程度的参数 Rho 信息素蒸发系数 Q 信息素增加强度系数 R_best 各代最佳路线 L_best 各代最佳路线的长度-C indicated that the coordinates of n cities, in order to n × 2 matrix NC_max maximum numbe
kaiguanhebuxian
- 给定一个矩形布线区域，其外围有若干针脚。两个针脚之间通过布设一条金属线路而实现互连。这条线路被称为电线，被限制在矩形区域内。如果两条电线发生交叉，则会发生电流短路。所以，不允许电线间的交叉。每对互连的针脚称为网组。现要求设计一个算法来确定：对于给定的网组，能否合理地布设电线以使其不发生交叉。-Given a rectangular routing region, its periphery a number of pins. Between the two pins through the em
antD
- 旅行商问题：某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-Traveling salesman problem: a number of sales going to the city to sell goods, known distance between cities (or passage). He selected one from a resident, goes throug
TSP
- 城市之间最短路线算法,输入城市之间距离矩阵矩阵-Algorithm for the shortest route between cities, between cities distance matrix input matrix
AStarAlgorithmAndSourceCode
- 《A星寻路算法初探》中文及英文版，及其配套源代码-" A Star Algorithm for Route of" Chinese and English, and supporting source code
pathplanningbasedonprobabilitymap
- 基于威胁概率地图的航迹规划方法，首先建立威胁概率地图，然后利用A—star算法进行航迹寻优秀。-Threat probability map based on route planning, threat probability map is established, then using A-star algorithm for finding good track.
car
- 给定一个N*N 的方形网格，设其左上角为起点◎，坐标为（1，1），X 轴向右为正，Y 轴向下为正，每个方格边长为1。一辆汽车从起点◎出发驶向右下角终点▲，其坐标为（N， N）。在若干个网格交叉点处，设置了油库，可供汽车在行驶途中加油。汽车在行驶过程中应遵守如下规则： 求汽车从起点出发到达终点的一条所付费用最少的行驶路线。-Given an N* N square grid, set the upper left corner as a starting point ◎, c
RomanForts
- Small program to find the best route to follow. Needs improvement but can help understand the concept of the A* Algorithm.
ACATSP
- 蚁群算法求最佳路径，特别用来路径优化很有用-Ant colony algorithm for the best path, particularly useful for route optimization
gaijinACATSP
- 该算法是改进蚁群算法，也是用来路径优化，但是收敛速度快-The algorithm is improved ant colony algorithm is used to route optimization, but the convergence speed