| dc.contributor | 統計系 | - |
| dc.creator (作者) | Tien, F.-C.;Lee, L.J.-H.;Yang, Su-Fen | - |
| dc.creator (作者) | 楊素芬 | - |
| dc.date (日期) | 2004 | - |
| dc.date.accessioned | 20-Jul-2015 17:50:46 (UTC+8) | - |
| dc.date.available | 20-Jul-2015 17:50:46 (UTC+8) | - |
| dc.date.issued (上傳時間) | 20-Jul-2015 17:50:46 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/76705 | - |
| dc.description.abstract (摘要) | The p-Hub Median problem has been crucial problem that locates p hubs in a number of points, and allocates the remaining points to the hubs such that minimizes an objective cost function. Due to this problem is a NP-complete problem, heuristic methods have been popularly applied to this category of problems. In this paper, we propose a hybrid genetic algorithm that solves the p-Hub Median problem effectively. The proposed GA integrates different methods including multi-start, elite principle, critical event, K-means algorithm and different evolutionary operators to avoid local optimal solutions and increase the efficiency of genetic process. Because of using different methods, tuning up the hybrid GA becomes a critical task that derives a set of parameters leading the evolutionary process to a quick convergence. The parameters include the probabilities of crossover and mutation, the number of iterations for multi-start, the length of critical events, the number of iterations for running K-means algorithm. Therefore, the Taguchi method is used to find the best operating parameters based on several well-known test problems. Experiments show that the proposed hybrid genetic algorithm, tuned with the Taguchi method, effectively and efficiently solves the p-Hub Median problem. | - |
| dc.format.extent | 176 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | IIE Annual Conference and Exhibition 2004, 489 | - |
| dc.subject (關鍵詞) | IIE Annual Conference and Exhibition 2004, 15 May 2004 through 19 May 2004, Houston, TX, 66321 | - |
| dc.subject (關鍵詞) | K-means algorithm; Objective cost function; Taguchi method; Genetic algorithms; Heuristic methods; Probability; Problem solving | - |
| dc.title (題名) | Solving p-Hub Median problems by genetic algorithr Taguchi method | - |
| dc.type (資料類型) | article | en |
