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

  • 제39권1호
  • /
  • Pages.13-27
  • /
  • 2014
  • /
  • 1225-1119(pISSN)
  • /
  • 2733-4759(eISSN)
한국경영과학회 (The Korean Operations Research and Management Science Society)
권호 표지
DOI QR코드

DOI QR Code

Steiner Ring Star 문제를 해결하기 위한 새로운 Mixed-Integer Programming Modeling

A New Mixed-Integer Programming Modeling for the Steiner Ring Star Problem

  • 유준상 (고려대학교 산업경영공학부) ;
  • 이영호 (고려대학교 산업경영공학부) ;
  • 박기경 (고려대학교 산업경영공학부)
  • Yuh, Junsang (Division of Industrial Management Engineering, Korea University) ;
  • Lee, Youngho (Division of Industrial Management Engineering, Korea University) ;
  • Park, Gigyoung (Division of Industrial Management Engineering, Korea University)
  • 투고 : 2013.09.06
  • 심사 : 2013.10.31
  • 발행 : 2014.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we deal with a Steiner Ring Star (SRS) problem arising from the design of survivable telecommunication networks. We develop two mixed integer programming formulations for the SRS problem by implementing Miller-Tucker-Zemlin (MTZ) and Sarin-Sherali-Bhootra (SSB) subtour elimination constraints, and then apply the reformulation-linearization technique (RLT) to enhance the lower bound obtained by the LP relaxation. By exploiting the ring-star structure of underlying network, we devise some valid inequalities that tighten the LP relaxation. Computational results demonstrate the effectiveness of the proposed solution procedure.

키워드

참고문헌

  1. Labbe, M., G. Laporte, I.R. Martin, and J.J.S. Gonzalez, "The Ring Star Problem : Polyhedral Analysis and Exact Algorithm," Networks, Vol.43(2004), pp.177-189. https://doi.org/10.1002/net.10114
  2. Lee, Y., S.Y. Chiu, and J. Ryan, "A Branch and Cut Algorithm for a Steiner Tree-Star Problem," INFORMS Journal on Computing, Vol.8(1996), pp.194-201. https://doi.org/10.1287/ijoc.8.3.194
  3. Lee, Y., S.Y. Chiu, and J. Sanchez, "A Branch and Cut Algorithm for the Steiner Ring Star Problem," International Journal of Management Science, Vol.4(1998), pp.21-34.
  4. Myung, Y., "A Comparison of Group Steiner Tree Formulations," Journal of the Korean Institute of Industrial Engineers, Vol.37 (2011), pp.191-197. https://doi.org/10.7232/JKIIE.2011.37.3.191
  5. Sarin, S.C., H.D. Sherali, and A. Bhootra, "New Tighter Polynomial Length Formulations for the Asymmetric Traveling Salesman Problem with and without Precedence Constraints," Operations Research Letters, Vol.33, No.1(2005), pp.62-70. https://doi.org/10.1016/j.orl.2004.03.007
  6. Sherali, H.D., W.P. Adams, and P.J. Driscroll, "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problem," Operations Research, Vol.46(1998), pp.396-405. https://doi.org/10.1287/opre.46.3.396
  7. Sherali, H.D. and P.J. Driscroll, "On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems," Operations Research, Vol.50, No.4(2002), pp.656-669. https://doi.org/10.1287/opre.50.4.656.2865
  8. Sherali, H.D., S.C. Sarin, and P.-F. Tsai, "A Class of Lifted Path and Flow-Based Formulations for the Asymmetric Traveling Salesman Problem with and without Precedence Constraints," Discrete Optimization, Vol.6(2006), pp.20-32.
  9. Simonetti, L., Y. Frota, and C.C. de Souza, "The Ring-Star Problem : A New Integer Programming Formulation and a Branchand-Cut Algorithm," Discrete Applied Mathematics, Vol.159, No.16(2011), pp.1901-1914. https://doi.org/10.1016/j.dam.2011.01.015