搜索资源列表
AutoMaker
- 一个用于地板厂家将不同长度的地板装箱的自动配比程序，输入各种型号的地板，会用智能算法计算出最佳装箱方案。程序帮助中有详细的说明。-floor for a different length of the manufacturers are packing the floor ratio of the automatic procedures importation of various models on the floor will use intelligent algorithms to c
PPD
- 利用FFD算法对装箱问题进行编程实现，采用的是最低水平线优先方法-Packing using FFD algorithm programming problems, using the preferred method is the lowest level
jsr1.0.060120b
- JSVM打包文件具体功能JSVM to JS-Packing paper JSVM specific functions JSVM to JS
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
Packing
- 圆形 packing 问题的拟物拟人算法vc++实现 -vc++ source of packing
rectangular-packing-problem
- 通过C语言实现解决rectangular packing problem，遗传算法的使用使程序的效率较高-Use C-Language to solve rectangular packing problem
packing
- 模拟退火实现矩阵的最小组和问题，有图形界面，可以设置各种参数-Matrix of simulated annealing to achieve the best teams and issues, a graphical interface, you can set various parameters
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
OptaPlanner
- OptaPlanner是一个轻型嵌入式优化的规划引擎，可以解决雇员排班、日程调度、课程表、车间调度等问题。-OptaPlanner is a lightweight, embeddable planning engine that optimizes planning problems. It solves use cases, such as: Employee shift rostering: timetabling nurses, repairmen, ... Agen
ypap105-bin-packing-problem
- 对一维数据问题的优化，仅供参考的代码，通过优化使结果更优(The optimization of one dimensional data problem)
ga
- 这是一个可以完成装箱问题的遗传算法，很容易移植到各个地方。(This is a genetic algorithm that can complete the bin packing problem. It is easy to transplant to various places.)