Search

This paper discuss about the role of Decision Support Tool in Travelling Salesman Problem (TSP) for helping the researchers who doing research in same area will get the better result from the proposed algorithm. A study has been conducted and Rapid Application Development (RAD) model has been use as a methodology which includes requirement planning, user design, construction and cutover. Water Flow Algorithm (WFA) with initialization technique improvement is used as the proposed algorithm in this study for evaluating effectiveness against TSP cases. For DST evaluation will go through usability testing conducted on system use, quality of information, quality of interface and overall satisfaction. Evaluation is needed for determine whether this tool can assists user in making a decision to solve TSP problems with the proposed algorithm or not. Some statistical result shown the ability of this tool in term of helping researchers to conduct the experiments on the WFA with improvements TSP initialization. [ABSTRACT FROM AUTHOR]

Duplicated code detection has been an active research field for several decades. Although many algorithms have been proposed, only a few researches have focused on the comprehensive presentation of the detected clones. During the evaluation of clone detectors developed by the authors, it was observed that the results of the clone detectors were hard to comprehend. Therefore, in this paper a broadly suitable grouping method with which clone pairs can be easily grouped together to provide a more compact result is presented. [ABSTRACT FROM AUTHOR]

This paper presents a hybrid Water Flow-like Algorithm with Tabu Search for solving travelling salesman problem (WFA-TS-TSP).WFA has been proven its outstanding performances in solving TSP meanwhile TS is a conventional algorithm which has been used since decades to solve various combinatorial optimization problem including TSP. Hybridization between WFA with TS provides a better balance of exploration and exploitation criteria which are the key elements in determining the performance of one metaheuristic. TS use two different local search namely, 2opt and 3opt separately. The proposed WFA-TSTSP is tested on 23 sets on the well-known benchmarked symmetric TSP instances. The result shows that the proposed WFA-TSTSP has significant better quality solutions compared to WFA. The result also shows that the WFA-TS-TSP with 3-opt obtained the best quality solution. With the result obtained, it could be concluded that WFA has potential to be further improved by using hybrid technique or using better local search technique. [ABSTRACT FROM AUTHOR]

The paper describes specific features of parallelization of collision integral computation algorithms, which are conditioned by the CUDA architecture of parallelization on graphic cards [1]. [ABSTRACT FROM AUTHOR]

This algorithm performs line clipping against four perpendicular sides that are parallel to the screen. The algorithm combines different types of line and define which line or part of line saved for display. The main property is considered in this algorithm is the parallelism with window boundary to define the clipped line. For parallel lines with window boundaries no need to use intersection point method to find the coordinates of the end points of the clipped line. Midpoint algorithm is used to determine the intersection point with the clipped boundary for non-parallel lines. In this algorithm there are no area codes to determine the position of end points of line. [ABSTRACT FROM AUTHOR]

The Hilbert curve has previously been constructed recursively, using p levels of recursion of n-bit Gray codes to attain a precision of p bits in n dimensions. Implementations have reflected the awkwardness of aligning the recursive steps to preserve geometrical adjacency. We point out that a single global Gray code can instead be applied to all np bits of a Hilbert length. Although this “over-transforms” the length, the excess work can be undone in a single pass over the bits, leading to compact and efficient computer code. © 2004 American Institute of Physics [ABSTRACT FROM AUTHOR]