Welcome![Sign In][Sign Up]
Location:
Search - location problem

Search list

[OtherFloyd数据结构课程设计的选题

Description: 数据结构课程设计的选题-医院选址问题的解法,基于C/C++而设计的-Data structures course design topics- hospital location problem solution, based on C/C++ designed to
Platform: | Size: 132991 | Author: testsb | Hits:

[matlabmatlog

Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Shortest path, min cost network flow, minimum spanning tree problems Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP Material handling: Equipment selection General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U.
Platform: | Size: 4853760 | Author: 陈宝文 | Hits:

[Otherana

Description: 蚁群算法是一种求解组合最优化问题的新型通用启发式方法,该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型,基于故障过电流的配电网故障定位变为一种非线性全局寻优问题-Ant colony algorithm is a combinatorial optimization problem to solve a new type of general-purpose heuristic method, the method has positive feedback, distributed computing and constructive greedy heuristic search features. Through the establishment of appropriate mathematical model, based on the fault over-current distribution network fault location into a nonlinear global optimization problem
Platform: | Size: 3072 | Author: 陈艳玲 | Hits:

[Otherknight

Description: 这是一个骑士选址问题,在一个标准8×8的国际象棋棋盘上,棋盘中有些格子是可能有障碍物的。已知骑士的初始位置和目标位置,你的任务是计算出骑士最少需要多少步可以从初始位置到达目标位置。-Cavalier this is a location problem, in a standard 8 × 8 chess chessboard, checkerboard lattice, some of that there may be some obstacles. Cavalier known initial position and target location, your task is to calculate the number of step-by-step Cavalier at least from the initial position to reach the goal.
Platform: | Size: 30720 | Author: 谭晓彤 | Hits:

[AI-NN-PRruby_allocation3

Description: 用遗传算法求物流配送中心解选址问题.有运行结果-Using genetic algorithms for the logistics distribution center location problem solution. Results have
Platform: | Size: 17408 | Author: jj | Hits:

[AI-NN-PR12

Description: 启发式遗传算法在电子商务下物流配送中心选址中的研究. 电子商务环境下的物流配送中心选址问题比较复杂,涉及因素较多。根据物流配送特点,对配送中心选址模型的变动 费用和时间约束作修改,建立更加合理的适用于电子商务环境下的物流配送中心选址模型。由于选址模型属于NP难问题,故采用启 发式遗传算法进行求解。 [关键词] 电子商务 启发式遗传算法 物流配送中心-Heuristic Genetic Algorithm in e-commerce logistics distribution center location under research. E-commerce environment of logistics distribution center location problem is rather complicated, involving many factors. According to the characteristics of logistics and distribution, distribution center location model for changes in cost and time constraints to make changes to the establishment of a more reasonable environment for e-commerce logistics distribution center location model. Because of the location model are NP hard problem, so the use of heuristic genetic algorithm. [Key words] Heuristic Genetic Algorithm e-commerce logistics distribution center
Platform: | Size: 372736 | Author: 唐五 | Hits:

[Database systemAdaptive-Location-Constraint-Processing

Description: 一篇论文,介绍,一个解决方案,对于 自适应的约束问题,主要是讲数据库的操作。-A thesis, introduction, a solution for the adaptive constraint problem, mainly talk about the database
Platform: | Size: 243712 | Author: Jeffery | Hits:

[CSharpLAP

Description: 该程序经过运行,无任何问题,可用于解决选址问题-After running the program without any problems, can be used to solve the location problem
Platform: | Size: 1024 | Author: 赵赵 | Hits:

[AI-NN-PRpsoprogress

Description: %程序名称:求解约束优化问题的改进粒子群优化算法 %程序功能:求解带各种约束条件的优化问题 %输入条件:各种初始条件,以及设定参数 %输出数值:最优解位置以及函数极小值 - Program name: for solving constrained optimization problems to improve particle swarm optimization algorithm program features: solving with a variety of constraints optimization problem input conditions: a variety of initial conditions, and the setting of parameters output values: the location of the optimal solution, as well as function of the minimum
Platform: | Size: 4096 | Author: 依然 | Hits:

[Algorithmmain

Description: Concert c++ example of facility location problem. C++ concert technology is a registered trademark of ILOG CPLEX
Platform: | Size: 1024 | Author: Murali | Hits:

[Otherfind-files

Description: VB开发人员都会遇到文件定位的问题。VB提供的Dir[(pathname[, attributes])]函数应该可以满足各种文件定位问题。使用Dir函数时,我们必须给它提供文件的全部路径,否则是找不到的。而有时我们往往是不知道文件的路径的,如果要利用该函数来定位文件,我们必须编写一定的代码。笔者在利用该函数编制查找文件的函数时,颇费了些工夫,可是发现查找的效率不高,效果不太理想。那么有没有编码少且更快的方法查找文件呢?笔者后来利用一个 API函数成功地编制了一个高效率的查找文件的函数。-VB developers will face the problem of document location. VB provided by Dir [(pathname [, attributes])] function should be able to satisfy the positioning of various documents. Dir function to use, we must give it the full path to provide a document, otherwise it is not found. And sometimes we often do not know the path to the file, and if want to use this function to locate a document, our code must be prepared. I use the function in the preparation of the document search function, something a lot of work, but found that search efficiency is not high, less than ideal results. Well, there is no code and a faster way less search documents? I was using an API function successfully developed a highly efficient file search function.
Platform: | Size: 2048 | Author: 杨书亮 | Hits:

[Special EffectsEyeLocationMethodforDriverFatigueDetectioninDualSp

Description: :驾驶疲劳可以从眼睛的状态中反映出来,而眼睛定位是判断眼睛状态的关键。为解决眼睛定位实时性和头部旋转不确定性问题,该文提出一种基于双空间的眼睛定位方法:-】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 of head gesture, an eye lactation detection method based on dual spaces is proposed.
Platform: | Size: 201728 | Author: lvl | Hits:

[Mathimatics-Numerical algorithmsFuzzyFacilityLocationProblem2

Description: Fuzzy Facility Location Problem
Platform: | Size: 4096 | Author: m2579 | Hits:

[AI-NN-PRRandomFacilityLocationProblem

Description: Random Facility Location Problem
Platform: | Size: 4096 | Author: m2579 | Hits:

[Windows Developdepot

Description: 仓库选址问题算法,在公路上选择一个位置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.
Platform: | Size: 1024 | Author: lqt1 | Hits:

[Data structssupermarket

Description: 学校超市选址问题(带权有向图的中心点) 设计要求:对于某一学校超市,其他各单位到其的距离不同,同时各单位人员去超市的频度也不同。请为超市选址,要求实现总体最优 -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 distance from the different units at the same time the frequency of personnel to the supermarket is also different. Please supermarket location, required to achieve the overall optimum
Platform: | Size: 1024 | Author: yuhao | Hits:

[Data structsFLOYD

Description: FLOYD课程设计 , 超市选址问题,选出最佳的超市地点-FLOYD curriculum design, supermarket location problem, select the best supermarket locations
Platform: | Size: 1024 | Author: 丘鹏 | Hits:

[Special Effects2

Description: 采用速度-位置模型,把优化问题空间转化为随机粒子空间,通过反复迭代寻找最优解,可用于基于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 based on pso
Platform: | Size: 185344 | Author: | Hits:

[Data structsThe-post-office-location

Description: 这是一个邮局选址问题。给定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, including executable files, source code, and six groups of test cases.
Platform: | Size: 143360 | Author: 汪金 | Hits:

[Data structsSupermarket-location-problem-

Description: 基于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 supermarket location.
Platform: | Size: 4727808 | Author: 姚陈堃 | Hits:
« 12 3 4 5 6 7 8 9 10 ... 15 »

CodeBus www.codebus.net