A Branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool

作者：Sun Dong Seok; Lee Tae Eog^*

来源：OR-Spektrum, 2008, 30(3): 515-534.

DOI：10.1007/s00291-007-0085-4

• component placement tool
• placement routing
• column generation
• branch-and-price algorithm

We develop a branch-and-price procedure for a placement routing problem for a multi-head beam-type component placement tool. The problem is modelled as an integer programming model with a huge number of variables, each of which corresponds to a placement route. Its linear programming relaxation is solved by a column generation method. For the column generation subproblem to determine the columns to be added, we develop a dynamic programming procedure. We also propose an effective branching rule to partition the current solution space to eliminate the current fractional solution. Through experiments using real tool data, we observe that the LP relaxation solution value is noticeably close to an integer optimal solution value and hence the integer program formulation and the column generation approach are effective.

• 出版日期2008-6