以下限值為主應用在電路板插件順序的啟發式方法的問題與檢討

Development of A Branch and Bound Based Heuristic for PCB Insertion Problems

柯彥行(Yann-Sing Ke)

指導教授 ： 張百棧

元智大學/工程學院/工業工程與管理學系/碩士(1994年)

摘要

無資料

關鍵字

分支界限法 ； 下限值 ； 啟發式

並列摘要

In the electric industry , the insertions of Printed
Circuit Board forassemble operation in electrical parts are not
only the most important connections , but also it needs the
highest density of manpower , Recently , owing to the
progress of automatic insertion equipments , makes the
insertion technique of PCB more mature。 In the automatic
insertion techniques of the past , one one may need different
solution approaches for solving the sequential problems of
electrical parts on PCB。Due to the fast development of IC
industries,each PCB may needs a lot of electrical parts and
this makes the sequencing problem of the PCB even more
difficults and time consuming Therefore , the development
of a quick and fast solution algorithm for the PCB insertion
problem is thus desperately need。 Our research focuses on
applying branch and bound method on the automatic insertion of
PCB ,and develop a heuristic algorithm to make the number of
branching layer,get optimal solution and reduce the wasting
time on insertion sequence。

並列關鍵字

Branch and Bound ； Lower Bound ； Heuristic