搜索资源列表
work
- 交通平衡配流问题中,Freiz提出受限制的网络灵敏度分析方法,这是一个实例的代码-Traffic equilibrium assignment problem, Freiz proposed restricted network sensitivity analysis, this is an example of the code
maze
- 利用堆栈实现老鼠迷宫问题,寻找出迷宫的路径-Realize the use of stack rat maze problem, find the path of the maze
backbagproblem
- 背包問題是關於最佳化的問題,要解最佳化問題可以使用「動態規劃」(Dynamic programming),從空集合開始,每增加一個元素就先求出該階段的最佳解,直到所有的元素加入至集合中,最後得到的就是最佳解。 以背包問題為例,我們使用兩個陣列value與item,value表示目前的最佳解所得之總價,item表示最後一個放至背包的水果,假設有負重量 1~8的背包8個,並對每個背包求其最佳解-Knapsack problem
fulldyn.tar
- 这是一个模拟第3类模式地震波的matlab脚本。 This a collection of Matlab scr ipts that solve the antiplane (mode III) earthquake dynamic problem with slip-weakening friction, on a 1D fault embedded in a 2D homogeneous elastic unboun
program
- 猴子与香焦问题, 猴子与香焦问题-Monkey and banana problem monkey and banana problem
TSP
- 在Visual C++ 编译环境下,模拟退火算法程序,并利用它们求解了48个城市的TSP问题。-In the Visual C++ Compiler environment, the simulated annealing algorithm procedures and use them to solve a 48 cities TSP problem.
TSP
- 这是一个用遗传算法来求解旅行商问题(TSP问题:Travelling Salesman Problem)的源代码,学习遗传算法,演化计算的很值得一看!-This is a genetic algorithm to solve the traveling salesman problem (TSP problems: Travelling Salesman Problem) source code, learning genetic al
hill
- 采用爬山法求解优化问题,一共4个文件,函数和脚本分开放-Climbing method used optimization problem, a total of four documents, functions and sub-scr ipt open
0-1knapback
- 用分支限界法求解背包问题(0/1背包) 1.问题描述:已知有N个物品和一个可以容纳TOT重量的背包,每种物品I的重量为Weight,价值为Value。一个只能全放入或者不放入,求解如何放入物品,可以使背包里的物品的总价值最大。 2.设计思想与分析:对物品的选取与否构成一棵解树,左子树表示装入,右表示不装入,通过检索问题的解树得出最优解,并用结点上界*不符合要求的结点。-Using branch and bound
shuanfa
- 运动员最佳配对问题,无和集问题,整数变换问题,无优先级运算,0-1背包问题-Athletes the best matching problems, and sets no problem, Integer Transform problem, no priority computing ,0-1 Knapsack Problem
0-1package
- 0-1背包问题的分支限界算法实现,有详细的函数功能说明 -0-1 knapsack problem branch and bound algorithm, a detailed descr iption of the function function
8puzzle
- 求解八数码难题,用广度优先得最优解。用Visual c++6.0编译运行。-Solving eight digital problem, with a breadth-first optimal solution. Using Visual c++ 6.0 compiler to run.
PHI
- 哲学家就餐问题,显示线程的关系,采用信号量产生互斥的功能-Dining philosophers problem, show the relationship between threads, using semaphore have mutually exclusive features
MagicSquare
- 魔方问题,很好很强大,VC++实现-Rubik s cube problem, a good strong, VC++ Achieve
yunshuwenti
- 实现了运筹学中的动输问题,并详细的解释和做到了运输问题的优化。-The realization of the operational research activities in the transmission problem and a detailed explanation of the transport problems and achieve optimization.
TSP
- 用遗传算法解决旅行商问题,并用图形界面显示出来。比较了分别采用轮盘赌选择算子和锦标赛选择算子的遗传算法求解TSP问题的性能,包括:运行时间、进化总代数和最优解质量。 结果曲线可以用图形显示出来。-Genetic algorithm is used to solve the traveling salesman problem, and use graphical interface is displayed. Compared usin
Queen
- 局部搜索法求解N皇后问题。这个算法的特点是引入随机因素,每次运行并不能保证求得问题的最优解,但经过运行之后,一般总能得到一个与最优解相差不大的满意解。-Local Search Method for Solving N Queens problem. The algorithm is characterized by the introduction of random factors, each running and can not
A_solution_to-knapsack-problem
- 背包问题是组合优化领域内经典的NP完备间题,本文介绍了pso解决0/1背包问题上的一个方法-Knapsack problem is the field of combinatorial optimization of NP complete classic inter-title, this article introduced the PSO to solve 0/1 knapsack problem on one of the wa
iga
- 应用遗传算法是被认为求解NP难题的有效手段之一,求解物流配送车辆路径优化问题时,在传统遗传算法的基础上,并引入了免疫算法的思想,实验结果表明该算法具有更好的全局和局部搜索能力和收敛速度,可有效地解决物流配送车辆路径优化问题。-Application of genetic algorithms to solve NP is considered an effective means of problem solving to optimi
tsp
- C语言实现的遗传算法解TSP问题(旅行商问题),简单易懂。-C Language Implementation of Genetic Algorithm for TSP problem (TSP), easy-to-read.