Based on experimental comparison, this paper discusses approximate solution methods of medium-scale traveling salesman problems (TSPs) which suit repetitive use in interactive simulation for globally optimizing a large-scale distribution logistic network. For constructing a globally optimized large-scale logistic network, the problem is decomposed into hundreds of sub-problems, and each sub-problem including TSPs should be repetitively solved. Thus, it is essential to find approximate solution methods of medium-scale TSPs that suit the heavily repetitive use in interactive simulation for globally optimizing a large-scale distribution logistic network. Accordingly, we carried out an experiment for comparison among approximate methods using a random restart strategy that iterates the combination of random initialization and local search. As a result of this experimental comparison, we discovered that one of the approximate methods could obtain solutions ensuring errors below 2-3% within 0.1 second. Thus, this method is considered to be promising for realizing a system that enables one to carry out interactive simulations repetitively for constructing a globally optimized large-scale logistic network.
[1]
Sanjeev Arora,et al.
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
,
1998,
JACM.
[2]
Brian W. Kernighan,et al.
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
,
1973,
Oper. Res..
[3]
Stuart E. Dreyfus,et al.
Applied Dynamic Programming
,
1965
.
[4]
Sanjeev Arora,et al.
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
,
1996,
Proceedings of 37th Conference on Foundations of Computer Science.
[5]
John N. Hooker,et al.
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search
,
1995,
Transp. Sci..