| 摘要(英) |
"Motor" is an indispensable product of mankind and provides many dynamic demands. Recently, due to the drop in oil prices, the exploitation of the oil industry has become less, and this has affected the demand for motors. While the pressure on all parties has decreased, low-cost competition has become a norm. Therefore, the optimum capacity utilization is obtained from the stator impregnation process, and personnel is not subjectively judged in the capacity allocation, but the mathematical model method is used to increase the capacity utilization rate, thereby reducing the power consumption.
In this thesis, linear programming method and greedy algorithm are used to solve the optimization of stator impregnation process. In the research, it was discovered that this is an unbounded knapsack problem. The mathematical model was written using the Excel software-planning solving equation and the optimal output configuration was solved. We will use linear programming and greedy algorithms to find the best model. In this paper, three models are used: linear programming method, greedy method-output value, and greedy method-area model. The results of the preliminary analysis are best with the linear programming method. Then, the statistical method-paired t-test method was used to verify again. After comparing each model with the current situation, the results obtained proved that the linear programming method can have the best output value and provide the best results for this case company. Suggestions and choices. |
| 參考文獻 |
英文文獻
〔1〕 Arnaud,F.,"The multidimensional 0-1 knapsack problem: An
overview," European Journal of Operational Research, Elsevier,
vol.155(1), pp.1-21,2004.
〔2〕 Gavish, B., Pirkul, H.,“Allocation of Databases and Processors
in a Distributed Computing System,“In J. Akoka (ed.) Management
of Distributed Data Processing,North-Holland, pp.215-231,1982.
〔3〕 Gilmore,H., Murata,T.,“Thetheory and computation of knapsack
functions, ”Oper.Res.,14, pp.1045-1074,1966.
〔4〕 Lam,K.M. and Yan, H.，Fast greedy algorithm for active contours.
Electronics Letters, 30(1), 21-23,1994.
〔5〕 Lin, F.T.,“Solving the Knapsack Problem with Imprecise Weight
Coefficients Using Genetic Algorithms,”European Journal of
Operational Research,185, pp.133-145,2008.
〔6〕 Loulou, R.,and Michaelides, E.,“New Greedy-like Heuristics
for Multidimensional Knapsack Problem,”Operations Research，
Vol.27-6,pp.1101-1114,1979.
〔7〕 Sarin,S.,Karwan,M.,Rardin, R.,“Surrogate duality in a
branch-and-bound procedure for integer programming,” European
Journal of Operational Research,33, pp.326-333,1988.
〔8〕 Shih,W.,“A Branch and Bound Method for the Multiconstraint
Zero-one Knapsack Problem,”Journal of the Operational Research
Society,30, pp.369-378,1979.
〔9〕 Steven,A.Gabriel,Javier F.Ordόñez,and José A.Faria,“Contingency
Planning in Project Selection using Multiobjective Optimization
and Chance Constraints,”Journal of Infrastructure Systems
Vol.12,NO.2, pp.112-120,2006.
〔10〕Toyoda, Y.,“A simplified Algorithm for Obtaining Approximate
Solutions to Zero-One Programming Problems,” Management
Science，Vol.21, pp.1417-1427,1975.
〔11〕Underhill,L.G.Optimal and suboptimal reserve selection
algorithms.Biological Conservation, 70(1),85–87,1994.
〔12〕Waxman, B. M. Routing of Multipoint Connections. IEEE Journal on
selected areas in communications, 6(9), 1617 – 1622,1988.
〔13〕Weingartner, H.,Ness, D.,“Method for the solution of the
multidimensional 0-1 Knapsack problem,”Oper.Res.,15, pp.83,1967.
中文文獻
〔1〕 王銘聰，「應用約略集合於基因演算法之交配機制－以0/1多維度背包問
題為例」，國立勤益科技大學，工業管理所碩士論文，2009。
〔2〕 朱泰霖，「資金配置運用線性規劃於投資組合最佳化之軟體開發」，國立臺
北科技大學，經營管理系碩士班碩士論文，2011。
〔3〕 東元電機股份有限公司，東元105年年報，2016。
〔4〕 每日頭條，在制動過程中感應電機如何作為發電機工作?
https://kknews.cc/zh-hk/science/nvqpoe5.html，2017。
〔5〕 吳志偉，「模糊多目標線性規劃於商辦大樓中央空調系統最佳化應用」，
國立屏東科技大學，工業管理系所碩士論文，2012。
〔6〕 張乃斌，「環境數學：系統優化原理」，茂昌圖書，1997。
〔7〕 張永康，「結合基因演算法與線性規劃法於結構最佳化設計」，淡江大學，
航空太空工程學系碩士班碩士論文，2009。
〔8〕 陳永慶，「應用二階段貪婪演算法求解國軍部隊衛哨排班問題」，國防大學
理工學院資訊工程學系，碩士論文，2017。
〔9〕 陳建一，「應用貪婪是基因演算法於選題策略之研究」，國立暨南國際大
學，資訊管理研究所碩士論文，2003。
〔10〕陳柏均，「結合線性規劃法與改良式調和搜尋演算法於結構拓樸最佳化之
研究」，淡江大學，航空太空工程學系碩士班碩士論文，2016。
〔11〕陳哲民，「基於貪婪演算法之三高患者飲食推薦研究」，朝陽科技大學，資
訊管理系碩士論文，2016。
〔12〕黃維民，「產品產能最佳化配置之線性規劃研究-漆包線產品之應用」，國立
成功大學，工程管理所碩士在職專班碩士論文，2007。
〔13〕劉玉棠，「利用整數線性規劃重新分配空白區域以進行溫度最佳化之3D平
面規劃」，逢甲大學，資訊工程所碩士論文，2011。
〔14〕劉賓陽，「作業研究」，三民書局出版，2000。
〔15〕藍元志，「專案風險管理回應策略選擇模式之建立」，國立中央大學，工業
管理研究所碩士論文，2003。
〔16〕韓宇德，「貪婪演算法結合區域搜尋演算法求解TSP 組合最佳化問題」，
立德管理學院，應用資訊研究所碩士論文，2007。
〔17〕蘇柏嘉，「應用反覆貪婪演算法求解多樓層倉儲訂單揀貨批量問題」，國立
臺北科技大學，工業工程與管理系碩士班碩士論文，2011。 |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
至系統瀏覽論文 ( 永不開放)
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit