INTERNATIONAL PUBLICATIONS

Permanent URI for this collection

http://repository.widyatama.ac.id/handle/123456789/7

Browse

Browsing INTERNATIONAL PUBLICATIONS by Author "Abu, Nur Azman"

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    CLUSTERING PROCESS TO SOLVE EUCLIDEAN TSP
    (IEEE PRESS, 2010-07-10) Fajar, Abdullah; Abu, Nur Azman; Herman, Nanna Suryana
    Human is able to cluster and filter object efficiently. Clustering problem has been approached from diverse domains of knowledge like graph theory, statistics, artificial neural network and so on. There has been growing interest in studying combinatorial optimization problems by clustering approach, with a special emphasis on the Euclidean Traveling Salesman Problem. Classical ETSP appears as a fundamental problem in various problem such as transportation, manufacturing and logistics application. This study will focus on tour construction. Most of methods focus on tour improvement and using nearest neighborhood for tour construction. This paper will use clustering process to decompose ETSP into smaller sub problem. Clustering process hierarchically arrange adjacency and vertices to form clusters. A threshold of edge weight is applied to split one clusters to several sub clusters. Using this approach the running time can be cut into half compared to TSPLib standard time. The main objective is to develop best clustering process to ETSP and produce a near optimal solution within 10% of best known solution in TSPLib.
  • No Thumbnail Available
    Item
    CLUSTERING STRATEGY TO EUCLIDEAN TSP HAMILTON PATH ROLE IN TOUR CONSTRUCTION
    (ICCMS - Sanya China, 2010-01-22) Fajar, Abdullah; Abu, Nur Azman; Herman, Nanna Suryana
    TSP arises in many applications such as transportation, manufacturing and various logistics and scheduling. This problem has caught much attention of mathematicians and computer scientists. A clustering strategy will decompose TSP into subgraphs and form clusters, so it may reduce problem size into smaller problem. The primary objective of this research is to produce a better clustering strategy that fit into Euclidean TSP. Hamilton path play important role to construct Euclidean TSP tour in this approach. Hamilton will be applied within clusters or inter clusters. Hamilton path construction will be proceed after clustering process, followed by producing inter cluster connection algorithm to find global tour. This approach is capable of producing fast solution result with error less than 10% compare to best known solution in TSPLib. This paper proposes an improvement to a hierarchical clustering algorithm in searching for Euclidean TSP solution.
  • No Thumbnail Available
    Item
    HIERARCHICAL APPROACH IN CLUSTERING TO EUCLIDEAN TRAVELING SALESMAN PROBLEM
    (Wuhan University of Science and Technology, 2013-07-25) Fajar, Abdullah; Herman, Nanna Suryana; Abu, Nur Azman; Shahib, Sahrin
    There has been growing interest in studying combinatorial optimization problem 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 bi 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.