Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Perturbation Using Out-of-Kilter Arc of the Asymmetric Traveling Salesman Problem

비대칭 외판원문제에서 Out-of-Kilter호를 이용한 Perturbation

  • Published : 2005.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

Keywords

References

  1. 권상호, 김성민, 강맹규, '외판원문제에서 국지해를 탈출하기 위한 비용완화법', 대한산업공학회지, Vol.30, No.2(2004), pp.120-129
  2. 권상호, 김헌태, 강맹규, '비대칭 외판원문제에서 out-of-kilter 호의 특성', 한국SCM학회지, Vol.3, No.1(2003). pp.117-124
  3. 김헌태, 권상호, 지영근, 강맹규, '비대칭 외판원 문제에서 호의 후보집합 결정', 한국경영과학회지, 제28권, 제2호(2003), pp.129-138
  4. Ahuja, R.K., T.L. Magnanti and JB. Orlin, Network Flows, Prentice-Hall, Inc., NJ, 1993
  5. Brun, C., M. Giovanni, M. Luciano and R. Giovanni, 'Perturbation : An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP,' INFORMS Journal on Computing, Vol.8, No.2(1996), pp.125-133 https://doi.org/10.1287/ijoc.8.2.125
  6. Held, M. and R.M. Karp, 'The Traveling Salesman Problem and Minimal Spanning Tree,' Operations Research, Vol.18(1970), pp.1138-1162 https://doi.org/10.1287/opre.18.6.1138
  7. Helsgaun, K, 'An Efficient Implementation of the Lin-Kernighan Traveling Salesman Heuristic,' European Journal of Operational Research, Vol.126(2000), pp.106-130 https://doi.org/10.1016/S0377-2217(99)00284-2
  8. Johnson, D.S. and L.A. McGeoch, 'The Traveling Salesman Problem : A Case Study in Local Optimization,' Local Search in Combinatorial Optimization edited by E.HL Aarts and J.K. Lenstra, John Wiley & Sons, Inc., NY, 1997, pp.215-310
  9. Karp, R.M., 'A Patching Algorithm for the Nonsymmetric Traveling Salesman Problem,' SIAM Journal on Computing, Vol.8 (1979), pp.561-573 https://doi.org/10.1137/0208045
  10. Kwon, S.H., YG. G, and M.K. Kang, 'Application of the Out-of-Kilter Algorithm to the Asymmetric Traveling Salesman Problem,' Journal of the Operational Research Society, Vol.54(2003), pp.1085-1092 https://doi.org/10.1057/palgrave.jors.2601614
  11. Lawler, E.L., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, NY, 1976
  12. Lawler, E.L., J.K. Lenstra, AHG. Rinnooy Kan and DB. Shmoys, eds., The Traveling Salesman Problem, John Wiley & Sons, Inc., NY, 1985
  13. Lin, S. and B.W. Kernighan, 'An Efficient Heuristic Algorithm for the Traveling Salesman Problem,' Operations Research, Vol. 21(1973), pp.495-516
  14. Martin, O., S.W. Otto and EW. Felten, 'Large-step Markov Chains for the TSP Incorporating Local Search Heuristics,' Operations Research Letters, Vol.11(1992), pp.219-224 https://doi.org/10.1016/0167-6377(92)90028-2
  15. Reinelt, G., 'TSPLIB : A Traveling Salesman Problem Library,' ORSA Journal on Computing, Vol.3(1991), pp.376- 384 https://doi.org/10.1287/ijoc.3.4.376
  16. Zhang, W., 'A Note on the Complexity of the Asymmetric Traveling Salesman Problem,' Operations Research Letters, Vol.20 (1997), pp.31-38 https://doi.org/10.1016/S0167-6377(96)00037-5