搜索资源列表
GaBin
- 遗传算法解决复杂背包问题，用Java编写。 该背包拥有3个属性，500个东西，50个包。 求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。 该程序容易修改。-Genetic Algorithm on Bin Packing Proglem. 500 items, 3 parameters of each item. 50 containers, target: All 50 containers h
21276
- bin packing problem vb and c# codes exists
PSO_Solving_Multi_Aims
- 货物配装问题实质上是背包问题与装箱问题的混合，有着广泛的应用。配装,是指充分利用运输工具(如火车、货车、轮船等,本文主要是指货车) 的载重量和容积,采用先进的装载方法,合理安排货物的装载计划，最大限度地发挥货车容积和承载能力，从而降低配送成本。-Cargo loading problem and knapsack problem is essentially a mixture of bin-packing problem, with
RectanglePacker
- To quickly discover these locations, the packer uses a sophisticated 41 /// data structure that stores the upper silhouette of the packing area. When 42 /// a new rectangle needs to be added, only the silouette ed
yiweizhuangxiangwenti
- 一维装箱问题 一维程序段 实现 很好的例子-One-dimensional bin-packing problem one-dimensional program segment to achieve a good example of
fulltext
- A New Heuristic Algorithm for the 3D Bin Packing Problem
BreakGcc
- The most horrible onliner in C you even have seen :-) Use gcc -E to generate the code... This code just return true if a solution exist. This code solves the problem of the "count down number" http://en.wikipedia.or
Cargobin-packingproblem.jsp
- 首先，打开MATLAB编辑器,输入该文件中程序码，把文件保存到MATLAB当前目录并命名为zhuangxiang.m,只需在命令窗口中输入zhuangxiang,按回车键，根据提示输入，便可解决贪心算法中货船装箱问题，以求得最优解。 -First of all, open the MATLAB editor, enter the file, program code, save the file to the MATLAB curr
20070903
- 三维装箱问题的组合启发式算法。目前最有效的解决三维装箱问题的方法。-Three-dimensional bin-packing problem a combination of heuristic algorithm. The most effective solution to three-dimensional packing problem.
DynamicPlanning
- 详细讲解了动态规划的算法问题，再通过“装箱问题”等7个程序实例介绍解决动态规划问题的思路和方法。-Gave a detailed algorithm for dynamic programming problems, and through the " bin-packing problem" and other instances of seven procedures introduced to solve the
zdf
- 三维装箱问题的混合模拟退火算法，解决np-hard问题的基本思路-Three-dimensional bin-packing problem of the hybrid simulated annealing algorithm, np-hard problem to solve the basic ideas
2d3dkp
- 3d bin packing loader pack packaging cago loaging container load
BinPacking
- Bin packing algorithms implementation in java
Knap
- 矩形条带装箱问题(RSPP)是指将一组矩形装入在一个宽度固定高度不限的矩形容器中，以期 获得最小装箱高度．RSPP理论上属于NP难问题，在新闻组版、布料下料以及金属切割等工业领域中 有着广泛的应用．为解决该问题，采用了一种混合算法，即将一种新的启发式算法—— 动态匹配算 法—— 与遗传算法结合起来．混合算法中，动态匹配算法能根据4类启发式规则动态选择与装填区域相 匹配的下一个待装矩形，同时将装箱后所需容器高度用遗传算法的
General_three_dimensional_Bin_packing_Problems.ra
- General three-dimensional Bin-packing Problems
packing
- 一种求解带性能约束的圆形布局问题的C语言源代码-With performance constraints for solving the problem of circular layout of C language source code
PACKING
- 利用Fortran90快速求解整数规划问题-Using Fortran90 fast solution of the integer programming problem
PackingTool
- packing tool(mo xiang de bang shou)-packing tool
TSpack.tar
- stribution package of TSpack code.. for study packing bin problem
RectGreedy
- RSPP-矩形Packing算法的贪心算法求解-RSPP-Rectangle Packing Algorithm greedy algorithm