搜索资源列表
Codes(multiple-Bin-Packing)
- 利用C语言，解决多为背包问题的禁忌搜索算法！世界名家所写！-Tabu search code for multimentional bin packing problem
zhuangxiangwenti-FFD
- 装箱问题的FFD代码，很有用的，大家-FFD bin-packing problem of the code, looking for a long time, we try
4block
- 2D single bin packing 问题的4Block算法-4-Block Algorithm for 2D single bin packing Problem
zhuangxiang
- 自己编写的装箱问题的各种求解策略，包括BESTFIT,FIRSTFIT,WORSTFIT,NEXTFIT-I have written a variety of bin-packing problem solving strategy, including the BESTFIT, FIRSTFIT, WORSTFIT, NEXTFIT etc.
GaBin
- 遗传算法解决复杂背包问题，用Java编写。 该背包拥有3个属性，500个东西，50个包。 求解包与包之间物品重量差最小，并且同一个背包的物品属性有特殊要求。 该程序容易修改。-Genetic Algorithm on Bin Packing Proglem. 500 items, 3 parameters of each item. 50 containers, target: All 50 containers has the smallest weight differe
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 a wide range of applications.
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 problem of dynamic programmin
zdf
- 三维装箱问题的混合模拟退火算法，解决np-hard问题的基本思路-Three-dimensional bin-packing problem of the hybrid simulated annealing algorithm, np-hard problem to solve the basic ideas
box_5
- 装箱问题解法集，共5个。 问题：有一个箱子容量为v(正整数，o≤v≤20000)，同时有n个物品(o≤n≤30)，每个物品有一个体积 (正整数)。要求从 n 个物品中，任取若千个装入箱内，使箱子的剩余空间为最小。 -Bin-packing problem solution sets, a total of 5. Q: Is there a box capacity of v (a positive integer, o ≤ v ≤ 20000), at the same time there
Bin-Packing
- sur le probleme de bin- packing, qu il s ag^t de charger n objets, dans m bins de m^eme capacite c . L objectif c est de minimze le nombre des bins a utiliser.
bpff
- sur le probleme de bin- packing FF, qu il s ag^t de charger n objets, dans m bins de m^eme capacite c . L objectif c est de minimze le nombre des bins a utiliser.strategie first fit
main
- sur le probleme de bin- packing, qu il s ag^t de charger n objets, dans m bins de m^eme capacite c . L objectif c est de minimze le nombre des bins a utiliser.
bin-packing-matlab
- 是解决装箱问题的程序，已经解决的比较好了。-Procedures to solve the packing problem，Has been resolved better . .
pyShipping
- 3d bin packing problem
binpacking-1.0
- 装箱算法，用于研究，经典的NF、FF等算法都给出了较详细的实现-For the study, the classical bin packing algorithm, NF, FF and other algorithms are presented in detail
Delphi-Bin-Packing
- Delphi Bin packing Source
BinPacking
- Delphi bin packing algorithm
ypap105-bin-packing-problem
- matlab code for bin packed problem
3D-Bin-Packing-master
- bin packing 3d freecad看效果 装箱(bin packing 3d freecad)