Description: 本系统采用ST公司ARM7芯片STR710FZT6为核心进行设计，合理利用了该芯片上丰富的资源，实现小车智能蔽障、寻迹，信息无线传输等功能， 从而在远端PC上对获取的信息进行实时显示。本系统针对现实中出现的对于未知区域实时探测的需求，适当进行了简化，利用迷宫进行模拟。 其中，有一台智能小车，和一个PC端。小车在迷宫行进的过程中，会自动蔽障、选择路线，并通过无线模块将行进的信息实时传送给远端PC机 ，从而在PC端显示出小车在迷宫中行进的路线。为了达到在迷宫中行走的目的，我们要设计蔽障和迷宫算法，为了使小车的信息能够实时传输到远端PC机，就需要设计一套较为实用和可靠的无线通信协议。 -The system uses ST s ARM7 chip STR710FZT6 core design, the rational use of the chip on the wealth of resources to achieve smart car shield barrier, tracing, information, wireless transmission and other functions, resulting in the remote PC on the information obtained in real time显示. This system addresses the reality of the region appear in real-time detection for unknown needs of the proper conduct of a simplified, using a maze simulation. Among them, there is a smart car, and a PC terminal. Car moving in the maze of the process, will be automatically shield barrier, selection of routes, and through the wireless module will be moving real-time transmission of information to the remote PC, and thus in the PC side show car moving in the maze route. In order to achieve the purpose of walking in the maze, we need to design shield obstacles and maze algorithm, in order to make real-time car information can be transmitted to the remote PC, will need to design a more practical and reliable wi Platform: |
Size: 913408 |
Author:陈祥 |
Hits:
Description: 一个较完善的公交路线查询系统，有最佳选择算法。-A more comprehensive bus route search system, has the best selection algorithm. Platform: |
Size: 750592 |
Author:lu |
Hits:
Description: 路由器状态选择算法，两个路由之间最短距离，最短代价-Router state selection algorithm, the shortest distance between two route, the shortest consideration Platform: |
Size: 2048 |
Author:章章 |
Hits:
Description: 建立了带约束条件的物流配送问题的数学模型，运用蚁群算法解决物流配送路径
优化问题，并将遗传算法的复制、交叉、变异等遗传算子引入蚁群算法，同时改进信息素的
更新方式、客户点选择策略，以提高算法的收敛速度和全局搜索能力。经过多次实验和计算 ，证明了用改进的蚁群算法优化物流配送线路，可以有效而快速地求得问题的最优解或近似最
优解。-A mathematical model with the constraints of logistics and distribution issues, the use of ant colony algorithm to solve the problem of logistics distribution route optimization, replication and genetic algorithms, crossover and mutation genetic operators to introduce ant colony algorithm, while improving the way pheromone update customer point selection strategy to improve the convergence speed and global search capability. After several experiments and calculations prove that the optimal solution with improved ant colony algorithm to optimize logistics and distribution lines, can effectively and quickly determined the problem or near optimal solution. Platform: |
Size: 16384 |
Author:低调惜缘 |
Hits:
Description: Energy consumption is prominent and critical issue faced by wireless sensor networks.
The maximum amount of energy is consumed when the sensors communicate with each other.
Therefore energy efficient routing mechanisms are required. In this paper, a routing scheme based
on the fisheye state routing with a difference in route selection mechanism has been proposed to
ensure the reduction in the overall energy consumption of the network. This scheme is named as
Energy-Aware Fisheye State Routing (EA-FSR). It is simulated considering various parameters
using QualNet5.0. Performance of EA-FSR has been compared with the original fisheye state routing algorithm which is also simulated in the same environment. For comparison various parameters
like end-to-end delay average, energy consumption and throughput have been considered. Platform: |
Size: 499712 |
Author:fetemeh |
Hits:
Description: 旅行商问题：一个旅行者要去很多城市，每个城市只去一次，问：该怎么走路线最短？
?
?????? 这个问题可以转化为：随机给n个点，如何连线这n个点，使得连线最短？
?
?????? 这个问题是遗传算法的经典问题~哈哈~~我试着写了一个程序来解决。
?
?????? 采用的策略是：
1.?????? 精英主义：每次有2个最优解直接进入下一代。
2.?????? 轮盘赌选择生育：每次对每一代的个体进行一次轮询，如果不适应度<某个随机数，那么选择这个个体进行生育。
3.?????? 单性繁殖：因为基因组的基因是互斥的且有序的，所以不适合两性繁殖。
4.?????? 交换变异：变异的方式为——随机选择两个不同位置的基因，交换位置。(Traveling salesman problem: a traveler is going to many cities, each city only once, ask: how to go, the shortest route?
This problem can be transformed into random to n points, how to connect the n points, the shortest line?
This problem is a classic problem of genetic algorithm ~ ha ha ~ ~ I try to write a program to solve.
Strategy is used:
1. elitism: every time there are 2 optimal solution directly into the next generation.
2. Roulette: every time a family of polling each generation of individuals, if not to "a random number, then the individual choice of fertility.
3. parthenogenesis: because genes are mutually exclusive and orderly, so it is not suitable for sexual reproduction.
4. exchange variation way -- random selection of two different positions of the gene exchange position.) Platform: |
Size: 90112 |
Author:littlekai
|
Hits:
Description: 航空公司航线最短路问题的Dijkstra算法以及枢纽机场选择问题的算法(Dijkstra algorithm for the shortest route problem of airline and the algorithm of hub airport selection problem) Platform: |
Size: 6144 |
Author:就是量子
|
Hits:
Description: 本文通过遗传算法解决基本的无时限车辆调度问题。采用车辆和客户对应排列编码的遗传算法，通过种群初始化，选择，交叉，变异等操作最终得到车辆配送的最短路径。通过MATLAB仿真结果可知，通过遗传算法配送的路径为61.5000km,比随机配送路径67km缩短了5.5km。此结果表明遗传算法可以有效的求解VRP问题。(In this paper, genetic algorithm is used to solve the basic vehicle scheduling problem without time limit. Using the genetic algorithm of vehicle and customer corresponding permutation coding, through the initialization of population, selection, crossover and mutation, the shortest route of vehicle delivery is obtained. Through MATLAB simulation results, we can see that the route of delivery through genetic algorithm is 61.5000km, which is 5.5km shorter than the random delivery path 67km. The results show that the genetic algorithm can solve the VRP problem effectively.) Platform: |
Size: 96256 |
Author:阿雨
|
Hits:
Search - route selection algorithm