搜索资源列表
bingreedy
- 此源程序为解决一维集装箱装载问题,但是为二维和三维算法提供了很好的思路。-This source code to solve one-dimensional container loading problem, but for the two-dimensional and three-dimensional algorithm provides a very good idea.
PPD
- 利用FFD算法对装箱问题进行编程实现,采用的是最低水平线优先方法-Packing using FFD algorithm programming problems, using the preferred method is the lowest level
Translationpackingproblem
- 二叉搜索树中的装箱问题Binary search tr-Binary search tree packing problem Binary search tree
packing
- Rectangle Packing NP难问题求解,二维装箱问题代码-Rectangle Packing
box_problem
- 完整实现装箱子问题,并利用vs2005建立控制台完整演示工程。算法描述: 1.给定单个箱子的容量 2.输入需要装入箱子的物品个数 3.分别输入待装入箱子的物品的容量 4.结果输出:将所有物品装箱子的最佳方案 -Complete implementation of the loading box problem and establish a console full advantage of vs2005 demo
Approximate1
- 近似算法;最优适宜装箱问题的实现,用C++语言编写-Approximation algorithm optimal implementation of appropriate packing problem, using C++ language
assemble
- 装箱问题是大家经常碰到的问题,也有很多解决方法,这里使用近似算法解决。-Packing problem is that we often encounter the problem, there are many solutions, approximation algorithm is used here to solve.
PPD
- 通用的遗传算法,可实现以下问题:(a)设计出n种不同尺寸货品的排放方法,使得集装箱的空间利用率最高;(b)给出一批货物所需的最少集装箱数量。请给出在附件一对应具体问题下的最优排放及空间利用率。 -General genetic algorithm, can achieve the following questions: (a) design of size n different methods of emission goods
FFD
- function [s,y,SUM]=FFD(a,b) 装箱问题的首次降序算法-a besr way to solve the question
zhuangxiangwenti-FFD
- 装箱问题的FFD代码,很有用的,大家-FFD bin-packing problem of the code, looking for a long time, we try
c4
- 装箱问题 问题描述:装箱问题可简述如下:设有编号为0、1、…、n-1的n种物品,体积分别为v0、v1、…、vn-1。将这n种物品装到容量都为V的若干箱子里。约定这n种物品的体积均不超过V,即对于0≤i<n,有0<vi≤V。不同的装箱方案所需要的箱子数目可能不同。装箱问题要求使装尽这n种物品的箱子数要少-Packing problem Problem Descr iption: Packing problem can be sum
bin-packing-matlab
- 是解决装箱问题的程序,已经解决的比较好了。-Procedures to solve the packing problem,Has been resolved better . .
CBoxUppS
- 装箱问题的CSHARP程序。即一个箱子的容积和体积有限限,如何利用有限的空间装更多的货物,已通过测试。 -Packing problem CSHARP program. A box of volume and limited volume limit, how to use the limited space to hold more cargo, has been tested.
20130105
- 三维装箱问题的模拟退火法求解方法,有文献,有程序。-Three dimensional packing problem with simulated annealing method for solving method
adsf
- 最简单的一维装箱问题又称为装箱问题(1- BP),其主要 思想是用给定的集装箱装载货物,使集装箱的使用量最小。假 设m 是装运货物的数量;n 是可用箱子数量(或最优解数量的 最大值);pi(i=1,…,m)是货物i 的重量;qj(j=1,…,n)是集装箱j 的 容量;Q 为集装箱平均容量。二元变量xij(i=1,…,m,j=1,…,n),当 货物i 装于集装箱j 时,xij=1;反之xij=0。二元变量yj(j=1,
CLQG
- 铝合金切割程序。一维装箱问题的实际应用。给定原材料、目标件的尺寸及数量,计算用原材料最少的切割方法。-Aluminum alloy cutting program. The practical application of one-dimensional packing problem. Given the size and quantity of the raw materials, the target member, the ca
best-fit
- 一维装箱问题的Best Fit算法伪代码-best fit algorithms of 1D bin packing program
first-fit
- 一维装箱问题的First Fit算法伪代码-First fit algorithm of 1D bin packing program
zhuangxiang
- 用免疫遗传算法解决装箱问题 只考虑体积和质量-With immune genetic algorithm to solve the problem only consider packing volume and mass
zhuangxiang-(2)
- 用免疫遗传算法实现装箱问题(2) 含疫苗选择和注射算子-Immune genetic algorithm with packing problem (2) containing vaccine selection and injection operator