Constructive heuristics for the canister filling problem

被引:0
|
作者
Gašper Žerovnik
Janez Žerovnik
机构
[1] Jožef Stefan Institute,Reactor Physics Division
[2] Institute of Mathematics,Department of Mathematics
[3] Physics and Mechanics,University of Ljubljana
[4] Faculty of Mechanical Engineering,undefined
来源
Central European Journal of Operations Research | 2011年 / 19卷
关键词
Combinatorial optimization; Canister filling problem; Cardinality constrained bin packing; Spent nuclear fuel; Remove and reinsert heuristics;
D O I
暂无
中图分类号
学科分类号
摘要
The canister filling problem arises when optimizing the spent nuclear fuel repository in hard rock. It is shown the problem is NP-hard. Constructive heuristics followed by remove and reinsert local optimization are considered. Additionally, some theoretical insight on the algorithm operation is provided. Several variants of the algorithm are compared on random and realistic datasets. The obtained results have shown that constructive heuristics give satisfactory results for both random and realistic input data, although there is still some room for improvements.
引用
收藏
页码:371 / 389
页数:18
相关论文
共 50 条