搜索资源列表
mrsim-win
- winwods下的组播路由算法仿真程序， vc6开发，是根据上次传的linux版本 改编而成。-winwods the multicast routing algorithm simulation program, vc6 development, is based on the previous version of Linux-wing.
Beefor3LVRP
- 尝试使用蜜蜂算法来求解带三维装载的车辆调度问题，算法具有一定的新颖性。-Try to use the bees algorithm to solve with a three-dimensional loading vehicle routing problem, the algorithm has a certain novelty.
Dijkstra
- Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 and published in 1959is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortes
D
- dijkstra routing algorithm in the wireless sensor network
MOPSOwang
- 关于模糊车辆路径问题的多目标粒子群算法，里面有作者提出的实数编码方式，在经典的MOPSO基础上完成的。模糊包括模糊需求、模糊旅行时间和模糊服务时间多重模糊特性。-Fuzzy vehicle routing problem with multi-objective particle swarm algorithm, which has the real number encoding, proposed by the authors in classic MOPSO based on. Fuzzy
dijkstra
- Dijkstra routing algorithm example
file
- 以c++編寫的存貨途程問題,無任何演算法應用,純粹為這個問題的編寫-In c++ written inventory routing problem, no algorithm applied solely for the preparation of this issue
Astar
- A星寻路算法在游戏中的应用，通过传入开始点和目标点完成寻路-Application of A star pathfinding algorithm in the game, the start point and the target point to complete routing
Astar-algorithm
- A*算法最优寻路算法,算法是一种静态路网中求解最短路最有效的算法.-A* algorithm for optimal routing algorithm, the algorithm is a static road network to solve the shortest most efficient algorithms.
node_generation
- this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table-this the algorithm to find the shortest path source to destination. It can be used to find and device the routing table
dijkstra
- djikastra algorithm to chose the best bath for routing multihop multicast routing
pos
- 改进后的粒子群算法，可用于求解规划问题，路径问题和相关多目标组合优化问题-The improved particle swarm optimization (pso) algorithm, can be used to solve the planning problem, the routing problem and the relevant multi-objective combinatorial optimization problem