單列機台布置問題(Single Row Facility Layout Problem, SRFLP)是一個排列問題，其目的是要在一條走道的一側，安排數個長度不等的長方型機台，而兩兩機台間有著已經事前給定的物流量，而研究者要想辦法找出最適當的機台排列，使得兩兩機台間的物流量乘上其距離的總和能夠最小。也因為單列機台布置能被應用在非常多不同的實際情境當中，因此在學術界多年來也透過許多不同的研究方法來想辦法獲得更好的求解方式，以增加在生產現場的效率以及降低搬運成本。
也因為單列機台布置問題已經被證明為是NP-Complete，因此近年來的相關研究多使用啟發式演算法來進行問題的求解，希望能發揮啟發式演算法的特長，在可以接受的演算時間內找到高品質的解。
而在本文研究中，我們使用一個新穎、方便、高效率的啟發式演算法，名為簡化群演算法(Simplified Swarm Optimization, SSO)，去對廣大的可行解空間進行全域搜索，再加上特別針對單列機台布置所設計的區域搜尋機制，以加強演算法在搜尋過程當中的求解品質，同時我們也導入一個逃脫門檻，能夠避免粒子在搜尋過程當中掉入區域最佳解，或是被困在無效的搜索空間當中。
我們在數字實驗的章節當中，以過去最常被使用的27個單列機台布置標竿問題，來檢驗我們所提出的求解方法優劣，而最後的結果也證明我們所提出的方法能夠兼顧演算效率以及求解品質，並發揮簡化群演算法的特質，幫助使用者在短時間內就獲得最佳品質的解。

Single Row Facility Layout Problem (SRFLP) is a permutation problem which has been widely studied in the academic field in order to improve the efficiency on production site. The main purpose of SRFLP is to find an optimal permutation of a number of rectangular facilities with given material flows between each facility, in order to obtain the minimum total cost by arranging them along a straight line.
Since SRFLP has already been proven to be a NP-Complete problem, it is irrational to expect to obtain the global optimal solution by exhaustive methods, therefore the recent researches of SRFLP have therefore been adopted to heuristic algorithms in order to obtain an optimal or a near optimal solution within acceptable CPU time.
In this paper, we use a novel, efficient heuristic algorithm called Simplified Swarm Optimization algorithm (SSO), with an effective local search mechanism, and other optimizational techniques to find the near-optimal solution for SRFLP within acceptable time.
With a comparison to the computational results of two benchmark problem sets from the previous studies, it is shown that our proposed method has better efficiency in solving SRFLP, without sacrifice the effectiveness of the algorithm.
Key

摘要............................. I
英文摘要......................... II
目錄............................. III
圖目錄............................ V
表目錄............................ VI
第一章、 研究介紹.................. 1
1.1 研究背景和動機 ................ 1
1.2 研究目的 ...................... 4
1.3 研究架構 ...................... 4
1.4 研究結果 ...................... 5
第二章、 文獻回顧................... 6
2.1 單列機台布置問題 ............... 6
2.2 簡化群演算法的發展 ..............8
2.3 文獻總結 ...................... 9
第三章、 問題組成................... 10
3.1 符號縮寫 ...................... 10
3.2 問題模型與適應函數 ............. 10
第四章、 研究方法................... 12
4.1 粒子編碼方式 ................... 12
4.2 簡化群演算法 ................... 12
4.3 區域搜尋 ....................... 16
4.4 粒子逃脫機制 ................... 17
4.5 參數設定 ....................... 18
4.6 研究方法總結 .................... 25
第五章、 實驗結果與分析 .............. 27
5.1 小樣本問題 ...................... 27
5.2 大樣本問題 ...................... 28
5.3 實驗總結 ........................ 31
第六章、 結論與未來研究方向 ........... 33
6.1 結論 ............................ 33
6.2 未來研究方向 ..................... 34
參考文獻.............................. 35

