基于改进降顶算法的非可靠生产线最优缓存分配  

Improved degraded ceiling algorithm for optimal buffer allocation in unreliable production lines

作　　者：王会琦[1] 薛晓明[1] 吕王勇[2] 

机构地区：[1]四川大学数学学院,成都610065 [2]四川师范大学数学与软件科学学院,成都610068

出　　处：《控制与决策》2014年第8期1424-1428,共5页Control and Decision

基　　金：国家自然科学基金青年科学基金项目(11301360);四川省教育厅重点基金项目(12ZA137);高等学校博士学科点专项科研基金项目(20120181120089)

摘　　要：缓存分配是生产系统设计中一个重要的优化问题.基于非可靠连续生产线递推分解方法及其统计特性,提出在给定缓冲配制条件下的蒙特卡洛生产线吞吐量仿真估算方法,相比于传统的吞吐量估算模型该方法能更准确地描述各种生产场景.通过构造具有记忆性的禁忌集改进了传统降顶算法,并将其应用于实际缓存最优分配方案搜索中.仿真结果表明,对于各种规模的平衡生产线和非平衡生产线,改进降顶算法都可以快速有效地搜索到最优解.Buffer allocation is a major optimization problem in manufacturing systems design. The recursive decomposition model and its statistic characteristics are studied in the unreliable successive product firstly, and the Monte-Carlo simulation method is used to estimate the throughput of product line in the condition of fixed buffer allocation. Comparing with the conventional estimation method, it is easy to depict the production conditions. Then, the tabu set based improved degraded ceiling algorithm is proposed to solve the optional buffer allocation problem. Because of the tabu set with memorability, the search efficient of the algorithm can be increased greatly. Finally, the computer simulation results show that the proposed algorithm can search for the optimum solution effectively and fleetly.

关 键 词：非可靠生产线 缓存分配 蒙特卡罗仿真 禁忌集 降顶算法 

分 类 号：TP202[自动化与计算机技术—检测技术与自动化装置]