置件機優化問題討論已久，但大多數的研究只能適用於特定置件機型號或簡化問
題。而且在目前工業製造領域相對封閉的狀況下，優化所需的重要參數如儲料槽位置、
儲料槽間隔大小、材料移動速度限制或相機位置等只有置件機製造商能夠取得，因此
許多置件機通常會搭配專用程式，提供操作與優化功能。然而專用程式通常會有非常
多的限制，難以對優化的目標進行調整，也無法細部調整置件動作。因此本論文提出
一元優化架構，針對置件機優化中的儲料槽分配問題，使用基因演算法將專用程式的
優化成果再優化，並以 Panasonic NPM-W2 與專用程式 NPM-DGS 為例，設計客製化適
應函數與主觀函數以達到不同的優化目標。實驗成果顯示我們的架構除了達到額外優
化目標外，還能再改善 DGS 的優化結果 2.2% 至 38% 不等。

Mounter optimization has been discussed for a long time, while most of these works are
aimed at certain mounter type or simplify the problem. Besides, in situation of that industrial
manufacturing is relatively self-enclosed, most of these critical arguments required in optimization such as the position of feeder slots, the interval of nozzles in beams, the limited moving
speed of each component and the position of the camera are held in the mounter manufacturer.
Therefore, many mounters come with a dedicated program that provides operation and optimization function. However, there are many limitations to the dedicated program, which makes
it hard to adjust the optimization target or modified mounting motion in detail. As a result, we
propose a meta-optimization framework that focuses on feeder assignment problem which is a
subproblem of mounter optimization. Also, we take Panasonic NPM-W2 along with dedicated
NPM-DGS software as an example to demonstrate how to design a custom fitness/subjective
function in order to fulfill different optimization targets. The experiment result shows that not
only addition optimization targets are achieved, but also improved the result of DGS by decreasing total cycle time vary from 2.2% to 38%.

[1] D. Li, T. He, and S. W. Yoon, “Clustering-Based Heuristic to Optimize Nozzle and Feeder Assignments for Collect-and-Place Assembly,” IEEE Transactions on Automation Science and Engineering, vol. 16, no. 2, pp. 755–766, Apr. 2019
[2] W. Ho and P. Ji, “A hybrid genetic algorithm for component sequencing and feeder arrangement,”Journal of Intelligent Manufacturing, vol. 15, no. 3, pp. 307–315, Jun. 2004
[3] N. Van Hop and M. T. Tabucanon, “Multiple criteria approach for solving feeder assignment and assembly sequence problem in PCB assembly,” Production Planning & Control, vol. 12, no. 8, pp. 736–744, Jan. 2001
[4] M. Ayob, P. Cowling, and G. Kendall, “Optimisation for surface mount placement machines,”Tech. Rep., 2002, pp. 498–503.
[5] Y. Crama, J. Van De Klundert, and F. C. R. Spieksma, “Production planning problems in printed circuit board assembly,” Tech. Rep., 2002, pp. 339–361.
[6] T. S. Loh, S. T. Bukkapatnam, D. Medeiros, and H. Kwon, “A genetic algorithm for sequential part assignment for pcb assembly,” Computers & Industrial Engineering, vol. 40, no. 4, pp. 293–307, 2001
[7] R. Kumar and Z. Luo, “Optimizing the operation sequence of a chip placement machine using TSP model,” IEEE Transactions on Electronics Packaging Manufacturing, vol. 26, no. 1, pp. 14–21, Jan. 2003
[8] J. H. Holland, “Genetic algorithms,” Scientific American, vol. 267, no. 1, pp. 66–73, 1992
[9] R. Mercer and J. R. Sampson, “Adaptive search using a reproductive meta-plan,” Kybernetes, vol. 7, pp. 215–228, Mar. 1978.
[10] C. Neumüller, S. Wagner, G. Kronberger, and M. Affenzeller, “Parameter meta-optimization of metaheuristic optimization algorithms,” in Computer Aided Systems Theory – EUROCAST 2011, R. Moreno-Díaz, F. Pichler, and A. Quesada-Arencibia, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 367–374.
[11] L. K. MOYER and S. Gupta, “An efficient assembly sequencing heuristic for printed circuit board configurations,” Journal of Electronics Manufacturing, vol. 07, Jun. 1997
[12] K. P. Ellis, F. J. Vittes, and J. E. Kobza, “Optimizing the performance of a surface mount placement machine,” IEEE Transactions on Electronics Packaging Manufacturing, vol. 24, no. 3, pp. 160–170, Jul. 2001
[13] H.-P. Hsu, “Solving Feeder Assignment and Component Sequencing Problems for Printed Circuit Board Assembly Using Particle Swarm Optimization,” IEEE Transactions on Automation Science and Engineering, vol. 14, no. 2, pp. 881–893, Apr. 2017
[14] D.-S. Sun, T.-E. Lee, and K.-H. Kim, “Component allocation and feeder arrangement for a dualgantry multi-head surface mounting placement tool,” International Journal of Production Economics, vol. 95, no. 2, pp. 245–264, Feb. 2005
[15] W. Ho and P. Ji, “A genetic algorithm to optimise the component placement process in PCB assembly,” The International Journal of Advanced Manufacturing Technology, vol. 26, no. 11-12, pp. 1397–1401, Nov. 2005
[16] S. Li, C. Hu, and F. Tian, “Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms,” Applied Soft Computing, vol. 8, no. 1, pp. 522–529, Jan. 2008
[17] T.-H. Park and N. Kim, “A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters,” International Journal of Control, Automation and Systems, vol. 5, 2007.
[18] H. Esbensen and P. Mazumder, “Saga : A unification of the genetic algorithm with simulated annealing and its application to macro-cell placement,” in Proceedings of 7th International Conference on VLSI Design, Jan. 1994, pp. 211–214.
[19] M. M. Mahon. (). Pywinauto - pywinauto. Accessed: 2019-05-07, [Online]. Available: https://pywinauto.github.io/.