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

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

Determination of Arc Candidate Set for the Asymmetric Traveling Salesman Problem

비대칭 외판원문제에서 호의 후보집합 결정

  • Published : 2003.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

The traveling salesman problem (TSP) is an NP-hard problem. As the number of nodes increases, it takes a lot of time to find an optimal solution. Instead of considering all arcs, if we select and consider only some arcs more likely to be included in an optimal solution, we can find efficiently an optimal solution. Arc candidate set is a group of some good arcs. For the Lack of study in the asymmetric TSP. it needs to research arc candidate set for the asymmetric TSP systematically. In this paper, we suggest a regression function determining arc candidate set for the asymmetric TSP. We established the function based on 2100 experiments, and we proved the goodness of fit for the model through various 787problems. The result showed that the optimal solutions obtained from our arc candidate set are equal to the ones of original problems. We expect that this function would be very useful to reduce the complexity of TSP.

Keywords

References

  1. 네트워크와 알고리듬 강맹규
  2. Sixth Annual ACM Symposium on Computational Geometry K-d Trees for Semidynamic Point Sets Bentley,J.L.
  3. Springer Lecture Notes in Computer Science v.2153 The Asymmetric Traveling Salesman Problem : Algorithms, Instance Generators, and Tests Cirsella,J.;D.S.Johnson,L.A.;McGeoch;W.Zhang https://doi.org/10.1007/3-540-44808-X_3
  4. 1997 Winter Simulation Conference Simulation-Based Approach to the Warehouse Location Problem for a Large-Scale Real Instance Hidaka,K.
  5. Proc. 17th Colloquium on Automata, Languages and Programming Local Optimization and the Traveling Salesman Problem Johnson,D.S.;G.Goos(ed.);J.Harmanis(ed.)
  6. Network Models, Handbooks in Operations Research and Management Science The Traveling Salesman Problem Junger,M.;G.Reinelt;G.Rinaldi;M.O.Ball(ed.);T.L.Magnanti(ed.);C.L.Monma(ed.);G.L.Nemhauser(ed.)
  7. European Journal of Operational Research v.59 The Traveling Salesma Problem : An Overview of Exact and Approximate Algorithms Laporte,G.
  8. The Traveling Salesman Computational Solutions for TSP Applications Reinelt,G.
  9. ORSA Journal of Computing v.3 TSPLIB-A Traveling Salesman Problem Library Reinelt,G. https://doi.org/10.1287/ijoc.3.4.376
  10. European Journal of Operational Research v.104 New Edges Not Used in Shortest Tours of TSP Sakakibara,K. https://doi.org/10.1016/S0377-2217(96)00326-8