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

  • 제32권3호
  • /
  • Pages.47-61
  • /
  • 2007
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지

선행순서결정문제를 위한 Out-of-Kilter 해법의 적용과 부분순환로의 제거

Elimination of Subtours Obtained by the Out-of-Kilter Algorithm for the Sequential Ordering Problem

  • 발행 : 2007.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper presents two elimination methods of subtours, which is obtained by applying the Out-of-Kilter algorithm to the sequential ordering problem (SOP) to produce a feasible solution for the SOP. Since the SOP is a kind of asymmetric traveling salesman problem (ATSP) with precedence constraints, we can apply the Out-of-Kilter algorithm to the SOP by relaxing the precedence constraints. Instead of patching subtours, both of two elimination methods construct a feasible solution of the SOP by using arcs constructing the subtours, and they improve solution by running 3-opt and 4-opt at each iteration. We also use a perturbation method. cost relaxation to explore a global solution. Six cases from two elimination methods are presented and their experimental results are compared to each other. The proposed algorithm found 32 best known solutions out of the 34 instances from the TSPLIB in a reasonable time.

키워드

참고문헌

  1. Ascheuer, N., L.F. Escudero, M. Grotschel, and M. Stoer, 'A cutting plane approach to the sequential ordering problem (with applications to job scheduling in manufacturing),' SIAM Journal on Optimization, Vol.3(1993), pp.25-42 https://doi.org/10.1137/0803002
  2. Escudero, L.F., M. Guignard, and K. Malik, 'A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships,' Annals of Operations Research, Vol.50(1994), pp.219-239 https://doi.org/10.1007/BF02085641
  3. Ascheuer, N., M. Junger, and G. Reinelt, 'A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints,' Computational Optimization and Applications, Vol.17(2000), pp.61-84 https://doi.org/10.1023/A:1008779125567
  4. Chen, S. and S.Smith, 'Commonality and genetic algorithms,' Technical Report CMURI-TR-96-17(1996), The Robotic Institute, Carnegie Mellon University, PA
  5. Seo, D.I. and B.R. Moon, 'A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem,' CECCO 2003, LNCS 2723(2003), pp.669-680
  6. 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
  7. Gambardella, L.M. and M. Dorigo, 'An ant colony system hybridized with a new local search for the sequential ordering problem,' INFORMS Journal on Computing, Vol.12(2000), pp.237-255 https://doi.org/10.1287/ijoc.12.3.237.12636
  8. Guerriero, F. and M. Mancini, 'A cooperative parallel rollout algorithm for the sequential ordering problem,' Parallel Computing, Vol.29(2003), pp.663-677 https://doi.org/10.1016/S0167-8191(03)00048-6
  9. Ahuja, R.K., T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice-Hall, Inc., Englewood Cliffs, NJ, 1993
  10. Ball, M.O., T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, Network Models, Elsevier Science B.V., Amsterdam, 1995
  11. Kwon, S.H., Y.G.G, 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
  12. Lin, S., 'Computer Solution of the Traveling Salesman Problem', Bell System Technology Journal, Vol.44(1965), pp.2245-2268 https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
  13. K won, S.H., 'Perturbation using out-of-kilter arc of the asymmetric traveling salesman problem', Journal of Korean Operations Research and Management Science Society, Vol.30, No.2(2005), pp.157-167
  14. 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