论文部分内容阅读
针对方坯入库堆垛问题,建立了最大化入库方坯批次综合匹配度和非空垛位空间利用率的多目标0-1整数规划模型。设计了求解该问题的两阶段算法:第1阶段采用聚类算法对下线入库方坯聚类形成入库批次;第2阶段采用基于约束满足的单亲遗传算法为形成的批次指派合适的垛位。通过钢厂实际生产数据对算法进行验证,结果表明,相对传统手工计算方法,本文提出的算法不仅能够通过对综合匹配度的优化来减少垛位倒垛数,而且能提高垛位的空间利用率。
In order to solve the stacking problem of billet storage, a multi-objective 0-1 integer programming model was established to maximize the overall matching degree of billet batches and the space utilization ratio of non-empty piles. A two-stage algorithm is designed to solve the problem. In the first stage, the clustering algorithm is used to cluster the billet of the off-line warehousing to form the warehousing lot. In the second stage, the single-parent genetic algorithm based on the constraint satisfaction is used to assign the lot The stack of bits. The results show that compared with the traditional manual calculation method, the proposed algorithm can not only reduce the number of palletizing but also increase the space utilization of palletizing by optimizing the comprehensive matching degree .