检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学机械工程学院,济南250061 [2]山东大学数学学院,济南250061
出 处:《计算机应用》2012年第A02期48-50,60,共4页journal of Computer Applications
摘 要:实际生产中有大量工艺过程与加工路线有关,在工件上寻求最短的加工路线能极大地提高生产效能。试图求解印刷线路板(PCB)多类型孔加工过程的生产效能最优解。通过建立生产效能函数并进行分析,认为在生产条件一定的情况下换刀时间和加工路线是影响生产效能的两个主要因素。换刀时间与刀具的加工顺序有关,而加工路线本质是旅行商问题(TSP),用退火算法求其最优解,最终使生产成本最低。然后通过实例模型证明生产效能函数的可行性。该方法可广泛用于生产实践,尤其对与加工路线有关的生产过程来说,有助于提高生产效率、节约成本。In modem manufacturing companies, a good many production processes are closely related to the actual route that cutleries travel. The authors aimed to work out the optimal solution of the production efficiency of drilling various holes' process on the Printed Circuit Board (PCB). In the dissertation, the authors established a function for the production efficiency of drilling various holes process on PCB, then concluded that the tot~ time of changing cutleries and cutleries' travelling route are the main factors that influence the production efficiency. The time of changing cutleries relates to different cutleries' proccessing sequence. And cutleries' travelling route is essencially a Travelling Salesman Problem (TSP) , which can be handled with simulated annealing algorithm. Then the authors resolved an actual example to prove the feasibility of the function. This method can be applied in on-site production, particularly suited to manufacturing processes concerning with cutleries' travelling route.
分 类 号:TP273.23[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15