한국항해항만학회:학술대회논문집 (Proceedings of the Korean Institute of Navigation and Port Research Conference)
- 한국항해항만학회 2004년도 춘계학술대회 논문집
- /
- Pages.401-405
- /
- 2004
A study on the column subtraction method applied to ship scheduling problem
- Hwang, Hee-Su (Graduate school of University. of Texas at Arlington) ;
- Lee, Hee-Yong (C-NAVI Corporatio) ;
- Kim, Si-Hwa (Korea Maritime Uni.)
- 발행 : 2004.04.01
초록
Column subtraction, originally proposed by Harche and Thompson(]994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation. This paper aims at applying the column subtraction method to solve SSP which can not be solved by LP relaxation. For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch-and-bound algorithm by LINDO.
키워드