Heuristics for a bidding problem
Heuristics for a bidding problem
复制标题
DOI：
10.1016/j.cor.2005.01.007
复制
发表时间：
2006-08
期刊：
影响因子：
--
通讯作者：
Yunsong Guo;A. Lim;B. Rodrigues;Yi Zhu
中科院分区：
文献类型：
--
作者：
Yunsong Guo;A. Lim;B. Rodrigues;Yi Zhu
本文研究了一个可建模为集合装箱问题的投标问题。一个模拟退火启发式与三个本地移动，包括嵌入式分支定界移动，开发的问题。我们比较了启发式与CPLEX 8.0求解器和目前最好的非精确方法，卡萨诺瓦，使用标准的CATS基准和其他现实的测试集。实验结果表明，该算法优于CPLEX和Casanova算法.
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results show that the heuristic outperforms CPLEX and Casanova.