[1] A. Drira, H. Pierreval, and S. Hajri-Gabouj, "Facility layout problems: A survey," Annual Reviews in Control, Volume 31, Issue 2, 2007, Pages 255-267.
[2] H. Samarghandi, P. Taabayan, F. F. Jahantigh, "A particle swarm optimization for the single row facility layout problem," Computers & Industrial Engineering, Volume 58, Issue 4, May 2010, Pages 529-534.
[3] Picard, J.C., Queyranne, M.: "On the one-dimensional space allocation problem." Oper. Res., 1981, 29(2), 371–391.
[4] Simmons, D.M. "One-Dimensional space allocation: an ordering algorithm. " OperationsResearch, 1969, 17(5), 812–826
[5] Suresh, G., & Sahu, S. "Multiobjective facility layout using simulated annealing. " International Journal of Production Economics", 1993, 32, 239–254.
[6] Yeh, W.C., "Study on quickest path networks with dependent components and apply to RAP", 2011, Aug.1,2008–Jul.31.
[7] Amaral, A.R.S.: "On the exact solution of a facility layout problem. " Eur. J. Oper. Res., 2006, 173(2), 508–518
[8] Goldberg, D.E.: "Genetic Algorithms in Search, Optimization and Machine Learning", 1989, 1st edn. Addison-Wesley Longman Publishing Co., Inc., Boston
[9] Heragu, S.S., Kusiak, A.: "Efficient models for the facility layout problem." Eur. J. Oper. Res., 1991, 53, 1–13
[10] Love, R.F.,Wong, J.Y.: "On solving a one-dimensional space allocation problem with integer programming.", 1976, INFOR 14(2), 139–144
[11] Amaral, A.R.S.: "A new lower bound for the single row facility layout problem. Discret.",2009, App. Math. 157(1), 183–190 (2009)
[12] Amaral, A.R.S., Letchford, A.N.: "A polyhedral approach to the single row facility layout problem.",2012, Math. Program..
[13] Hungerländer, P., Rendl, F.: "A computational study for the single row facility layout problem", 2011,.
[14] Anjos, M.F., Kennings, A., Vannelli, A.: "A semidefinite optimization approach for the single row layout problem with unequal dimensions.", 2005, Discret. Optim. 2(2), 113–122
[15] Anjos, M.F., Vannelli, A.: "Computing globally optimal solutions for single row layout problems using semidefinite programming and cutting planes.", INFORMS J. Comput., 2008, 20(4), 611–617
[16] Anjos, M.F.,Yen, G.: "Provably near-optimal solutions for very large single row facility layout problems.", 2009, Optim. Meth. Soft. 24(4–5), 805–817
[17] Heragu, S.S., Alfa, A.S.: "Experimental analysis of simulated annealing based algorithms for the layout problem.", 1992, Eur. J. Oper. Res. 57(2), 190–202
[18] de Alvarenga, A.G., Negreiros-Gomes, F.J., Mestria, M.: "Metaheuristic methods for a class of the facility layout problem.", 2000, J. Intell. Manuf. 11, 421–430
[19] Marcello Braglia.: "Optimisation of a simulated annealing based heuristic for single row machine layout problem by genetic algorithm.", 1996, International Transactions in Operational Research Volume 3, Issue 1, January, Pages 37-49
[20] Ravi Kumar, K., Hadjinicola, G.C., Lin, T.L.: "A heuristic procedure for the single row facility layout problem.", 1995, Eur. J. Oper. Res. 87(1), 65–73
[21] M.Ficko, M.Brezocnik, J.Balic, "Designing the layout of single and multiple rows flexible manufacturing system by genetic algorithms.", 2004, Journal of Materials Processing Technology Volumes 157–158, Pages 150-158
[22] Solimanpur, M., Vrat, P., Shankar, R.: "An ant algorithm for the single row layout problem in flexible manufacturing systems.", 2005, Comput. Oper. Res. 32(3), 583–598
[23] Kumar, S., Asokan, P., Kumanan, S., Varma, B.: "Scatter search algorithm for single row layout problem in fms.", 2008, Adv. Prod. Eng. Manag. 3(4), 193–204
[24] Teo, Y.T., & Ponnambalam, S.G.. "A hybrid ACO/PSO heuristic to solve single row layout problem.", 2008, In IEEE International Conference on Automation Science and Engineering.CASE2008(pp.597–602).IEEE.
[25] Samarghandi, H., Eshghi, K.,. "An efficient tabu algorithm for the single row facility layout problem.", 2010, European Journal of Operational Research 205, 98–105.
[26] Kothari, R., & Ghosh, D. "Tabu search for the single row facility layout problem using exhaustive 2-opt and insertion neighborhoods.", 2013, European Journal of Operational Research, 224(1), 93–100
[27] Kothari, R., &Ghosh,D. "Insertionbased Lin-Kernighan heuristic for single row facility layout.", 2013, Computers & Operations Research, 40(1), 129–136.
[28] Datta, D., Amaral, A.R.S., & Figueira, J.R. "Single row facility layout problem using a permutation based genetic algorithm.", 2011, European Journal of Operational Research, 213(2),388–394.
[29] Ozcelik,F. A hybrid genetic algorithm for the single row layout problem.", 2012, International Journal of Production Research, 50(20), 5872–5886.
[30] Kothari, R., & Ghosh, D. "An efficient genetic algorithm for single row facility layout.", 2014, Optimization Letters,8(2),679–690.
[31] Lian, K., Zhang Chaoyong, Z., Gao, L., Xinyu, S.: "Single row facility layout problem using an imperialist competitive algorithm.", 2011, In: Proceedings of the 41st International Conference on, Computers and Industrial Engineering, pp. 578–586 (2011)
[32] Kothari, R., & Ghosh, D. "A scatter search algorithm for the single row facility layout problem.", 2014, Journal of Heuristics, 20(2),125–142.
[33] Miguel F. Anjos, Frauke Liers, "Global Approaches for Facility Layout and VLSI Floorplanning,", 2011, Handbook on Semidefinite, Conic and Polynomial Optimization pp 849-877
[34] Kothari, R., & Ghosh, D. "The single row facility layout problem: state of the art. ", 2012, Opsearch, 49(4),442–462.
[35] Hungerländer, P., & Rendl, F. "A computational study and survey of methods for the single row facility layout problem.", 2013, Computational Optimization and Applications, 55(1),1–20.
[36] Birgit Keller, Udo Buscher, "Single row layout models.", 2015, European Journal of Operational Research, vol. 245, issue 3, pages 629-644
[37] W.-C. Yeh, "Optimization of the disassembly sequencing problem on the basis of self-adaptive simplified swarm optimization.", 2012, IEEE transactions on systems, man, and cybernetics-part A: systems and humans, vol. 42, pp. 250-261.
[38] W.-C. Yeh, "Orthogonal simplified swarm optimization for the series–parallel redundancy allocation problem with a mix of components.", 2014, Knowledge-Based Systems, vol. 64, pp. 1-12.
[39] C.-L. Huang, "A particle-based simplified swarm optimization algorithm for reliability redundancy allocation problems.", 2015, Reliability Engineering & System Safety, vol. 142, pp. 221-230.
[40] C.-M. Lai and W.-C. Yeh, "Two-stage simplified swarm optimization for the redundancy allocation problem in a multi-state bridge system.", 2016, Reliability Engineering & System Safety, vol. 156, pp. 148-158.
[41] C.-M. Lai, W.-C. Yeh, and C.-Y. Chang, "Gene selection using information gain and improved simplified swarm optimization.", 2016, Neurocomputing.
[42] Gintaras Palubeckis, "Fast local search for single row facility layout.", 2015 European Journal of Operational Research Volume 246, Issue 3, 1 November, Pages 800-814
[43] Jian Guana, Geng Lin, "Hybridizing variable neighborhood search with ant colony optimization for solving the single row facility layout problem.", 2016, European Journal of Operational Research Volume 248, Issue 3, 1 February , Pages 899-909