A MULTIPLIER ADJUSTMENT APPROACH FOR THE SET PARTITIONING PROBLEM
成果类型：
Article
署名作者：
CHAN, TJ; YANO, CA
署名单位：
University of Michigan System; University of Michigan
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.40.1.S40
发表日期：
1992
页码：
S40-S47
关键词：
摘要：
We introduce an effective branch-and-bound algorithm for solving the set partitoning problem. The new algorithm employs a new multiplier-adjustment-based bounding procedure, and a complementary branching strategy which results in relatively small search trees. Computational results based on 20 moderately sized crew scheduling problems indicate that our new algorithm is on average 16.6 times faster than the popular code, SETPAR. The improvements are mainly due to the bounding procedure, which is fast, easy to use, and provides tight lower bounds. On average, the bounds are 97.6% of the optimal objective value of the linear programming relaxation after only five iterations, and 98.5% after ten iterations. Moreover, the lower bounds are observed to be monotonically nondecreasing. We also apply the technique of variable elimination, which is very effective in reducing the size of the problems. On average, 89% of the variables are eliminated from the problem at the root node.