搜索资源列表
TSPGACCODE
- 旅行商问题的遗传算法求解源代码，多目标优化经典问题的现代启发式算法实现-traveling salesman problem genetic algorithm source code, multi-objective optimization of the modern classic Heuristic Algorithm
TravelingSalesmanProblemwithGeneticAlgorithm
- this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
josep
- Josephus排列问题定义如下：假设n个竞赛者排成一个环形。给定一个正整数m，从某个指定的第一个人开始，沿环计数，每遇到第m个人就让其出列，且计数继续进行下去。这个过程一直到所有的人都出列为止。最后出列都优胜者。每个人出列的次序定义了整数1，2，...，n的一个排列。这个排列称为一个(n,m)Josephus排列。例如，（7,3)Josephus排列为3,6,2,7,5,1,4.对于给定的1，2，...n中的k个数，Josephus想
8_puzzle
- 8_puzzle问题，初始状态下8个方块随机排列。编程序排列1～8方块的顺序，使得位于3*3的网格中，并且8个方块处于正确的位置。-8_puzzle problem, the initial state of eight box random order. Programmed with a box-8 in the order, made at the 3* 3 grid, and eight box at the right pla
01BEIBAOdongtai
- 0-1背包问题的动态规划算法C语言实现.Windows系统下 Wintc环境编写-0-1 knapsack problem of the dynamic programming algorithm C language. Windows systems Wintc Central Habitat prepared
tsp-word
- 用遗传算法解决旅行商问题的简单实现．word格式，简单，易懂 -using genetic algorithms to solve the traveling salesman problem simple realization. Word format, a simple, understandable
GenerationAl
- 用遗传算法解0/1背包问题，背包问题是著名的NP完备类困难问题，此处给出解法。-Genetic Algorithm for 0/1 knapsack problem, knapsack problem is a well-known class of NP-complete problems. Solution is here.
105230321gademo13
- 这个程序是用遗传算法解决车辆路径问题的．程序完整，完美．-the procedure is using genetic algorithms to solve vehicle routing problem. The integrity of the process and perfect.
Chp15
- 背包问题的遗传算法解法 背包问题的遗传算法解法-knapsack problem genetic algorithm method knap sack problem GA knapsack asked Solution that the genetic algorithm method knapsack problem Genetic Algorithm Solution
ChopStickTest
- 哲学家就餐问题java版。我对这个知道的不多，大家可以研究研究。-dining philosophers problem java version. I know this much, and we can studies.
TSP
- 旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He s
SA_TSA
- 利用模拟退火算法解决旅行商问题的java原码-using simulated annealing algorithm to solve the traveling salesman problem java original code
ex3
- 集装箱的装箱问题 给定一个集装箱，其长为L，宽为W和高为H，现有一批圆柱形木材，每根木材的长均为L，但是半径不同，设第i根木材半径为ri。问如何装箱，使得集装箱的空间利用率最高？贪心-Container packing problem given a container, and its length L, width W and height H, the current batch of cylindrical timber,
tspsa
- 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem)
beibaowenti
- 这是一个用回溯算法解0--1背包问题的C++程序（好用的）-This is a backtracking algorithm used 0 1 knapsack problem of the C++ Procedure (useful)
InverseProblemTheory
- Inverse Problem Theory
tsp
- tsp问题俗称旅行商问题，一个商人从一个城市出发，经过所有的城市一次且仅一次回到出发的城市，问旅行商应当如何选择路径使总路径最短。本程序是用lingo软件编写的，只需要更改城市的数目以及距离矩阵即可。-tsp problem commonly known as the traveling salesman problem, a businessman from a city of departure, after all of the
zuidaliusuanfa
- 最大流问题的算法，思路清晰，很值得收藏。大家赶快下载-Algorithm for maximum flow problem is clearly thought worthy of collection. U.S. soon to download
josephus
- 数据结构实验(循环链表josephus问题) 学会选择合适的数据结构来解决实际问题 学会如何创建一个循环链表在循环链表中如何进行查找在循环链表中如何进行删除 -Experimental data structure (circular list Josephus problem) Institute of selecting suitable data structure to solve the practical
cut
- 基于变长编码求解一维下料问题的演化算法,讲述了一种新的求解下料的算法.-Based on Variable Length Coding for solving one-dimensional cutting stock problem of the evolutionary algorithm, described a new algorithm for solving cutting.