Optimization of steel plate cutting sequence using the tabu search method
Optimization of steel plate cutting sequence using the tabu search method
复制标题
DOI：
--
复制
发表时间：
2005-05
期刊：
影响因子：
--
通讯作者：
Y. Okumoto;Ryutaro Iseki
中科院分区：
文献类型：
--
作者：
Y. Okumoto;Ryutaro Iseki
本研究系以造船厂中之数位控制（NC）机切割钢板排程为研究对象。以多台切割机加工多块板材为例，研究了以最小化机器空闲时间为目标的切割序列组合优化问题。作为一种优化算法，禁忌搜索方法，这是一种元启发式技术，并已广泛应用于此类优化问题，最近，被采用。该程序在个人计算机上编程，并对试验数据和现场数据进行了计算。结果表明，与初始计划序列相比，等待下一道工序的空闲时间显着减少，禁忌搜索方法是解决组合问题的一种简单有效的方法。
This study concerns the cutting scheduling of steel plates by numerically controlled (NC) machines in shipyards. The combinatorial optimization of the cutting sequence to minimize the idle time of machines has been examined for processing many plates by multiple cutting machines. As an algorithm of the optimization, the tabu search method, which is a kind of meta-heuristic technique and has been widely applied recently for such optimization problems, was adopted. The procedure was programmed on a personal computer, and calculations were carried out for test data as well as field data. It was confirmed that the idle time to wait for the next process decreased remarkably compared with the initial planned sequence, and the tabu search method was a simple and effective method to solve combinatorial problems.