In this paper, we propose an acceleration method for the held-karp algorithm that solves the symmetric traveling salesman problem by dynamic programming. The proposed method achieves acceleration with two techniques. ...
详细信息
In this paper, we propose an acceleration method for the held-karp algorithm that solves the symmetric traveling salesman problem by dynamic programming. The proposed method achieves acceleration with two techniques. First, we locate data-independent subproblems so that the subproblems can be solved in parallel. Second, we reduce the number of subproblems by a meet in the middle (MITM) technique, which computes the optimal path from both clockwise and counterclockwise directions. We show theoretical analysis on the impact of MITM in terms of the time and space complexities. In experiments, we compared the proposed method with a previous method running on a single-core CPU. Experimental results show that the proposed method on an 8-core CPU was 9.5-10.5 times faster than the previous method on a single-core CPU. Moreover, the proposed method on a graphics processing unit (GPU) was 30-40 times faster than that on an 8-core CPU. As a side effect, the proposed method reduced the memory usage by 48%.
In this paper, a mobile application that could assist tourists in arranging travel itineraries has been developed. In the case of making an itinerary, often tourists have been determined the tourist destinations they ...
详细信息
ISBN:
(纸本)9781450366496
In this paper, a mobile application that could assist tourists in arranging travel itineraries has been developed. In the case of making an itinerary, often tourists have been determined the tourist destinations they want to visit, but they confused in determining the order of efficient visits. Balanced clustering is an approach to classify tourist destinations based on the proximity of their location, which gives the results of a cluster whose cardinality between members of the cluster is balanced. Furthermore, each cluster group from the results of this clustering will be seen as a case of the Traveling Salesman Problem (TSP), which we need to find the most efficient sequence of visits in each cluster that contains a list of tourist destinations. The algorithm used for the completion of the TSP is the held-karp algorithm. From the running time measurement test, it is obtained that the held-karp algorithm solves the problem of finding the TSP route faster than using the Brute Force approach. In addition, the implementation of balanced clustering using the Hungarian algorithm can make the number of tourist destinations to be visited in each day become balance.
This research work includes the use of heuristic algorithms to automatically generate processing time optimized robot programs for manufacturing processes in the automotive industry. For this, we've implemented a ...
详细信息
ISBN:
(纸本)9781728161396
This research work includes the use of heuristic algorithms to automatically generate processing time optimized robot programs for manufacturing processes in the automotive industry. For this, we've implemented a genetic algorithm with multi-parent recombination and adjacency-based crossover. A reallocation mutation is also introduced to optimize the load balancing by classifying tasks into common and fixed tasks depending on their location relative to the robots' workspace. The heuristic is compared to an exact solver by applying it to a test problem. Lastly, the methodology is also applied to a real business problem in the area of vehicle sealing.
暂无评论