Fajar, A. and Herman, N. S. and Abu, N. A. and Sahib, S. (2011) Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem. In: International Conference on Advanced Research on Electronic Commerce, Web Application and Communication (ECWAC 2011), 16-17 April 2011, Guangzhou.
Full text not available from this repository.Abstract
There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). TSP naturally arises as a sub problem in much transportation, manufacturing and logistics application, this problem has caught much attention of mathematicians and computer scientists. A clustering approach will decompose TSP into sub graph and form cluster, so it may reduce problem size into smaller problem. Impact of hierarchical approach will be investigated to produce a better clustering strategy that fit into Euclidean TSP. Clustering strategy to Euclidean TSP consist of two main step, there are; clustering and tour construction. The significant of this research is clustering approach solution result has error less than 10% compare to best known solution (TSPLIB) and there is improvement to a hierarchical clustering algorithm in order to fit in such Euclidean TSP solution method.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Subjects: | H Social Sciences > HE Transportation and Communications |
| Divisions: | Faculty of Information and Communication Technology > Department of System and Computer Communication |
| Depositing User: | Dr. Nur Azman Abu |
| Date Deposited: | 03 Jan 2012 01:06 |
| Last Modified: | 03 Jan 2012 01:06 |
| URI: | http://eprints.utem.edu.my/id/eprint/339 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |