浇次计划编制的混合启发式—交叉熵算法

Hybrid heuristic-cross entropy algorithm for cast planning problem

为得到最优浇次计划,包括浇次数量及各个浇次内炉次的选择与排序,提出浇次计划的旅行商问题模型及混合启发式—交叉熵算法。以最小化开浇费用、炉次间连浇惩罚费用及未被选炉次惩罚费用为目标,建立了浇次计划的旅行商问题模型。利用钢级连浇启发式规则对给定炉次进行分组,并根据炉次间连浇惩罚费用大小对初始状态转移概率矩阵的构造进行了改进,构建了混合启发式—交叉熵算法。通过实例验证了模型及算法在实际浇次计划编制问题中的有效性。

To solve the cast planning problem, involving the cast number as well as the select and sequence of char- ges, the traveling salesman problem model and the hybrid heuristic-cross entropy algorithm were proposed. The cast planning problem was modeled as the traveling salesman problem with the objective of the minimum casting cost, continuous-cast fees and unselected charges cost. The hybrid heuristic-cross entropy algorithm was proposed with the steel-grade group rules and the improved initial state transition probability matrix was constructed according to the continuous-cast fees between charges. An actual numerical example showed the effectiveness of the model and the algorithm.