热轧板坯出库问题的树搜索算法

Slab retrieving problem in hot rolling and its tree search algorithm

热轧板坯的出库问题是连铸-热轧生产中一个重要的组合优化问题,然而在学术界还很少见到对该问题的研究.对此,提出了热轧板坯出库问题总移动次数的一个下界,开发了一个极小化总移动次数的树搜索算法.该算法包括一个生成初始解的贪婪算法和一个基于复合移动的递归搜索.大量的实验和分析表明,该树搜索算法能在较短的时间内给出板坯出库问题的满意解,具有重要的理论意义和应用价值.

Slab retrieving problem is an important combinatorial optimization problem in continuous casting and hot rolling. However, it has been seldom researched in literature. Therefore, a lower bound of total number of moves for the slab retrieving problem is proposed. A tree search algorithm minimizing the total number of moves is developed. The tree search algorithm includes a greedy search for an initial feasible solution and a recursive search based on compound moves. Numerous experiments and analyses show that the tree search algorithm can provide satisfactory solutions of the slab retrieving problem in relatively short running time and therefore has important theoretical meaning and practical value.