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

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

Cost Relaxation Using an Arc Set Likely to Construct an Optimal Solution for the Asymmetric Traveling Salesman Problem

비대칭 외판원문제에서 최적해에 포함될 가능성이 높은 호들을 이용한 비용완화법

  • Published : 2008.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.

Keywords

References

  1. 강맹규, 네트워크와 알고리듬, 박영사, 1991
  2. 김여근, 윤복식, 이상복, 메타 휴리스틱, 영지문화사, 1999
  3. 권상호, 김성민, 강맹규, "외판원문제의 국지해를 탈출하기 위한 비용완화법", 대한산업공학회지, 제30권, 제2호(2004), pp.84-92
  4. 김헌태, 권상호, 지영근, 강맹규, "비대칭 외판원 문제에서 호의 후보집합 결정", 경영과학회지, 제28권, 제2호(2003), pp.129-138
  5. Reinelt, G., The Traveling Salesman：Computational Solutions for TSP Applications, Springer-Verlag, Berlin, 1991
  6. Gutin, G. and A. Punnen, The Traveilng Saleman Problem and Its Variations, Springer, 2002
  7. Applegate, D., W. Cook, and A. Rohe, "Chained Lin-Kernighan for Large Traveling Salesman Problems," Technical Report No.99887, Forschungsinstitut fur Diskrete Mathematik, University of Bonn, Germany, 1999
  8. Blum, C. and A. Roli, "Metaheuristics in Combinatorial Optimization：Overview and Conceptual Comparison," ACM Computing Surveys, Vol.35, No.3(2003), pp.268-308 https://doi.org/10.1145/937503.937505
  9. Cirasella, J., D. Johnson, L. McGeoch, and W. Zhang, "The Asymmetric Traveling Salesman Problem：Algorithms, Instance Generators, and Tests," Lecture Notes in Computer Science, Vol.2153(2001), pp.32-59, Springer, Berlin https://doi.org/10.1007/3-540-44808-X_3
  10. Codenotti, B., G. Manzini, L. Margara, and G. Resta, "Perturbation：An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP," INFORMS Journal on Computing, Vol.8(1996), pp.125-133 https://doi.org/10.1287/ijoc.8.2.125
  11. Helsgaun, K., "An Effective 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
  12. Kwon, S.H., Y.G.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, No.10(2003), pp. 1085-1092 https://doi.org/10.1057/palgrave.jors.2601614
  13. Lin, S., "Computer Solution of Traveling Salesman Problem," Bell System Tech. Journal, Vol.44(1965), pp.2245-2269 https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
  14. Lin, S. and B.W. Kernighan, "An Effective Heuristic Algorithm for the Traveling Salesman Problem," Operations Research, Vol.21(1973), pp.498-516 https://doi.org/10.1287/opre.21.2.498
  15. Martin, O., S.W. Otto, and E.W. 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
  16. 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
  17. Zhang, W., "Depth-First Branch and Bound Versus Local Search：A Case Study," 17th national Conf. on Artificial Intelligence(AAAI-2000), pp.930-935, Austin, TX, 2000