装载印刷电路板组件的推车优化
Trolley Optimisation for Loading Printed Circuit Board Components
AI总结:
本文提出推车优化问题(TOP),将其建模为装箱问题的新扩展,分解为两个独立子问题并用混合整数线性规划求解,同时证明其NP完全性,最终在航空制造案例中实现降本增效。
摘要:
推车是一种用于装载印刷电路板(PCB)组件的容器,推车优化问题(TOP)是指将PCB组件分配到推车上,以供装配线生产一组PCB时使用。本文提出了TOP这一新颖的运筹学应用。为了对TOP进行建模,我们推导出装箱问题的一种新扩展。我们利用问题结构将TOP分解为两个更小、相同且相互独立的子问题。此外,我们建立了一个混合整数线性规划模型来求解TOP,并证明了TOP是一个NP完全问题。通过一家航空航天制造公司的案例研究来说明TOP,该方法成功实现了该公司手工流程的自动化,并在构建过程中带来了显著的成本降低和灵活性提升。
英文摘要:
A trolley is a container for loading printed circuit board (PCB) components, and a trolley optimisation problem (TOP) is an assignment of PCB components to trolleys for use in the production of a set of PCBs in an assembly line. In this paper, we introduce the TOP, a novel operation research application. To formulate the TOP, we derive a novel extension of the bin packing problem. We exploit the problem structure to decompose the TOP into two smaller, identical, and independent problems. Further, we develop a mixed integer linear programming model to solve the TOP and prove that the TOP is an NP-complete problem. A case study of an aerospace manufacturing company is used to illustrate the TOP which successfully automated the manual process in the company and resulted in significant cost reductions and flexibility in the building process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。