The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
The paper based on the idea of K-OPT Algorithm for TSP, present a swap algorithm for the one-dimensional cutting-stock problem.
根据旅行商问题（TSP）的邻域搜索算法的思想，提出了型材下料问题的一种优化算法。
应用推荐