Two-dimensional stock cutting problem can be settled by solving two one-dimensional knapsack problems, this paper presents a new algorithm based on the ant colony optimization idea.
基于一维问题的蚂蚁算法，本文将二维矩形件排样问题转化为一维背包问题，然后进行求解。
2
An optimization method of variant step length based on precision and two new concepts "variant step length based on precision" and "onedimensional search based on the sorting" are presented.
提出了基于精度的变步长优化方法，并给出了基于精度要求的变步长和基于排序的一维搜索两个新概念。
3
Line search - a technique for onedimensionaloptimization, usually used as a subroutine for other, more general techniques.