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.
基于一维问题的蚂蚁算法,本文将二维矩形件排样问题转化为一维背包问题,然后进行求解。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题(TSP)的邻域搜索算法的思想,提出了型材下料问题的一种优化算法。
With the rapid development of national economy in recent years, the one-dimensional cutting stock problem occurs in many industry areas.
近年来,随着国民经济的飞速发展,一维下料问题在建筑、电力、水利等领域获得了越来越广泛的应用。
应用推荐