搜索资源列表
Floyd数据结构课程设计的选题
- 数据结构课程设计的选题-医院选址问题的解法,基于C/C++而设计的-Data structures course design topics- hospital location problem solution, based on C/C++ designed to
yiqunjulei
- 基于聚类分析的蚁群算法，主要是应用于多目标选址问题-Ant colony algorithm based on cluster analysis is mainly used in multi-objective location problem
post-office-(fenzhisuanfa)
- post office 邮局选址问题 分治算法，能运行，我已经调好的-post office post office location problem Divide and Conquer Algorithm, can run, I have a good tune
LAP
- 该程序经过运行，无任何问题，可用于解决选址问题-After running the program without any problems, can be used to solve the location problem
main
- Concert c++ example of facility location problem. C++ concert technology is a registered trademark of ILOG CPLEX
find-files
- VB开发人员都会遇到文件定位的问题。VB提供的Dir[(pathname[, attributes])]函数应该可以满足各种文件定位问题。使用Dir函数时，我们必须给它提供文件的全部路径，否则是找不到的。而有时我们往往是不知道文件的路径的，如果要利用该函数来定位文件，我们必须编写一定的代码。笔者在利用该函数编制查找文件的函数时，颇费了些工夫，可是发现查找的效率不高，效果不太理想。那么有没有编码少且更快的方法查找文件呢？笔者后来利用一个 API函数成功地编制了一个高效率的查找文件的函数。-VB d
EyeLocationMethodforDriverFatigueDetectioninDualSp
- ：驾驶疲劳可以从眼睛的状态中反映出来，而眼睛定位是判断眼睛状态的关键。为解决眼睛定位实时性和头部旋转不确定性问题，该文提出一种基于双空间的眼睛定位方法：-】Drowsy driving can be detected by the eye states. Eye location is the key problem for eye states detection. In order to improve real-timeperformance and solve uncertainty o
FuzzyFacilityLocationProblem2
- Fuzzy Facility Location Problem
RandomFacilityLocationProblem
- Random Facility Location Problem
depot
- 仓库选址问题算法，在公路上选择一个位置xp建立仓库，使得仓库为超市供货的总费用最小。-Warehouse location problem algorithm, select a location on the highway xp setting up a warehouse, allowing warehouse supermarket minimize the total cost of supply.
supermarket
- 学校超市选址问题（带权有向图的中心点） 设计要求：对于某一学校超市，其他各单位到其的距离不同，同时各单位人员去超市的频度也不同。请为超市选址，要求实现总体最优 -School Supermarket location problem (with the right of the center of a directed graph) design requirements: For a school supermarkets and other units to its
FLOYD
- FLOYD课程设计 ， 超市选址问题，选出最佳的超市地点-FLOYD curriculum design, supermarket location problem, select the best supermarket locations
2
- 采用速度-位置模型，把优化问题空间转化为随机粒子空间，通过反复迭代寻找最优解，可用于基于pso移动机器人地图创建-Use of speed- location model, the optimization problem space into a random particle space, through repeated iterations to find the optimal solution can be used for mobile robot map building bas
research
- The robot path planning problem is a very challenging problem in robotics. The main goal of this problem is to construct a collision-free path from a starting position to an end or destination position. However, this navigation problem includes s
Floy-Warshall
- Floy-Warshall算法的一个具体应用实例。用于解决城市消防队选址问题-Floy-Warshall algorithm for a specific application example. Used to address the city fire department location problem
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
solutionFFF1
- 工厂选址问题的模拟过程，其中实现了最优化处理-Plant location problem
hwork
- 邮箱选址问题-快速排序完成 有读取文件及测试数据 直接可用-Mailbox location problem- fast sequenced
The-post-office-location
- 这是一个邮局选址问题。给定n 个居民点的位置,编程计算n 个居民点到邮局的距离总和的最小值。上传文件包括可执行文件、源代码和六组测试用例。-This is a post office location problem. N settlements given location, programming calculation of n settlements to the sum of the minimum distance from the post office. Upload files
Supermarket-location-problem-
- 基于MFC的超市选址问题。用户可以点击屏幕地图任意位置设置居民住址，系统会根据快排序、中值算法找出最佳的超市修建位置。-MFC-based supermarket siting problems. Users can click anywhere on the map screen settings resident address, the system will soon sort out the best value in the algorithm to build a supermar