摘要
在钢铁工厂的车间里,钢坯入库是一道非常重要的工序,它可归结为装箱问题。文中根据某钢厂的实际情况建立了相应的数学模型,以减少天车的行走距离,提高库房的利用率。通过分析天车行走总距离与钢坯入库顺序的关系,提出并论证了单存储区的最小入库序列所满足的性质,并利用该性质设计了多存储区的入库算法。多组模拟实验数据测试表明,单存储区测试结果验证了最小入库序列性质的正确性,多存储区测试结果表明了文中算法可大量缩短天车行走总距离和提高库房利用率。
In steel factories, the loading of steel is a very important process and it can be attributed to bin- packing problcm . To reduce the mobile distance of crane and improve the utilization of warehouse,a model to solve this problem is established according to the actual situation in a steel plant. Based on this rachel, analysing the contacts between walking distance of crane and storage orders of steel, a property which the minimal loading sequences of single - storage - area must satisfy is put forward and proved, then a kind of loading algorithm basis of that property for multi - storage - area is proposed. The test results of single - storage - area are verified that correctness of the property and the test results of multi - storage - area show that the algorithm can greatly reduce the crane walking distance and improve the utilization rate of the warehouse.
出处
《计算机技术与发展》
2009年第12期196-200,共5页
Computer Technology and Development
基金
国家自然科学基金项目(90718009)
上海高可信计算实验室开放项目
贵州省科学技术基金(黔科合J字(2009
2123))
