 |
English
|
正體中文
|
简体中文
|
Post-Print筆數 : 27 |
Items with full text/Total items : 113313/144292 (79%)
Visitors : 50919279
Online Users : 323
|
|
|
Loading...
|
Please use this identifier to cite or link to this item:
https://nccur.lib.nccu.edu.tw/handle/140.119/27356
|
| Title: | Genetic algorithms for MD-optimal follow-up designs |
| Authors: | 陳春龍;Rong-Ho Lin;Jianping Zhang
Chen, Chun-Lung |
| Keywords: | Fractional factorial designs;Follow-up designs;Genetic algorithms |
| Date: | 2003-02 |
| Issue Date: | 2009-01-17 16:34:50 (UTC+8) |
| Abstract: | The 2k−p fractional factorial design is the most widely used technique for industrial experimentation. This is because it can significantly reduce the number of experimental runs so that the application of experimental design to problems with a large number of factors becomes possible. However, the application of this technique usually causes the loss of important information. That is, some effects of the experiment may confound with each other and cannot be clearly identified. The follow-up design is a tool used to untangle the confounded effects produced in the initial experiment. In this research, a heuristic based on an effective evolutionary algorithm, Genetic Algorithms, has been developed to generate the optimal follow-up design. The heuristic has been applied in two common test examples. The result showed that the heuristic could simply find optimal follow-up designs, and dominate the existing algorithm. Genetic algorithms (GA) are probabilistic search techniques for optimization problems. In the past decade, more than a thousand technical papers have reported successful applications of GA in a variety of research fields (In: Jorg Biethaha J, Nissen V, Evolutionary algorithms in management applications. Berlin: Springer, 1995. p. 44–97; Eur. J. Oper. Res. 80 (1995) 389, Comput. Ind. Eng. 30 (1996) 919). In this study, a new application of GA has been conducted for a combinatorial design problem in statistics — the follow-up design problem. This problem, as with many other statistical combinatorial design problems, has the same characteristic; the elements in a GA solution have strong interactions in calculating the fitness value of the solution. This is quite different from most of the other GA applications. It is believed that this study will create a new research subject in applying search techniques, such as GA, simulated annealing (SA), and tabu search (TS) to statistical combinatorial design problems and other problems having the same property. |
| Relation: | Computers and Operations Research, 30(2), 232-252 |
| Data Type: | article |
| DOI 連結: | http://dx.doi.org/10.1016/S0305-0548(01)00093-4 |
| DOI: | 10.1016/S0305-0548(01)00093-4 |
| Appears in Collections: | [資訊管理學系] 期刊論文
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| 232252.pdf | | 160Kb | Adobe PDF2 | 947 | View/Open |
|
All items in 政大典藏 are protected by copyright, with all rights reserved.
|
著作權政策宣告 Copyright Announcement1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.
2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(
nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(
nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
