Genetic clustering algorithms

檔案

日期

2001-12-01

類型

期刊名稱

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

卷期與頁次

第 135 卷第 2 期,頁 413–427

ISSN

0377-2217

語言

英文

摘要

This study employs genetic algorithms to solve clustering problems. Three models, SICM, STCM, CSPM, are developed according to different coding/decoding techniques. The effectiveness and efficiency of these models under varying problem sizes are analyzed in comparison to a conventional statistics clustering method (the agglomerative hierarchical clustering method). The results for small scale problems (10-50 objects) indicate that CSPM is the most effective but least efficient method, STCM is second most effective and efficient, SICM is least effective because of its long chromosome. The results for medium-to-large scale problems (50-200 objects) indicate that CSPM is still the most effective method. Furthermore, we have applied CSPM to solve an exemplified p-Median problem. The good results demonstrate that CSPM is usefully applicable. (C) 2001 Elsevier Science B.V. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Chiou, Y., & Lan, L. (2001). Genetic clustering algorithms. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 135(2), 413–427. https://doi.org/10.1016/S0377-2217(00)00320-9

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29222