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 条
  • [1] Constructive heuristics for the canister filling problem
    Zerovnik, Gasper
    Zerovnik, Janez
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2011, 19 (03) : 371 - 389
  • [2] EXPERIMENTAL COMPARISON OF CONSTRUCTIVE HEURISTICS FOR THE CANISTER FILLING PROBLEM
    Zerovnik, Gasper
    Zerovnik, Janez
    PROCEEDINGS OF THE 10TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH SOR 09, 2009, : 129 - +
  • [3] Hybrid constructive heuristics for the critical node problem
    Bernardetta Addis
    Roberto Aringhieri
    Andrea Grosso
    Pierre Hosteins
    Annals of Operations Research, 2016, 238 : 637 - 649
  • [4] A note on constructive heuristics for the flowshop problem with blocking
    Ronconi, DP
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2004, 87 (01) : 39 - 48
  • [5] Hybrid constructive heuristics for the critical node problem
    Addis, Bernardetta
    Aringhieri, Roberto
    Grosso, Andrea
    Hosteins, Pierre
    ANNALS OF OPERATIONS RESEARCH, 2016, 238 (1-2) : 637 - 649
  • [6] Constructive-destructive heuristics for the Safe Set Problem
    Tomasaz, Alberto Boggio
    Cordone, Roberto
    Hosteins, Pierre
    COMPUTERS & OPERATIONS RESEARCH, 2023, 159
  • [7] New constructive heuristics for the total weighted tardiness problem
    Yoon, S. H.
    Lee, I. S.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (01) : 232 - 237
  • [8] Constructive Heuristics for the Multicompartment Vehicle Routing Problem with Stochastic Demands
    Mendoza, Jorge E.
    Castanier, Bruno
    Gueret, Christelle
    Medaglia, Andres L.
    Velasco, Nubia
    TRANSPORTATION SCIENCE, 2011, 45 (03) : 346 - 363
  • [9] Constructive heuristics for the uncapacitated continuous location-allocation problem
    Gamal, MDH
    Salhi, S
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2001, 52 (07) : 821 - 829
  • [10] Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem
    Pan, Quan-Ke
    Gao, Liang
    Li Xin-Yu
    Jose, Framinan M.
    APPLIED SOFT COMPUTING, 2019, 81