Next Article in Journal
d-Path Laplacians and Quantum Transport on Graphs
Next Article in Special Issue
Multiobjective Model Predictive Control of a Parabolic Advection-Diffusion-Reaction Equation
Previous Article in Journal
Distance and Similarity Measures for Spherical Fuzzy Sets and Their Applications in Selecting Mega Projects
Previous Article in Special Issue
A New Hybrid Evolutionary Algorithm for the Treatment of Equality Constrained MOPs

Open AccessArticle

# Multiobjective Mixed Integer Nonlinear Model to Plan the Schedule for the Final Disposal of the Spent Nuclear Fuel in Finland

by 1,*,
1
Department of Mathematics and Statistics, University of Turku, FI-20014 Turku, Finland
2
Teollisuuden Voima Oyj, Olkiluoto, 27160 Eurajoki, Finland
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(4), 528; https://doi.org/10.3390/math8040528
Received: 2 March 2020 / Revised: 23 March 2020 / Accepted: 31 March 2020 / Published: 3 April 2020
(This article belongs to the Special Issue Recent Trends in Multiobjective Optimization and Optimal Control)

## Abstract

The safe disposal of the spent nuclear fuel is the important part of the nuclear power production. In this paper, we model the geological disposal in Finland covering objectives related to the interim storage, the encapsulation facility, the disposal facility, and the costs. A notable fact is that all the fuel types used in Finland are taken into account. The resulting optimization model is of a multiobjective nonlinear mixed integer type having eight objectives. The model is solved with the interactive method utilizing the special type of the achievement scalarizing functions. From this, we obtain a disposal schedule giving amounts of canisters to encapsulate in each time period. The results obtained are analyzed from the practical point of view.

## 1. Introduction

In Finland, the nuclear power covers the notable share of the electricity production. However, this process also produces the spent nuclear fuel which needs to be permanently disposed of safely. In the field of the geological disposal [1], Finland is one of the pioneers by starting the geological disposal in 2020s [2]. In this paper, we aim to produce a schedule in terms of amounts of canisters disposed of periodically in order to dispose of all the spent nuclear fuel in Finland.
Most of the practical applications contain more than one aspect to be optimized, and, usually, at least some of these aspects are conflicting meaning that the problem in question is a multiobjective one. This leads us to make compromises, and the compromise solution of the multiobjective problem is called Pareto optimal. Typically, the multiobjective problem has several Pareto optimal solutions being all mathematically equally good. However, they may differ much in practice. Therefore, we are interested in finding the most desirable solution for the decision maker. This aim is succeeded in including the decision maker in the solution process. One way to do this is the utilization of interactive methods [3,4,5,6,7,8,9] such that the solution process moves from one Pareto optimal solution to another based on the decision maker’s wishes. This lets us to avoid calculating all the Pareto optimal solutions.
This paper is inspired by the study [6] where the multiobjective nonsmooth (i.e., nondifferentiable) mixed integer nonlinear programming (MINLP) problem modeling the case of the geological disposal with one fuel type is presented. In addition to the model, the multiobjective interactive method utilizing two-slope parameterized achievement scalarizing functions (MITSPA) is proposed. This method is then applied to the disposal model. In total, the model in [6] contains nine objectives related to the interim storage, the encapsulation, the area of the disposal facility, and the costs. As a result, the number of canisters to encapsulate at each time period is obtained. These schedules are then analyzed together with the objective function values.
The schedule for the final disposal of the spent nuclear fuel is studied also in [10] minimizing the total costs of the disposal in Finland with a single-objective mixed integer linear programming (MILP) and, in [11], where the area of the disposal facility is aimed to minimize with a linear transportation model. Another optimization related study to design the disposal facility is in [12] giving the multiobjective MILP problem optimizing the nuclear waste placement in the disposal facility, and in [13], the optimal initial condition for the disposal facility is investigated with multiobjective optimization. The disposal schedule can be utilized, for example, when the loading of canisters is optimized [10,14,15,16,17]. The final disposal related aspects in terms of optimization is discussed also from several other points of view, like the placement of the disposal repository [18], to route the transfer of the nuclear waste [19,20], to optimize the shut down date of the reactor [21,22], or from the safety point of view: the optimization of the nuclear safeguards [23,24] and the safety assessment of nuclear waste repositories [25].
The aim in this paper is to extend the model presented in [6] and apply it to the real world case considering all three types of the spent nuclear fuel needed to be disposed of in Finland. The new model is then solved by using MITSPA [6]. Multiobjective optimization seems to be a reasonable way to approach this problem. Even if the disposal is a notable investment economically, by minimizing only costs we may omit better solutions, for example, from the safety point of view. Furthermore, by optimizing not only the costs but also the cost factors, we may obtain more confidence for the decision-making. Compared with [6], which is designed mainly from the academic perspective, this study is carried out for the real world requirement. This is amongst the first studies using such data that the final disposal could be started based on it. Due to the real and updated data, the model in [6] has been heavily modified. For example, with the accurate data of the storage facilities, the storage of the spent fuel assemblies can be modeled more practically. Along with three fuel types, the creation of the schedule has more aspects to consider, like the disposal order of the fuel types or the possibility to have the hiatus during the disposal. Furthermore, the analysis of the results in this paper have a more practical approach.
In this paper, we present the case study of the final disposal of the spent nuclear fuel in Finland. In Section 2, we describe the final disposal process and in Section 3 this process is modeled as a multiobjective nonsmooth MINLP problem. The method used to solve the model is briefly reviewed in Section 4 and the numerical experiments are discussed in Section 5. Finally, some concluding remarks are given in Section 6.

## 2. Final Disposal of the Spent Nuclear Fuel in Finland

Nuclear power has a major role in the electricity production in Finland covering approximately 32% of the domestic electricity production. Indeed, in 2018, the total electricity production was 67.5 TWh from which 21.9 TWh was generated by the nuclear power [26]. At the moment, there are four nuclear reactors operating in Finland and the fifth begins the operation in the near future increasing the portion of the nuclear power of the domestic electricity production. Here, we consider the fuel assemblies irradiated in these five reactors even if there are plans for the sixth reactor in Finland. The current nuclear power plants are owned by the companies Fortum Power and Heat Oy (Fortum) and Teollisuuden Voima Oyj (TVO). In Finland, the power companies are responsible also for the final disposal of the spent nuclear fuel. In order to perform this task, Posiva Oy, owned by Fortum and TVO, was established in 1995.
Posiva needs to follow the legislation by the Ministry of Economic Affairs and Employment and the operation is controlled by the Radiation and Nuclear Safety Authority (STUK). The most important constraints for the disposal process are determined by the authorities, like the regulatory guides on nuclear safety and security by STUK [27]. For the purposes of this study, the most important safety aspects are the thermal dimensioning of the spent nuclear fuel repository, the criticality, and the radiation safety. The thermal dimensioning needs the investigation of the relation between the canister spacing and their heat powers [28] while the radiation safety can be taken into account in this context by forcing the minimum cooling time for the spent nuclear fuel [29]. It is worth noticing that in this paper no additional criticality safety analyses were established in order to simplify the analysis. Nevertheless, the criticality safety will be covered in the disposal production, for example, with the burn-up credit and loading curve criterion.
In Finland, the final disposal of the spent nuclear fuel is based on the KBS-3 (Kärnbränslesäkerhet, nuclear fuel safety) concept [30] developed by Swedish Nuclear Fuel and Waste Management Company (SKB). The concept relies on the multiple barriers isolating the spent nuclear fuel from the environment and these barriers are illustrated in Figure 1. At the beginning of the disposal process, the spent fuel assemblies are stored in Olkiluoto’s and Loviisa’s interim storages until they can be disposed of. From the interim storage, the fuel assemblies are transferred to the encapsulation facility, where they are loaded in canisters. After that, the canisters are transferred to the underground disposal facility for the final disposal. In the following, we briefly discuss the properties of the fuel assembly and follow the journey of the fuel assembly from the reactor to the bedrock.

#### 2.1. Reactor and Spent Nuclear Fuel Types

Currently, there are two nuclear power plants in Finland, one in Olkiluoto and the other in Loviisa. In Olkiluoto, two Boiling Water Reactors (BWR) Olkiluoto 1 and Olkiluoto 2 are in operation, and the third reactor, namely Olkiluoto 3, being that a European Pressurized Water Reactor (EPR) is starting operation in the near future. In Loviisa, two Russian-type Pressurised Water Reactors (VVER-440), Loviisa 1 and Loviisa 2, are in operation. Loviisa 1 was the first reactor starting the operation on 1977, and Olkiluoto 3 is planned to be the last of these five reactors to be in operation such that it will be permanently shut down in the 2080s.
All the reactors use uranium dioxide as a fuel. However, each reactor type needs its own type of the fuel such that, for example, the geometry and the mass varies. In total, three different types of the spent nuclear fuel are produced in Finland. The spent nuclear fuel type produced by the reactors Olkiluoto 1 and 2 is referred as OL1-2, by reactors Loviisa 1 and 2 as LO1-2, and by reactor Olkiluoto 3 as OL3. In Figure 2a, the accumulated uranium mass for each fuel type is illustrated. Figure 2a contains the best estimate case i.e., uranium mass forecasts for the each, OL1-2, LO1-2, and OL3, with the total of roughly 5500 tU, whereas the licensing case is 6500 tU.
Since all the reactors in Finland use the uranium dioxide fuel matrices, the main differences for the decay heat production of different fuel types are caused by the uranium mass and the burnup (see Figure 2). The burnup tells how much energy is produced from one mass unit of the uranium, and, in Figure 2b, the average discharge burnup for each fuel type is presented. As we see, the average discharge burnup of all fuel types is increased during the time. The higher burnup, or an increase in the uranium mass, leads to the higher decay heat power of the fuel assembly, which again increases the cooling time since the decay heat power of a canister is limited. The decay heat power of a fuel assembly for each fuel type is exemplified in Figure 2c based on the representative fuel characteristics given in [32]. Note that the difference between OL3 and OL1-2 and LO1-2 is due to the larger uranium mass of the fuel assembly of OL3. These decay heat power curves have similar shape for each fuel type and also the cooling of canisters of different fuel types is similar. Indeed, in Figure 2d, how much cooling time each fuel type needs with different burnups is illustrated in order to reach their nominal canister powers.

#### 2.2. Interim Storage

The part of the fuel assemblies in the reactor is changed annually. Once the fuel assemblies are removed from the reactor, they produce a large amount of radiation and decay heat. During the first years, this production decreases rapidly when the fuel assembly is in water absorbing radiation and cooling down the fuel together with the cooling system. Indeed, the radioactivity of the fuel assembly decreases to the level that is less than the percent from the radioactivity when the reactor is shut down. Thus, the assemblies are stored in water pools located in the reactor hall for a few years and then they are transferred to the interim storage. Before the spent fuel assemblies can be disposed of, they must be stored in the interim storage for decades. The calculation of the storage time begins when the reactor is shut down such that the fuel assembly can be removed from the reactor. Although there is the minimum storage time stated by the safety [29], the storage time of the fuel assemblies is usually longer.
The interim storages locate in the reactor facility areas such that OL1-2 and OL3 are stored in Olkiluoto and LO1-2 in Loviisa. Both storages contain several water pools. The spent fuel assemblies are placed in racks and only one type of the fuel can be stored in one pool. The storage capacity needed depends on the operating license of the reactor and the disposal pace. With the current estimated operating license [34], the interim storage in Loviisa has enough pools, but, in Olkiluoto, some additional pools might be needed. Then, a new pool with racks can be built. However, once the pool used to store OL1-2 is empty, it is possible to change the racks and store OL3 in the same pool. In the model, the racks are obtained for the whole pool at once. The interim storage is in use until the last fuel assembly is transferred to the encapsulation facility.

#### 2.3. Encapsulation Facility

In the encapsulation facility, the fuel assemblies are loaded in canisters. Each fuel type has its own canister type, but they all have the same basic structure: the copper overpack and the iron inside. However, the dimensions, the shapes of the fuel assembly positions, and the capacity of the canister vary for each fuel type.
The fuel assemblies must be selected for a canister such that the decay heat power of the canister does not exceed the limits (see Figure 2d). The decay heat power of the canister is calculated as a sum of the decay heat powers of the fuel assemblies. In order to decrease the decay heat power of the canister, empty assembly positions can be utilized.
Only one type of the fuel can be encapsulated at one time. In the investigations of this paper, the encapsulation begins in 2025 and the order of the fuel types is fixed such that the encapsulation begins with the part of OL1-2 and continues with LO1-2. All LO1-2 must be encapsulated at once. After that, the rest of OL1-2 is encapsulated. Lastly, all OL3 is encapsulated. During the production, it is possible to have one hiatus. If a hiatus is included, it is between the second part of OL1-2 and OL3. In those years when the encapsulation is not on the hiatus, there is a minimum number of canisters that must be encapsulated. The upper bound of the yearly canister production can be exceeded by involving a two-shift work. However, the two-shift work is not allowed at the first year of the new fuel type and the upper bound for yearly canister production is lower at the first year of the encapsulation and at the first year after the hiatus.

#### 2.4. Disposal Facility

After the canister is encapsulated, it is transferred to the disposal facility located more than 400 m under the ground. The schematic picture of the disposal facility is given in Figure 3. The canisters are placed in the vertical disposal holes on the floor of the disposal tunnel although the horizontal positioning is considered as well [30]. The disposal tunnels are connected with central tunnels. In the model, the central tunnel is built as a pair and the disposal tunnels locate on both sides of the central tunnel pair.
At each disposal tunnel, only one fuel type can be disposed of, and, in the model, each disposal tunnel has the same length. The total length of the disposal tunnels depends on the number of canisters and the canister spacing. However, the disposal tunnels need to be planned for a slightly higher number of canisters than actually needed since there might be places in the bedrock where the disposal hole cannot be drilled.
The length of the central tunnel depends on the total number of the disposal tunnels, the disposal tunnel spacing, and the length of the hiatus. Indeed, each year on the hiatus increases the length of the central tunnel such that the heat wave caused by the canisters disposed of before the hiatus can be taken into account. Furthermore, there exist brittle fault zones with varying classifications in the bedrock of Olkiluoto where disposal holes or disposal tunnels cannot be built. If the disposal facility area needs to be expanded over the brittle fault zone, the corresponding amount of the central tunnel needs to be built.
Besides the fixed minimum and maximum values, in order to define a suitable canister and disposal tunnel spacing, the surface temperature of the canisters needs to be taken into account. In [28], different canister and disposal tunnel spacings and powers of the canister are investigated such that the surface temperature of the canister stays at a suitable level (see Figure A1 in Appendix B). These calculations are utilized when the relation between the power of the canister, the distance between disposal tunnels, and the distance between canisters is approximated for each fuel type in this paper.
In order to ensure the long-term safety, the last phase of the disposal is to fill the disposal facility. The disposal tunnels are filled with bentonite and clay; meanwhile, the canisters are placed in the disposal holes. Once the disposal tunnel is filled, they are sealed with a plug. After all the disposal tunnels are sealed, the central tunnel is filled with bentonite and clay.

## 3. Mathematical Model

In [6], a multiobjective nonsmooth MINLP model with nine objectives for the disposal of the spent nuclear fuel is proposed. The aim there is to produce a disposal schedule in terms of the number of canisters disposed of in each time period. The model adopts the final disposal in Finland in the general level, but the limitation of the model is that it involves only one type of a fuel. In this study, the model presented in [6] is developed further to contain all three fuel types used in Finland. Due to this extension, a possibility for a hiatus is included for the new model. Additionally, the new model is adjusted to the situation in Finland taking into account, for example, the storage facilities more accurately.
The model in [6] and the model presented here have some differences also in objectives. Via more accurate information on the storage of the fuel assemblies, the objective related to the maximum storage amount is now updated to minimize the total number of new water pools in the interim storage. The total number of objectives of the new model is eight leaving the objective minimizing the maximum storage time out. This is done in order to reduce the size of the model since now we are able to omit several binary variables. However, the minimization of the average storage time is still included as the objective. The rest of the six objectives are also still included: minimize the total number of canisters, the disposal ends as early as possible, minimize the operation time of the encapsulation facility, minimize the length of the disposal tunnels and central tunnel, and minimize the total costs. All of these objectives are adjusted for the case of several fuel types.
In the following model description, the fuel type 1 refers to OL1-2, the fuel type 2 to LO1-2, and the fuel type 3 to OL3. Recall that OL1-2 and OL3 are used in Olkiluoto and LO1-2 in Loviisa. We assume that no fuel assemblies have been disposed of yet and the decay heat power of the fuel assemblies from one removal from the reactor are considered as average decay heat powers from that removal. The disposal schedule is divided in periods whose length can be adjusted. The starting time of the disposal is fixed and the last possible disposal period is given.

#### 3.1. Parameters

We begin by introducing the parameters involved in the model. The size of the model is defined by the following three parameters:
I
total number of removals from the reactor
J
total number of disposal periods
Z
length of the disposal period.
These parameters relate to the following set of indices: the set of removals from the reactor $I = { 1 , … , I }$ and the set of periods $J = { 1 , … , J }$. Furthermore, we introduce the set of fuel types $L = { 1 , 2 , 3 }$.
The following set of parameters define some properties of fuel assemblies:
$M i , l$
number of assemblies of the fuel $l ∈ L$ belonging to the removal $i ∈ I$
$P i , j , l$
decay heat power of an assembly of the fuel $l ∈ L$ belonging to the removal $i ∈ I$ in the period $j ∈ J$ [W]
$O l$
last period when the reactor for the fuel $l ∈ L$ is in operation
$A i , j , l$
storage time of an assembly of the fuel $l ∈ L$ belonging to the removal $i ∈ I$ in the period $j ∈ J$ [period]
R
minimum storage time of an assembly [period]
$N l$
number of removals before the first period of the fuel $l ∈ L$.
Features of the disposal and central tunnels are denoted with the following parameters:
Q
effective length of the disposal tunnel [m]
$Q r$
coefficient taking into account the true length of the disposal tunnel
$Q h$
coefficient taking care of the rejected disposal holes
$D c t$
maximum length of the central tunnel before the brittle fault zone [m]
$D a d d$
additional amount of central tunnel to transit over the brittle fault zone [m]
$D h$
annual amount of the central tunnel to build during the hiatus [m]
$D c l o w$
lower bound for the distance between two adjacent canisters [m]
$D c u p$
upper bound for the distance between two adjacent canisters [m]
$D d t l o w$
lower bound for the distance between two adjacent disposal tunnels [m]
$D d t u p$
upper bound for the distance between two adjacent disposal tunnels [m]
M
amount of the central tunnel available after the transition over the brittle fault zone [m].
Next, we give some parameters related to the canisters:
$U l o w$
minimum number of canisters disposed of in one period
$U u p$
maximum number of canisters disposed of in one period
V
decrease in the maximum canister capacity in the first period of the encapsulation
W
increase in the maximum canister capacity due to the two-shift work
$K l$
capacity of a canister for the fuel $l ∈ L$
$P l l o w$
lower bound for the power of the canister for the fuel $l ∈ L$ [W]
$P l u p$
upper bound for the power of the canister for the fuel $l ∈ L$ [W]
S
the last disposal period when the encapsulation can be on the hiatus.
In order to model the water pools and racks, we need the following parameters:
$B l a s$
capacity of the pool for the fuel $l ∈ L \ { 2 }$ [assemblies]
B
number of pools for OL1-2 at the beginning of the first period
$B r$
number of pools with racks for OL1-2 at the beginning of the first period
$O u p$
maximum number of additional pools in Olkiluoto
$B j , l u p$
maximum number of pools for the fuel $l ∈ L \ { 2 }$ in the period $j ∈ J$
$B l u p$
maximum number of pools needing racks for the fuel $l ∈ L \ { 2 }$.
Finally, the cost parameters are
$C l i s o f f$
maintenance cost of the interim storage for the fuel $l ∈ L \ { 1 }$ when the reactor is off [€]
$C l i s o n$
maintenance cost of the interim storage for the fuel $l ∈ L \ { 1 }$ when the reactor is on [€]
$C l r$
cost to build racks for one pool for the fuel $l ∈ L \ { 2 }$[€]
$C p$
cost to build one pool [€]
$C l s t$
storage cost of one assembly of the fuel $l ∈ L$ in period [€]
$C l c$
cost of the canister for the fuel $l ∈ L$ [€]
$C e f$
maintenance cost of the encapsulation facility per period [€]
$C h$
maintenance cost of the encapsulation facility per period during the hiatus [€]
$C e f t s$
portion of the encapsulation facility cost if two-shift work is in use
$C e f o n$
cost of turning on the encapsulation facility after the hiatus [€]
$C e f c h$
cost of changing the fuel type in encapsulation [€]
$C l d t$
cost of the disposal tunnel of the fuel $l ∈ L$ per meter [€]
$C c t$
cost of the central tunnel per meter [€].

#### 3.2. Continuous Variables

The model has $J ( 3 I + 11 ) + 13$ continuous variables which all are assumed to be nonnegative. These variables are:
$x i , j , l$
number of assemblies of the fuel $l ∈ L$ belonging to the removal $i ∈ I$ disposed of in the period $j ∈ J$
$r j , l$
equals 1 if the disposal of the fuel $l ∈ L$ begins at the period $j ∈ J$
$p j , l$
summed powers of assemblies of the fuel $l ∈ L$ disposed of in the period $j ∈ J$
$e j o n$
equals 1 if the encapsulation begins at the period $j ∈ J$
$e j o f f$
equals 1 if the encapsulation ends at the period $j ∈ J$
h
length of the possible hiatus [period]
$q l$
period when the last canister of the fuel $l ∈ L$ is disposed of
$y j , l$
number of canisters for the fuel $l ∈ L$ disposed of at the period $j ∈ J$
$p l m a x$
maximum canister power of the fuel $l ∈ L$ [W]
$d l c$
distance between two adjacent canisters of the fuel $l ∈ L$ in a disposal tunnel [m]
$d l d t$
distance between two adjacent disposal tunnels of the fuel $l ∈ L$ [m].
Note that some of these variables, such as the number of canisters, have integer or even binary nature but they are relaxed as continuous variables to ease the computation.

#### 3.3. Binary Variables

In the model, we have $4 J + 1$ binary variables given below:
$s j , l$
fuel $l ∈ L$ is disposed of in the period $j ∈ J$
$w j$
two-shift work in the period $j ∈ J$
c
transition over the brittle fault zone

#### 3.4. Integer Variables

Besides binary variables, the model involves also $2 J + 3$ integer variables dedicated to model the water pools and racks. The integer variables used are:
$u l$
number of pools needing racks for the fuel $l ∈ L \ { 2 }$
o
total number of additional water pools in Olkiluoto
$v j , l$
number of pools for the fuel $l ∈ L \ { 2 }$ needed in the period $j ∈ J$

#### 3.5. Objectives

The eight objectives of the model are:
$min o$
$min ∑ i ∈ I ∑ j ∈ J ∑ l ∈ L A i , j , l x i , j , l ∑ i ∈ I ∑ l ∈ L M i , l$
$min ∑ j ∈ J ∑ l ∈ L y j , l$
$min max { q l | l ∈ L }$
$min ∑ j ∈ J ∑ l ∈ L s j , l$
$min Q r ∑ l ∈ L Q h d l c ∑ j ∈ J y j , l$
$min 1 Q ∑ l ∈ L d l d t Q h d l c ∑ j ∈ J y j , l + 2 D h Z h$
$min ∑ l = 2 3 C l i s o n O l + ∑ l = 2 3 C l i s o f f ( q l − O l ) + C p o + ∑ l ∈ L \ { 2 } C l r u l + ( C e f o n − C e f c h ) ( ∑ j ∈ J e j o n − 1 ) + C e f c h ( ∑ j ∈ J ∑ l ∈ L r j , l − 1 ) + ∑ l ∈ L C l s t ∑ i = 1 N l ∑ j ∈ J ( A i , j , l + i − N l ) x i , j , l + ∑ i = N l + 1 I ∑ j ∈ J A i , j , l x i , j , l + ∑ l ∈ L C l c ∑ j ∈ J y j , l + ( C e f − C h ) ∑ j ∈ J ∑ l ∈ L s j , l + C h max { q l | l ∈ L } + Q r ∑ l ∈ L C l d t Q h d l c ∑ j ∈ J y j , l + C c t ( 1 Q ∑ l ∈ L d l d t Q h d l c ∑ j ∈ J y j , l + 2 D h Z h ) + C c t D a d d c + C e f t s ∑ j ∈ J C e f w j .$
Note that the objectives (4) and (6)–(8) are nonlinear and additionally the objectives (4) and (8) are nonsmooth (i.e., nondifferentiable). The first objective (1) minimizes the total number of the additional water pools in the interim storage in Olkiluoto. With the objective (2), the average storage time of the fuel assemblies in the water pools is minimized. The next three objectives focus on the encapsulation facility such that the objective (3) minimizes the total number of canisters, the objective (4) minimizes the ending time of the disposal, and the objective (5) minimizes the number of disposal periods when the encapsulation plant is in operation. The objective (6) minimizes the total length of the disposal tunnels and the objective (7) minimizes the length of the central tunnel. There is a minimum distance that must be between the central tunnel and the first canister in a disposal tunnel. This extra length of a disposal tunnel is taken into account with the coefficient $Q r$. It is also worth noticing that, in practice, the central tunnel is built in pairs (see Figure 3), but, in the model, the variable corresponds to only one tunnel.
The last objective (8) minimizes the total costs. The first two terms specify the maintenance cost of the interim storages depending on whether the reactors are on or off in the corresponding reactor facility areas, the next two terms indicate the cost related to the water pools and the racks in there, and the next two terms take into account the cost caused by the turning on the encapsulation plant after the hiatus and the cost of changing the fuel type. The seventh term defines the storage cost of fuel assemblies followed by the canister cost. The cost related to the use of the encapsulation facility is given in the ninth and the tenth term. The building costs of disposal and central tunnels are captured in the eleventh and the twelfth terms, respectively. The last two terms in respective order are the cost of the possible transition over the brittle fault zone, and the cost of the two-shift work. All the costs are taken into account from the first period onwards.

#### 3.6. Constraints—Interim Storage

There are $3 I + 5 J$ linear constraints related to the interim storage:
$∑ j ∈ J x i , j , l = M i , l , i ∈ I , l ∈ L$
$∑ i = 1 N l + j ( M i , l + x i , j , l − ∑ k = 1 j x i , k , l ) ≤ B l a s v j , l , l ∈ L \ { 2 } , j = 1 , … , I − N l$
$∑ i ∈ I ( M i , l + x i , j , l − ∑ k = 1 j x i , k , l ) ≤ B l a s v j , l , l ∈ L \ { 2 } , j = I − N l + 1 , … , J$
$v j , 1 + v j , 3 ≤ o + B , j ∈ J$
$v j , 1 ≤ u 1 + B r , j ∈ J$
$v j , 3 ≤ u 3 , j ∈ J .$
The constraint (9) ensures that all the fuel assemblies are disposed of. The constraints (10) and (11) keep track of the pools needed in Olkiluoto considering the cases before and after all the removals from the reactor are done, respectively. The amounts of additional pools in Olkiluoto are considered in the constraint (12). Additionally, (13) defines the pools needing racks for OL1-2 and (14) for OL3.

#### 3.7. Constraints—Encapsulation Facility

In total, there are $25 J + 7 + ∑ l ∈ L ∑ k = k ^ I ( k + R − N l )$, where $k ^ = max { 1 , N l − R + 1 }$ linear constraints related to the encapsulation facility. First, we focus on constraints determining the operation times of the encapsulation facility:
$s 1 , 1 = 1$
$∑ j ∈ J e j o n ≤ 2$
$∑ l ∈ L s 1 , l = e 1 o n$
$∑ l ∈ L s j , l − ∑ l ∈ L s j − 1 , l ≤ e j o n , j ∈ J \ { 1 }$
$∑ j ∈ J e j o f f ≤ 2$
$e 1 o f f = 0$
$e J o f f ≥ ∑ l ∈ L s J , l$
$∑ l ∈ L s j − 1 , l − ∑ l ∈ L s j , l ≤ e j o f f , j ∈ J \ { 1 }$
$j ( ∑ k = 1 j e k o n − 1 ) + j ( e j o n − 1 ) − ∑ k = 1 j − 1 k e k o f f ≤ h , j ∈ J$
$q l ≥ j · s j , l , j ∈ J , l ∈ L .$
The constraint (15) determines that the encapsulation begins at the first disposal period with OL1-2 and the constraint (16) guarantees that the encapsulation has at most one hiatus. With the constraints (17) and (18), the variable $e j o n$ determining when the encapsulation begins is defined and the constraints (19)–(22) define the variable $e j o f f$ considering when the encapsulation is stopped. Additionally, the constraint (23) implies the length of the hiatus and the constraint (24) captures the last period of the encapsulation.
The production related constraints are:
$∑ l ∈ L s j , l ≤ 1 , j ∈ J$
$j · e j o f f + J ( 1 − e j o f f ) ≥ q l + 1 , j ∈ J , l ∈ L \ { 3 }$
$∑ j ∈ J r j , l ≤ 1 , l ∈ L \ { 1 }$
$s j , l − s j − 1 , l ≤ r j , l , l ∈ L , j ∈ J \ { 1 }$
$s 1 , l ≤ r 1 , l , l ∈ L$
$∑ j = 1 S ∑ l ∈ L s j , l ≤ S − 1 .$
The constraint (25) controls that only one type of the fuel is encapsulated in one period. In order to encapsulate all assemblies of OL1-2 and LO1-2 before the hiatus, the constraint (26) is introduced. With the constraint (27), LO1-2 and OL3 are forced to be encapsulated continuously without the fuel type changes. With the constraints (28) and (29), the variable $r j , l$ is defined. The last constraint (30) indicates that there is the hiatus in the production.
Finally, we give some constraints considering the canisters produced:
$y j , l ≥ 1 K l ∑ i ∈ I x i , j , l , j ∈ J , l ∈ L$
$∑ l ∈ L ( y j , l − U u p s j , l ) + V e j o n − W w j ≤ 0 , j ∈ J$
$∑ l ∈ L y j , l ≥ U l o w ∑ l ∈ L s j , l , j ∈ J$
$w j ≤ ∑ l ∈ L s j , l , j ∈ J$
$w j ≤ 1 − ∑ l ∈ L r j , l , j ∈ J$
$∑ i ∈ I x i , j , l ≤ ( U u p + W ) K l s j , l , j ∈ J , l ∈ L$
$s j , l ≤ ∑ i ∈ I x i , j , l , j ∈ J , l ∈ L$
$x i , j , l = 0 , i ≥ N l − R + 1 , j = 1 , … , i + R − N l , l ∈ L .$
The constraint (31) guarantees the number of canisters to be high enough and the constraint (32) keeps track of the number of canisters staying under the maximum production capacity. On the other hand, the constraint (33) ensures that the minimum capacity is fulfilled. The constraint (34) enables the two-shift work only when the encapsulation facility is on and the constraint (35) disallows the two-shift work at the first period after the fuel change. With the constraints (36) and (37), the variable $s i , j$, $i ∈ I$ and $j ∈ J$ is defined. The constraint (38) takes into account that fuel assemblies that do not satisfy the minimum cooling time requirement are not encapsulated.

#### 3.8. Constraints—Disposal Facility

The $6 J + 4$ constraints related to the disposal facility are
$∑ i ∈ I P i , j , l x i , j , l ≤ p j , l , j ∈ J , l ∈ L$
$p j , l ≤ y j , l p l m a x , j ∈ J , l ∈ L$
$d l c ≥ g l ( p l m a x , d l d t ) , l ∈ L$
$1 Q ∑ l ∈ L ( d l d t d l c Q h ∑ j ∈ J y j , l ) + 2 D h Z h − D c t ≤ M c .$
From these constraints, $3 J$ are linear and $3 J + 4$ and nonlinear. The constraint (39) defines the variable $p j , l$, $j ∈ J$ and $l ∈ L$ and (40) defines the variable $p l m a x$, $l ∈ L$. With the constraint (41), it is ensured that the distance between canisters is such that the temperature in the disposal facility stays in control. The function $g l : R 2 → R$ gives a relation between the maximum canister power, the distance between canisters, and the distance between disposal tunnels, and it is approximated with the relation (A1) given in Appendix B. Finally, the constraint (42) gives a value 1 for the variable c if the brittle fault zone is met.

#### 3.9. Constraints—Lower and Upper Bounds

We give $J ( 3 I + 7 ) + 16$ box constraints for variables as follows:
$p l m a x ∈ [ P l l o w , P l u p ] , l ∈ L d l c ∈ [ D c l o w , D c u p ] , l ∈ L d l d t ∈ [ D d t l o w , D d t u p ] , l ∈ L x i , j , l ∈ [ 0 , M i , l ] , i ∈ I , j ∈ J , l ∈ L r j , l ∈ [ 0 , 1 ] , j ∈ J , l ∈ L e j o n ∈ [ 0 , 1 ] , j ∈ J e j o f f ∈ [ 0 , 1 ] , j ∈ J q l ∈ [ 0 , J ] , l ∈ L h ∈ [ 0 , 0.7 J ] o ∈ [ 0 , O u p ] v j , l ∈ [ 0 , B j , l u p ] , j ∈ J , l ∈ L \ { 2 } u l ∈ [ 0 , B l u p ] , l ∈ L \ { 2 } ,$
and, finally, some boundaries for the variables:
$p j , l ≥ 0 , y j , l ≥ 0 , s j , l ∈ { 0 , 1 } , j ∈ J , l ∈ L , w j ∈ { 0 , 1 } , j ∈ J , and c ∈ { 0 , 1 } .$
To summarize, the model has eight objectives, $J ( 3 I + 11 ) + 13$ continuous variables, $4 J + 1$ binary variables, and $2 J + 3$ integer variables. Furthermore, the model has $3 I + 33 J + 7 + ∑ l ∈ L ∑ k = k ^ I ( k + R − N l )$, where $k ^ = max { 1 , N l − R + 1 }$ linear and $3 J + 4$ nonlinear constraints in total in addition to the $J ( 3 I + 7 ) + 16$ box constraints. Thus, the size of the model strongly depends on the length of the disposal period. It is good to note that $x i , j , l$, $y j , l$, and $d l d t$ are important variables in the sense that, if the values of these are defined, then the values of the other variables can be derived. In this case, the constraints will define values for some variables (for example $s j , l$) and give lower bounds to other variables (for example $d l c$). These lower bounds will be the final values because giving variables a higher value do not benefit any of the objectives.

#### 3.10. Scenario without Hiatus

Since we are also interested in investigating the effect of a hiatus, we define how the model needs to be modified in order to disallow the hiatus. The constraints (16) and (19) determine that the encapsulation begins and ends no more than twice. These constraints are thus replaced respectively with the following constraints:
$∑ j ∈ J e j o n ≤ 1 , ∑ j ∈ J e j o f f ≤ 1 .$
Furthermore, the constraint (26) ensuring that OL1-2 and LO1-2 are encapsulated before the hiatus and the constraint (30) forcing the hiatus can be omitted.

## 4. Methodology

In this section, we concentrate on the multiobjective MINLP problem
$min x ∈ X f ( x ) = { f 1 ( x ) , … , f k ( x ) } ,$
where $X = { x = ( y , z ) | y ∈ R n , z ∈ Z m } ∩ C$ such that C is the set of constraints, and X is the nonempty and compact set of feasible solutions. The functions $f i : X → R$ for all $i ∈ I = { 1 , … , k }$ are supposed to be lower semicontinuous with respect to $y$. In order to obtain a sensible multiobjective problem, we assume that the objectives are also at least partially conflicting. In the following, for the vectors $p , q ∈ R k$, we denote by $p < q$ if $p i < q i$ for all $i ∈ I$ and $p ≤ q$ if $p i ≤ q i$ for all $i ∈ I$.
A solution of the problem (43) is Pareto optimal if any objective cannot be improved without deteriorating some other objective simultaneously. That is, a solution $x ∗ ∈ X$ is Pareto optimal if there does not exist any solution $x ∈ X$ such that $f ( x ) ≤ f ( x ∗ )$ and $f j ( x ) < f j ( x ∗ )$ for at least one index $j ∈ I$. Furthermore, the solution of the problem (43) $x ′ ∈ X$ is weakly Pareto optimal if there exists no other solution $x ∈ X$ such that $f ( x ) < f ( x ′ )$. Usually, the multiobjective problem has several Pareto optimal solutions and the set of these solutions is called a Pareto set. The range of the Pareto set can be approximated with an ideal $f i d$ and a nadir vector $f n a d$ as the lower and the upper bounds. The components of the ideal vector are obtained by minimizing the individual objectives while the determination of the nadir vector is much harder, and the nadir vector needs to be approximated in practice.
One acknowledged approach to solve the problem of the form (43) is the use of the achievement scalarizing functions (ASFs) (see, e.g., [4,9,35]). The idea in brief is to transfer the multiobjective problem to a single objective one such that solving the single-objective problem the result is a Pareto optimal solution for the original multiobjective problem. The single-objective problem is formed in such a way that it minimizes the distance between the Pareto set and the reference point fR involving the decision maker’s wishes towards the solution. If $f R ∈ Z + R + k$, where Z is the image of the feasible solutions in the objective space, then the reference point is achievable and otherwise unachievable. Besides employing ASFs as such, they are also made a name as a part of interactive methods [3,4,5,7,8,9,36], where the most satisfactory solution for the decision maker is found after an active dialogue between the decision maker and the analyst.
In this paper, we utilize the interactive method using the special type of the ASFs proposed in [6] called the multiobjective interactive method utilizing the two-slope parameterized ASFs (MITSPA). The two-slope parameterized ASFs presented in [37] generalize the good properties of the parameterized ASFs [38] and the two-slope ASFs [39]. Indeed, with the two-slope parameterized ASFs, we can systematically produce different Pareto optimal solutions from the same preference information without involving any test of the achievability of the reference point.
The family of the two-slope parameterized ASFs is defined by
$min x ∈ X max I q ⊆ I | I q | = q ∑ i ∈ I q max { λ i U ( f i ( x ) − f i R ) , 0 } + min { λ i A ( f i ( x ) − f i R ) , 0 } ,$
where $λ U$, $λ A$ are positive coefficients for unachievable and achievable reference points, respectively. Additionally, $I q ⊆ I$ is a set of q integers from the interval $[ 1 , k ]$ such that k is the number of objectives. Indeed, the maximization is taken over all the sets containing q integers from $[ 1 , k ]$. When $q = 1$, the used metric is $L ∞$ and if $q = k$, the linear $L 1$ metric is used. Another good property of $s R q ( f ( x ) , λ U , λ A )$ is that, if the objectives $f i$, $i ∈ I$ and the set X are convex, $s R q ( f ( x ) , λ U , λ A )$ preserves the convexity (see Theorem 8 in [37]). In the case of the convex objective, the global optimality of the scalarized problem (44) is easier to guarantee.
In order to justify the use of the two-slope parameterized ASFs, we recall the following theorem from [6]. The proof of the theorem is given in Appendix A.
Theorem 1.
[6] For the scalarized problem (44), it holds that:
(i)
Any optimal solution of the scalarized problem is weakly Pareto optimal for the problem (43).
(ii)
Among optimal solutions of the scalarized problem, there exists at least one Pareto optimal solution for the problem (43).
(iii)
If$x ∗$is a weakly Pareto optimal solution for the problem (43), then it is a solution of the scalarized problem (44) with $f R = f x ∗ )$, and the optimal value is zero.
Furthermore, the Pareto optimality of the solutions obtained can be guaranteed by adding an augmentation term [4]
$ρ ∑ i ∈ I λ i ( f i ( x ) − f i R ) , ρ > 0 , λ i > 0 for all i ∈ I$
to the objective of the scalarized problem (44) [6,37].
The interactive framework used follows the same basic structure than many other interactive methods. First, the ranges of the Pareto set are illustrated; then, the decision maker gives some preference information and based on the preference information some problem(s) is solved. The results are then presented to the decision maker giving some new preference information based on the results. This process continues until the decision maker is satisfied with the solution. Here, the reference point is used as a tool to communicate with the decision maker. This is considered as an intuitive approach for the decision maker since the reference point and the solution vector are in the same form. Other interactive methods combining the reference point and the scalarization function are described for example in [3,4,5,7,8,9,36]. Compared with these, we gain the advantages of the two-slope parameterized ASF by using MITSPA. In the following, the outline of MITSPA is described. For further details of the method, we refer to [6].
Multiobjective interactive method utilizing the two-slope parameterized ASFs (MITSPA)
Step 0.
Illustrate the Pareto set with the ideal vector $f i d$ and the nadir vector $f n a d$.
Step 1.
Set the iteration counter $h = 1$ and select the maximum number of iterations $h max$. Ask the decision maker to provide the reference point $f h R$ and the number of solutions $s ∈ { 1 , … , k }$ presented for each reference point.
Step 2.
Solve the problem (44) with the augmentation term (45) with the current reference point $f h R$.
Step 3.
Present s solutions to the decision maker and ask the decision maker to select the most preferable solution among them as the current solution fh.
Step 4.
If $h = h max$ or the decision maker is satisfied with the current solution fh, stop with the current solution as the final solution f*. Otherwise, ask the decision maker to specify the new reference point $f h + 1 R$ as the current reference point, set $h = h + 1$, and go to Step 2.
In Step 0 of MITSPA, the Pareto set is illustrated. In addition to the ideal and nadir vector, the solutions can be exemplified by giving some neutral solution obtained, for example, with some achievement scalarizing function using the ideal vector as the reference point or with some non-preference method (see e.g., [4,40,41,42,43,44]). By solving the scalarized problem (44) with different parameter q values, k different solutions in total can be obtained for one reference point and $s ∈ { 1 , … , k }$ of them are presented for the decision maker. In order to aid the decision maker, it is reasonable to keep the value of s quite small. However, if the decision maker is willing to see more than s solutions with the same reference point, the rest of the k solutions can be presented between Steps 3 and 4. If even more solutions are needed, they can be calculated by varying the weighting coefficients in the scalarized problem (44). Furthermore, if the decision maker is willing to return to some previous solution, the solutions from the previous iterations can be stored. It is worth noticing that, even if the maximum number of iterations $h max$ is included, it is crucial to make sure that the decision maker is willing to stop the process when the $h max$ is met.

## 5. Numerical Experiments

In this section, we solve the multiobjective MINLP model presented in Section 3 with the interactive approach in Section 4. In addition, we investigate the model by minimizing only the costs. Therefore, in the numerical experiments, tools for solving single- and multiobjective problems are needed. However, multiobjective problems are solved with MITSPA utilizing scalarization. Via the scalarization, multiple objectives are reformulated as a single-objective problem and by solving this problem, a Pareto optimal solution for the original problem can be obtained. Thus, we only need a solver capable of solving single-objective MINLP problems. For this purpose, we use the method employing the branch-and-bound idea called SCIP (Solving Constraint Integer Programs) [45,46,47] in GAMS [48] with SoPlex and Ipopt. The relative tolerance is set as 0.000001 and and the maximum time limit was set to 86,400 s.

#### 5.1. Cost Minimization Results

We begin the numerical experiments by investigating the single-objective case minimizing the total costs i.e., using (8) as the only objective. The affects of the hiatus on the costs are also considered. The data used is described in Appendix A except the parameters related to the costs which are omitted due to their commercial nature. However, the repeatable single-objective example with an artificial cost data are given in Appendix B. In total, the problem has 887 linear and 61 nonlinear constraints. Furthermore, we have 963 continuous, 77 binary, and 41 integer variables. Note that the scenario without the hiatus has 39 constraints less than the base scenario. The CPU time of the single-objective base scenario having the hiatus is 579 s. For the scenario without the hiatus, the algorithm stopped after 86,439 s reaching the time limit with the 0.0005% relative gap between the dual and the primal bound.
In Figure 4, the solutions for both scenarios with and without the hiatus are presented. Figure 4a illustrates the values of the objectives (1)–(8) in the interval from 0 to 1 such that 0 represents the value of the ideal vector for the corresponding objective in the base scenario and 1 represents the nadir value in the base scenario. The solution for the base scenario is given in the red line and the solution without the hiatus is given in the blue line. Figure 4b,c shows the schedules obtained for the base scenario and the scenario without the hiatus, respectively. From these schedules, we see how many canisters are planned to be encapsulated at each period. The blue bars in Figure 4b,c refer to canisters of OL1-2, the orange refers to LO1-2, and purple refers to OL3.
As we see, when the costs are minimized, the model gains advantage from the hiatus and the solution without the hiatus has around 1.7% higher costs than the solution of the base scenario. More significant differences of the solutions can be seen from the other objective values. For example, the scenario without the hiatus needs around 5.9% more storage time than the base scenario and, even if the both scenarios have the same ending time, the scenario without the hiatus has the encapsulation facility in operation 20 years more than the base scenario. However, the central tunnel is 11.6% longer in the base scenario than in the scenario without the hiatus.
From the schedules obtained, we see that the first three periods, or in other words 15 years, looks similar in the both scenarios. After that, one period has a minor difference and then again the next three periods are similar. Then, the rest of OL1-2 is disposed of in two periods in the base scenario and in five periods in the case without the hiatus. Finally, OL3 is disposed of and the base scenario needs one period less than the case without the hiatus, but the disposal ends at the same time in the both cases. The similar beginning in the schedules indicates that the decision about whether to have the hiatus or not does not significantly affect the disposal pace before the rest of OL1-2 will be disposed of when the costs are minimized. However, for OL1-2, the maximum canister power is higher in the base scenario than in the scenario without the hiatus. Moreover, the spacing between the disposal tunnels is larger while the canister spacing is the same being minimal.

#### 5.2. Multiobjective Optimization Results

In the following, we solve the multiobjective model presented in Section 3 with MITSPA. First, we focus on the basic scenario with the hiatus. The data used for the parameters are given in Appendix A other than the cost related parameters which are excluded due to their commercial nature. Compared with the single-objective case, besides having eight objectives instead of one, we need some additional constraints and variables to rewrite the scalarized problem (44) as in [37]. The weighting coefficients $λ U$ and $λ A$ are selected as is suggested in [39] such that
$λ U = 1 f n a d − f R , λ A = 1 f R − f i d$
when $f n a d − f R > 0$ and $f R − f id > 0$. Otherwise, the coefficient $1 / ( f n a d − f i d )$ is used. Furthermore, we set the coefficient $ρ = 0.0001$.
The decision maker selects the ideal vector $f i d$ as the first reference point $f 1 R$. Here, we present three different solutions in Step 3 of MITSPA. In Figure 5, the results for the first reference point are illustrated. Figure 5a shows the values of the objectives in the interval from 0 to 1. This interval is the same as in Section 5.1 such that 0 represents the ideal vector of the base scenario and 1 represents the nadir value. The solutions are referred to with the reference point and the value of the parameter q; for instance, the solution r1q1 is a solution obtained with the reference point 1 when $q = 1$. Figure 5b–d presents the disposal schedules for the solutions r1q1, r1q3, and r1q8, respectively. In those figures, blue refers to OL1-2, orange to LO1-2, and purple to OL3.
Based on the objective function values illustrated in Figure 5a, the length of the central tunnel and the total costs seem to be conflicting objectives. In addition, the smaller number of canisters yields to the longer central tunnel. Nevertheless, this sounds reasonable since, with fewer canisters, the power of the canister may be larger, which leads to the larger spacings between canisters. This in its turn lengthens the central tunnel. Furthermore, the lengths of the disposal and central tunnels are also conflicting objectives. Indeed, if the canister heat powers are equal, we may increase the canister spacing or the disposal tunnel spacing to control the temperature on the surface of canisters in the disposal facility. The increase in the canister spacing will increase the disposal and central tunnel lengths. However, the increase in the disposal tunnel spacing will increase only the central tunnel length, but the increase is typically much larger. The schedules in Figure 5b–d propose the same ending time and the place for the hiatus.
From the first iteration, the decision maker selects the solution r1q8 as the current solution f1 since it is a good compromise between the solutions presented. It minimizes the additional water pools, and the total costs are still at the reasonable level. The next reference point $f 2 R$ adapts the solution r1q8 expect that the number of canisters is selected to be minimal and the ending and the operation time are increased. These changes aim to minimize the canisters needed while keeping the costs reasonable and trying to avoid the additional water pools.
The results of the second iteration are illustrated in Figure 6. From Figure 6a, we see that the solutions r2q5 and r2q7 are quite similar, and the solution r2q4 is clearly a different kind. Both solutions r2q5 and r2q7 need less canisters than the current solution f1, but one additional pool is needed and the storage time is increased. On the other hand, the solution r2q4 lengthens the operation time as was suggested by the reference point $f 2 R$, but also the number of canisters is increased. However, the central tunnel is shorter than in the current solution. In schedules given in Figure 6b–d, we see that, in the solution r2q4 in Figure 6b, the hiatus is one period shorter than in other schedules.
The decision maker selects the solution r2q7 as the current solution f2. This is selected since the number of canister is the lowest and also the costs are low. Furthermore, the schedule in Figure 6d looks most feasible from the practical point of view due to the calm beginning. The reference point $f 3 R$ adjusts this solution such that the central and disposal tunnels are set to the minimum and the storage, ending, and operation time are deteriorated.
The solutions of the third iteration all have longer storage, ending, and operation time than the current solution f2 as is seen in Figure 6a. Additionally, the total costs are increased. Furthermore, the total length of the central and disposal tunnels are shorter in all the solutions, and no additional water pools are needed. In this iteration, the solutions have less variety. Indeed, the differences of the solutions r3q3 and r3q4 are hard to see from Figure 6a. However, the solution r3q3 has a bit longer storage time, few extra canisters, longer disposal tunnel, and it is a slightly more expensive than the solution r3q4. However, the central tunnel in the solution r3q3 is shorter than in the solution r3q4. The schedules in Figure 7b–d show that the biggest differences between the solutions can be seen in the second part of OL1-2. However, the solution r3q3 has a few extra canisters in the last period of LO1-2 compared to the solution r3q4. By considering all the schedules presented, the two-shift work is utilized only when OL3 is encapsulated.
The decision maker selects the solution r3q4 as the final solution $f ∗ = f 3$. Both solutions r3q3 and r3q4 would be good alternatives, but the solution r3q4 is selected due to the smaller number of canisters and the shorter disposal tunnel. During the interactive process, we learned that the model suggests schedules with heavy starting which will decrease in later periods. The behavior of this kind is very hard to employ in practice, and, thus, we investigate what happens, if the reference point is the solution r3q4, or, in other words $f 4 R = f 3$, and we add the following constraint:
$∑ l ∈ L y j − 1 , l ≤ ∑ l ∈ L y j , l + ( W + U u p ) · ( 1 − ∑ l ∈ L s j , l ) , j ∈ J \ { 1 } .$
This constraint guarantees that, at every period, the hiatus is not applied and the number of canisters to be encapsulated needs to be at least as many as in the previous period.
Here, we observe only one solution, namely r4q5. As we see from Figure 8a, the additional constraint increases the number of the canisters needed together with the length of the disposal tunnel and the costs. On the other hand, the storage, ending, and operation times get shorter. From the schedule point of view in Figure 8b, the encapsulation before the hiatus is very even except the last period when the two-shift work is needed. Compared to the solution r3q4, the solution r4q5 has a longer hiatus taking 25 years, and the disposal ends one period earlier.
All the results obtained during the interactive process suggest a hiatus between 15 to 25 years. This indicates that the model gains advantage from the hiatus since only a 5-year hiatus is forced. Unfortunately, the hiatus has its own risks. Therefore, we test how well we can achieve the objective values of the solution f* with the scenario without the hiatus. Thus, we set $f 5 R = f 4 R$ and the result is shown in Figure 9.
By omitting the hiatus, the objective values for the operation time and the central tunnel increase as well as the number of canisters, the disposal tunnel, and the costs but only 1.2%. However, the objective values for the ending and storage time decrease. The schedule of the solution r5q1 in Figure 9b is similar to the solution r3q4 for the first nine periods. After that, the minimal amount of canisters are encapsulated until the last period when as many canisters as possible are encapsulated by using the two-shift work, and the final disposal ends one period sooner than in the solution r3q4. Again, the similar beginning in the schedules of the base scenario and the scenario without hiatus can be observed as in the single-objective case minimizing costs. However, in this case, the differences in the maximum canister power and the disposal tunnel spacing are less significant.
The CPU times of solving each scalarized problem (44) with the augmentation term in the base scenario reported here varies from 645 s to 6008 s while the average CPU time is 3101 s and the median CPU time is 1898 s. The CPU time of the solution r4q5 is 7265 s and of the solution r5q1 3943 s making both alternative scenarios more time-consuming than the average problem of the base scenario. In general, it seems that the scalarized problems with the smaller value of the parameter q (i.e., closer to the $L ∞$ metric) are computationally harder than the scalarized problems with the higher value of q (i.e., closer to the $L 1$ metric). Similar behavior is also observed in [37].

## 6. Conclusions

In this paper, we have proposed a new model for the final disposal of the spent nuclear fuel in Finland. The model involves all the spent nuclear fuel produced in Finland by the current estimates. As a result, we obtain a schedule giving the number of canisters encapsulated periodically. Note that the schedule obtained gives only guidelines, and it does not consider how the individual canisters are loaded. Moreover, the model does not give any complex layout of the disposal facility. The model is a multiobjective MINLP problem having eight objectives. This is solved with the interactive method called MITSPA. The multiobjective results are presented and commented also from the practical point of view. Furthermore, the solutions minimizing only the total costs are given. Indeed, by comparing these solutions, by increasing the costs around 3.33%, the additional water pool can be omitted and the lengths of the central and disposal tunnels can be decreased.
In the numerical experiments, only 5-year disposal periods are considered. As the numerical experiments have shown, the CPU times of the 5-year model are moderate. However, 5 years is a bit long of a disposal period, and the properties of the spent nuclear fuel are taken conservatively into account yielding the overestimation of the heat power. Therefore, we have tested also more practical 2- and 1-year disposal periods. These tests indicate the similar nature of the solutions than solutions obtained with a 5-year disposal period length. Unfortunately, the size of the problem grows a lot: the number of variables increase around fivefold and 18-fold, and the number of constraints increase around threefold and ninefold for 2-year and 1-year period length, respectively. These combined with the integer variables, the computational efforts grow as well, and the optimum cannot be guaranteed in the most of the cases. Nevertheless, the number of the objectives is so high that the several metrics are available for the two-slope parameterized ASF and, in most of the cases, at least some metric provides an optimal solution in the 2-year case.
Another issue concerning the properties of the several metrics of the two-slope parameterized ASF is the role of the parameter q. In [6], the solutions were clearly divided into two groups based on the value of the q. Thus, if only one metric would have been used, the other type of solutions would have been omitted. In these experiments, the separation of this kind was not observed. However, by systematically producing different Pareto optimal solutions, we obtain a reasonably distributed sample of the Pareto set. Furthermore, we do not have to test the achievability of the reference point. Even though all the reference points utilized here are unachievable, especially in the beginning of the solution process, the decision maker may have realistic and cautious expectations towards the solutions yielding more achievable reference points.
For the further studies, different scenarios could be investigated, for example, by changing the order of the fuel types. In the future, the model needs to be resolved once the data become more accurate along with the further investigations, for instance, related to the estimations of the thermal conductivity. It would also be interesting to consider more accurate time resolution such that schedules for transporting the fuels could be included. However, it is worth noticing that it is impossible to know the fuel transportations for the whole production beforehand. In addition, the schedule obtained with the current model could be utilized when the loading of the canister is considered.

## Author Contributions

Conceptualization, O.M., V.-P.E., T.R., J.A.S.H., and M.M.M.; methodology, O.M., V.-P.E., T.R., and M.M.M.; software, O.M. and V.-P.E.; validation, O.M.; formal analysis, O.M.; investigation, O.M.; resources, M.M.M.; data curation, O.M., V.-P.E. and J.A.S.H.; writing—original draft preparation, O.M.; writing—review and editing, O.M., V.-P.E., T.R., J.A.S.H., and M.M.M.; visualization, O.M., V.-P.E., and J.A.S.H.; supervision, T.R. and M.M.M.; project administration, O.M. and T.R.; funding acquisition, O.M., T.R., J.A.S.H., and M.M.M. All authors have read and agreed to the published version of the manuscript.

## Funding

This research was funded by Posiva Oy under the project Posiva Ydinoptimointi project number 2610102511 of the University of Turku.

## Acknowledgments

The authors wish to thank the power companies Fortum Power and Heat Oy and Teollisuuden Voima Oyj, and Posiva Oy for enabling this research project with its topic, collaborations with fuel and disposal experts, and comments throughout the project as well as into the paper. In particular, we thank Maiju Paunonen, Tuukka Lahtinen, and Jaakko Kuopanportti from Fortum Power and Heat Oy, Ari Maarni, Jussi Palmu, Jaana Palomäki, Petteri Vuorio, and Ari Posti from Posiva Oy, and Arttu Knuutila, Mikael Solala, and Anssu Ranta-aho from Teollisuuden Voima Oyj. The authors also acknowledge GAMS Development Corporation for providing us license to use different GAMS solvers.

## Conflicts of Interest

The authors declare no conflict of interest. The funder has provided together with the power companies the data for the model and the aid of the experts in order to make the problem definition and the decision-making process realistic and such that all the safety criteria are took into account. The funder had no role in the design of the study; the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

## Appendix A. Proof of Theorem 1

The following proof follows Theorem 1 in [6] and the results in [37].
Theorem.
[6] For the scalarized problem (44), it holds that:
(i)
Any optimal solution of the scalarized problem is weakly Pareto optimal for the problem (43).
(ii)
Among optimal solutions of the scalarized problem, there exists at least one Pareto optimal solution for the problem (43).
(iii)
If$x ∗$is a weakly Pareto optimal solution for the problem (43), then it is a solution of the scalarized problem (44) with $f R = f ( x ∗ )$, and the optimal value is zero.
Proof.
In the following, we denote $I x = { i ∈ I q | f i R ≤ f i ( x ) }$, $J x = { i ∈ I q | f i R > f i ( x ) }$ for any $x ∈ X$ and $s R q ( f ( x ) , λ U , λ A )$ is the objective of the scalarized problem (44).
(i) Let $x ∗$ be an optimal solution of the problem (44) but not a weakly Pareto optimal solution of the problem (43). Thus, there exists a feasible solution $x ′ ∈ X$ such that $f ( x ′ ) < f ( x ∗ )$. Then,
$s R q ( f ( x ′ ) , λ U , λ A ) = max I q ⊆ I | I q | = q ∑ i ∈ I x ′ λ i U ( f i ( x ′ ) − f i R ) + ∑ i ∈ J x ′ λ i A ( f i ( x ′ ) − f i R ) < max I q ⊆ I | I q | = q ∑ i ∈ I x ′ λ i U ( f i ( x ∗ ) − f i R ) + ∑ i ∈ J x ′ λ i A ( f i ( x ∗ ) − f i R ) ≤ max I q ⊆ I | I q | = q ∑ i ∈ I x ∗ λ i U ( f i ( x ∗ ) − f i R ) + ∑ i ∈ J x ∗ λ i A ( f i ( x ∗ ) − f i R ) = s R q ( f ( x ∗ ) , λ U , λ A )$
(ii) Let $x ∗$ be an optimal solution of the problem (44) but not a Pareto optimal solution of the problem (43). By the definition of Pareto optimality, there exists such $x ′ ∈ X$ that $f ( x ′ ) ≤ f ( x ∗ )$ and such an index $j ∈ I$ that $f j ( x ′ ) < f j ( x ∗ )$. Like in (i), it can be derived that $s R q ( f ( x ′ ) , λ U , λ A ) ≤ s R q ( f ( x ∗ ) , λ U , λ A )$. If the equality holds, $x ′$ is an optimal solution for the problem (44) and Pareto optimal for the problem (43). If the inequality is strict, this contradicts with the assumption that $x ∗$ is an optimal solution for the problem (44).
(iii) Let $x 1 , x 2 ∈ X$ be such that $f ( x 1 ) < f ( x 2 )$. Thus,
$s R q ( f ( x 1 ) , λ U , λ A ) = max I q ⊆ I | I q | = q ∑ i ∈ I x 1 λ i U ( f i ( x 1 ) − f i R ) + ∑ i ∈ J x 1 λ i A ( f i ( x 1 ) − f i R ) < max I q ⊆ I | I q | = q ∑ i ∈ I x 2 λ i U ( f i ( x 2 ) − f i R ) + ∑ i ∈ J x 2 λ i A ( f i ( x 2 ) − f i R ) = s R q ( x 2 ) , λ U , λ A ) .$
Therefore, $s R q$ is strictly increasing (i.e., $s R q ( f ( x 1 ) , λ U , λ A ) < s R q ( f ( x 2 ) , λ U , λ A )$ for any $f ( x 1 ) , f ( x 2 )$ having $f ( x 1 ) < f ( x 2 )$ and $x 1 , x 2 ∈ X$). It is known (see [4]) that, for any strictly increasing ASF, a weakly Pareto optimal solution $x ∗$ of the problem (43) is a solution of the scalarized problem with $f R = f ( x ∗ )$ and the optimal value of $s R q$ is zero. □

## Appendix B. Data

Here, we describe the data used in the numerical experiments in Section 5. We begin with the approximation of the relation between the distance between canisters, the distance between disposal tunnels, and the canister power used in the constraint (41). The following approximation bases on the thermal dimensioning in [28]. For all $l ∈ L$, the constraint (41) is of the form
$d l c ≥ g l ( p l m a x , d l d t ) = a 1 + a 2 e a 3 d l d t + a 4 ( p l m a x ) a 5 + a 6 ( a 7 − p l m a x ) a 8 + a 9 ( p l m a x ) a 5 e a 3 d l d t ,$
where the parameters varies for each fuel type as follows:
 $l = 1$ $l = 2$ $l = 3$ $a 1$ −13.3225 −17.7214 −5.6820 $a 2$ −2.070055 −1.3719 −0.84042 $a 3$ −0.11231 −0.11309 −0.10536 $a 4$ 0.00018838 0.00016029 0.00152066 $a 5$ 1.21 1.2 1 $a 6$ 52.86444 50.29513 66.6190 $a 7$ 2052 1696 2179 $a 8$ 0.18 0.14 0.32 $a 9$ 0.0050607 0.0056701 0.0253018
The relations for each fuel type are illustrated in Figure A1.
Figure A1. Approximated relations between canister spacing, tunnel spacing, and canister power.
Figure A1. Approximated relations between canister spacing, tunnel spacing, and canister power.
The rest of the parameter values (except the cost parameters) are based on the data provided by Fortum Power and Heat Oy, Teollisuuden Voima Oyj, and Posiva Oy and are given in below and in Table A1, Table A2, Table A3, Table A4, Table A5, Table A6 and Table A7.
 I = 13 M = 5000 J = 19 $U l o w$ = 105 L = 3 $U u p$ = 300 $O l$ = $( 4 , 2 , 11 )$ V = 24 R = 4 W = 200 $N l$ = $( 9 , 8 , 1 )$ $K l$ = $( 12 , 12 , 4 )$ Q = 270 $P l l o w$ = $( 1374 , 1229 , 1265 )$ $Q r$ = 1.111 $P l u p$ = $( 1700 , 1370 , 1830 )$ $Q h$ = 1.05 S = 16 $D c t$ = 3500 $B l a s$ = $( 2496 , − , 800 )$ $D a d d$ = 1800 B = 6 $D h$ = 2.5 $B r$ = 4 $D c l o w$ = 6 $O u p$ = 5 $D c u p$ = 12 $B l u p$ = $( 6 , − , 5 )$ $D d t l o w$ = 25 $C e f t s$ = 0.5 $D d t u p$ = 50 $B j , l u p$ = $( 6 , − , 6 )$ for all $j ∈ J$
Table A1. Number of assemblies of the fuel $l ∈ L$ belonging to the removal $i ∈ I$ $M i , l$.
Table A1. Number of assemblies of the fuel $l ∈ L$ belonging to the removal $i ∈ I$ $M i , l$.
$M i , l$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$l = 1$94413241210126413081160108710251036103010301324500
$l = 2$2650123910501008876840828817313000
$l = 3$3083632423632423632423632423632424830
Table A2. Storage time of an assembly of OL1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $A i , j , 1$.
Table A2. Storage time of an assembly of OL1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $A i , j , 1$.
$A i , j , 1$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$9876543210−1−2−3
$j = 2$109876543210−1−2
$j = 3$11109876543210−1
$j = 4$1211109876543210
$j = 5$13121110987654321
$j = 6$141312111098765432
$j = 7$1514131211109876543
$j = 8$16151413121110987654
$j = 9$171615141312111098765
$j = 10$1817161514131211109876
$j = 11$19181716151413121110987
$j = 12$201918171615141312111098
$j = 13$2120191817161514131211109
$j = 14$22212019181716151413121110
$j = 15$23222120191817161514131211
$j = 16$24232221201918171615141312
$j = 17$25242322212019181716151413
$j = 18$26252423222120191817161514
$j = 19$27262524232221201918171615
Table A3. Storage time of an assembly of LO1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $A i , j , 2$.
Table A3. Storage time of an assembly of LO1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $A i , j , 2$.
$A i , j , 2$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$876543210−1−2−3−4
$j = 2$9876543210−1−2−3
$j = 3$109876543210−1−2
$j = 4$11109876543210−1
$j = 5$1211109876543210
$j = 6$13121110987654321
$j = 7$141312111098765432
$j = 8$1514131211109876543
$j = 9$16151413121110987654
$j = 10$171615141312111098765
$j = 11$1817161514131211109876
$j = 12$19181716151413121110987
$j = 13$201918171615141312111098
$j = 14$2120191817161514131211109
$j = 15$22212019181716151413121110
$j = 16$23222120191817161514131211
$j = 17$24232221201918171615141312
$j = 18$25242322212019181716151413
$j = 19$26252423222120191817161514
Table A4. Storage time of an assembly of OL3 belonging to the removal $i ∈ I$ in the period $j ∈ J$$A i , j , 3$.
Table A4. Storage time of an assembly of OL3 belonging to the removal $i ∈ I$ in the period $j ∈ J$$A i , j , 3$.
$A i , j , 3$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$10−1−2−3−4−5−6−7−8−9−10−11
$j = 2$210−1−2−3−4−5−6−7−8−9−10
$j = 3$3210−1−2−3−4−5−6−7−8−9
$j = 4$43210−1−2−3−4−5−6−7−8
$j = 5$543210−1−2−3−4−5−6−7
$j = 6$6543210−1−2−3−4−5−6
$j = 7$76543210−1−2−3−4−5
$j = 8$876543210−1−2−3−4
$j = 9$9876543210−1−2−3
$j = 10$109876543210−1−2
$j = 11$11109876543210−1
$j = 12$1211109876543210
$j = 13$13121110987654321
$j = 14$141312111098765432
$j = 15$1514131211109876543
$j = 16$16151413121110987654
$j = 17$171615141312111098765
$j = 18$1817161514131211109876
$j = 19$19181716151413121110987
Table A5. Decay heat power of an assembly of OL1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 1$.
Table A5. Decay heat power of an assembly of OL1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 1$.
$P i , j , 1$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$52.08584.911111.69129.09152.4130003000300030003000300030003000
$j = 2$47.67377.937102.38118.04138.84162.83000300030003000300030003000
$j = 3$43.72771.69794.068108.2126.92148.23173.6300030003000300030003000
$j = 4$40.19866.10886.63299.43116.34135.44157.97187.5130003000300030003000
$j = 5$37.04161.179.97291.582106.89124.1144.27170.46208.313000300030003000
$j = 6$34.21556.6174.00484.55598.458114132.14155.55189.23209.32300030003000
$j = 7$31.68552.58468.65278.25990.908104.98121.34142.63172.57190.16209.3330003000
$j = 8$29.4248.97163.8572.61284.14696.915111.7130.63157.84173.41190.16176.553000
$j = 9$27.39145.72859.53967.54678.08689.696103.1120.19144.77158.62173.42160.53118.15
$j = 10$25.57442.81655.66762.99872.64983.22995.398110.87133.13145.48158.62146.49107.82
$j = 11$23.94540.252.18758.91367.76877.4388.503102.54122.76133.79145.49134.0698.662
$j = 12$22.48537.84849.05755.24163.38572.22682.32495.084113.49123.37133.79123.0190.491
$j = 13$21.37435.73246.24151.93859.44467.55376.78188.409105.21114.05123.37113.1583.183
$j = 14$21.37434.57643.70548.96555.963.35271.80482.42597.792105.73114.06104.3576.64
$j = 15$21.37434.57642.28746.28752.70859.57367.33177.05591.14698.278105.7396.48770.777
$j = 16$21.37434.57642.28744.80549.83256.1763.30872.2385.18591.60198.28189.44865.52
$j = 17$21.37434.57642.28744.80548.26953.10359.68667.89279.83285.6191.60383.14260.806
$j = 18$21.37434.57642.28744.80548.26951.42956.42123.98775.01980.23185.61377.48956.575
$j = 19$21.37434.57642.28744.80548.26951.42954.67360.46770.68775.39480.23372.41752.778
Table A6. Decay heat power of an assembly of LO1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 2$.
Table A6. Decay heat power of an assembly of LO1-2 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 2$.
$P i , j , 2$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$72.96388.88294.076114.42300030003000300030003000300030003000
$j = 2$67.42581.97986.574104.9127.6330003000300030003000300030003000
$j = 3$62.45275.79879.87696.504116.93139.83000300030003000300030003000
$j = 4$57.98370.25473.87789.021107.52127.91155.97300030003000300030003000
$j = 5$53.96565.27768.49582.32699.139117.47142.5158.8630003000300030003000
$j = 6$50.35160.80463.66376.32691.655108.21130.71145.13153.413000300030003000
$j = 7$47.09956.78459.32170.94384.95499.95120.26133.12140.25108.89300030003000
$j = 8$44.17253.16755.41866.10978.94892.57110.97122.48128.73100.05300030003000
$j = 9$41.53649.91151.90661.76573.55985.964102.68113.01118.592.2300030003000
$j = 10$39.16146.97948.74557.85868.71880.04595.279104.57109.485.177300030003000
$j = 11$37.0244.33645.89854.34264.36774.73688.65497.03101.2878.881300030003000
$j = 12$35.08941.95343.33251.17560.45269.96882.71890.28494.01773.23300030003000
$j = 13$33.34539.80141.01748.3256.92765.68377.39484.24187.51568.154300030003000
$j = 14$31.78637.85738.92845.74553.7531.82672.61478.8281.68863.591300030003000
$j = 15$31.78636.51437.0443.4250.88458.35368.31573.95376.45959.487300030003000
$j = 16$31.78636.51436.03641.31848.29655.22164.44569.57671.76155.793300030003000
$j = 17$31.78636.51436.03640.16845.95652.39360.95865.63667.53552.466300030003000
$j = 18$31.78636.51436.03640.16844.6749.83857.8162.08563.7349.469300030003000
$j = 19$31.78636.51436.03640.16844.6748.4454.96658.8860.29946.765300030003000
Table A7. Decay heat power of an assembly of OL3 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 3$.
Table A7. Decay heat power of an assembly of OL3 belonging to the removal $i ∈ I$ in the period $j ∈ J$ $P i , j , 3$.
$P i , j , 3$$i = 1$$i = 2$$i = 3$$i = 4$$i = 5$$i = 6$$i = 7$$i = 8$$i = 9$$i = 10$$i = 11$$i = 12$$i = 13$
$j = 1$3000300030003000300030003000300030003000300030003000
$j = 2$3000300030003000300030003000300030003000300030003000
$j = 3$3000300030003000300030003000300030003000300030003000
$j = 4$3000300030003000300030003000300030003000300030003000
$j = 5$443.82300030003000300030003000300030003000300030003000
$j = 6$405.61652.3230003000300030003000300030003000300030003000
$j = 7$372.01595.65651.983000300030003000300030003000300030003000
$j = 8$342.15546.09595.42652.32300030003000300030003000300030003000
$j = 9$315.51502.21545.9595.65651.9830003000300030003000300030003000
$j = 10$291.68463.16502.05546.09595.42652.323000300030003000300030003000
$j = 11$270.35428.34463.02502.21545.9595.65651.98300030003000300030003000
$j = 12$251.24397.22428.22463.16502.05546.09595.42652.3230003000300030003000
$j = 13$234.1369.38397.12428.34463.02502.21545.9595.65651.983000300030003000
$j = 14$218.71344.43369.28397.22428.22463.16502.05546.09595.42652.32300030003000
$j = 15$204.89322.05344.35369.38397.12428.34463.02502.21545.9595.65651.9830003000
$j = 16$192.46301.95321.98344.43369.28397.22428.22463.16502.05546.09595.42562.473000
$j = 17$181.28283.88301.88322.05344.35369.38397.12428.34463.02502.21545.9514.333000
$j = 18$171.21267.61283.82301.95321.98344.43369.28397.22428.22463.16502.05472.123000
$j = 19$162.13252.95267.56283.88301.88322.05344.35369.38397.12428.34463.02434.633000

## Appendix C. Repeatable Example

As the examples of this paper are done with the commercial data, the cost parameters are not given in Appendix A. However, in order to enable the repetition of the model, we give the following arbitrary data yielding a similar kind of the schedule for the cost minimization problem than the true data. The values of the cost parameters are:
 $C l i s o f f$ = $( − , 50 , 50 )$ $C e f$ = 350 $C l i s o n$ = $( − , 15 , 10 )$ $C h$ = 200 $C l r$ = $( 40 , − , 40 )$ $C e f o n$ = 200 $C p$ = 100 $C e f c h$ = 6 $C l s t$ = $( 0.001 , 0.0025 , 0.0025 )$ $C l d t$ = $( 0.1 , 0.1 , 0.1 )$ $C l c$ = $( 2 , 2 , 3 )$ $C c t$ = 0.3
and the unit is million €.
For the following result, we use the model in Section 3 as the single-objective problem as in the Section 5.1 with the data in Appendix A together with the above data. The CPU time for this example is 230 s, and we obtain the schedule presented in Figure A2. The objective value i.e., the total costs are 15.885 billion €. The values for other objectives of the multiobjective problem are $f 1 = 1$, $f 2 = 8.393$, $f 3 = 2776.083$, $f 4 = 16$, $f 5 = 12$, $f 6$ = 20,797.288 and $f 7 = 2589.104$.
Figure A2. The schedule for the repeatable example.
Figure A2. The schedule for the repeatable example.

## References

1. Apted, M.J.; Ahn, J. Geological Repository Systems for Safe Disposal of Spent Nuclear Fuels and Radioactive Waste, 2nd ed.; Woodhead Publishing Series in Energy; Woodhead Publishing: Cambridge, UK, 2017. [Google Scholar]
2. Posiva Oy. General Time Schedule for Final Disposal. Available online: http://www.posiva.fi/en/final_disposal/general_time_schedule_for_final_disposal#.XNUcxIpS-Uk (accessed on 10 May 2019).
3. Jaszkiewicz, A.; Slowinski, R. The ‘Light Beam Search’ approach—An overview of methodology applications. Eur. J. Oper. Res. 1999, 113, 300–314. [Google Scholar] [CrossRef]
4. Miettinen, K. Nonlinear Multiobjective Optimization; Kluwer Academic Publishers: Boston, MA, USA, 1999. [Google Scholar]
5. Miettinen, K.; Hakanen, J.; Podkopaev, D. Interactive nonlinear multiobjective optimization methods. In Multiple Criteria Decision Analysis: State of the Art Surveys; Greco, S., Ehrgott, M., Figueira, J.R., Eds.; Springer: New York, NY, USA, 2016; pp. 927–976. [Google Scholar]
6. Montonen, O.; Ranta, T.; Mäkelä, M.M. Planning the Schedule for the Disposal of the Spent Nuclear Fuel with Interactive Multiobjective Optimization. Algorithms 2019, 12, 252. [Google Scholar] [CrossRef]
7. Nakayama, H.; Sawaragi, Y. Satisficing trade-off method for multiobjective programming. In Interactive Decision Analysis; Grauer, M., Wierzbicki, A.P., Eds.; Springer: Berlin/Heidelberg, Germany, 1984; pp. 113–122. [Google Scholar]
8. Vanderpooten, D. The interactive approach in MCDA: A technical framework and some basic conceptions. Math. Comput. Model. 1989, 12, 1213–1220. [Google Scholar] [CrossRef]
9. Wierzbicki, A.P. A mathematical basis for satisficing decision-making. Math. Model. 1982, 3, 391–405. [Google Scholar] [CrossRef]
10. Ranta, T. Optimization in the Final Disposal of Spent Nuclear Fuel. Ph.D. Thesis, Tampere University of Technology, Tampere, Finland, 2012. [Google Scholar]
11. Rautman, C.A.; Reid, R.A.; Ryder, E.E. Scheduling the disposal of nuclear waste material in a geologic repository using the transportation model. Oper. Res. 1993, 41, 459–469. [Google Scholar]
12. Johnson, B.; Newman, A.; King, J. Optimizing high-level nuclear waste disposal within a deep geologic repository. Ann. Oper. Res. 2017, 253, 733–755. [Google Scholar] [CrossRef]
13. Kim, M.S.; Jeon, J.S.; Kim, M.J.; Lee, J.; Lee, S.R. A multi-objective optimization of initial conditions in a radioactive waste repository by numerical thermo-hydro-mechanical modeling. Comput. Geotech. 2019, 114, 103106. [Google Scholar] [CrossRef]
14. Kuopanportti, J.; Lahtinen, T. Applied study on optimizing the final disposal of Loviisa NPP spent fuel assemblies. Kerntechnik 2019, 84, 334–339. [Google Scholar] [CrossRef]
15. Ranta, T.; Cameron, F. Heuristic methods for assigning spent nuclear fuel assemblies to canisters for final disposal. Nucl. Sci. Eng. 2012, 171, 41–51. [Google Scholar] [CrossRef]
16. Vlassopoulos, E.; Volmert, B.; Pautz, A. Logistics optimization code for spent fuel assembly loading into final disposal canisters. Nucl. Eng. Des. 2017, 325, 246–255. [Google Scholar] [CrossRef]
17. Žerovnik, G.; Snoj, L.; Ravnik, M. Optimization of Spent Nuclear Fuel Filling in Canisters for Deep Repository. Nucl. Sci. Eng. 2009, 163, 183–190. [Google Scholar] [CrossRef]
18. Taji, K.; Levy, J.K.; Hartmann, J.; Bell, M.L.; Anderson, R.M.; Hobbs, B.F.; Feglar, T. Identifying potential repositories for radioactive waste: Multiple criteria decision analysis and critical infrastructure systems. Int. J. Crit. Infrastruct. 2005, 1, 404–422. [Google Scholar] [CrossRef]
19. Alumur, S.; Kara, B.Y. A new model for the hazardous waste location-routing problem. Comput. Oper. Res. 2007, 34, 1406–1423. [Google Scholar] [CrossRef]
20. ReVelle, C.; Cohon, J.; Shobrys, D. Simultaneous Siting and Routing in the Disposal of Hazardous Wastes. Transp. Sci. 1991, 25, 138–145. [Google Scholar] [CrossRef]
21. Lappi, P.; Lintunen, J. From Cradle to Grave? On Optimal Nuclear Waste Disposal. Technical Report 20-428, USAEE Working Paper. 2020. Available online: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3519653 (accessed on 1 April 2020).
22. Petersen, G.M. Algorithms and Methods for Optimizing the Spent Nuclear Fuel Allocation Strategy. Ph.D. Thesis, University of Tennessee, Knoxville, TN, USA, 2016. [Google Scholar]
23. Johnson, B.L.; Porter, A.T.; King, J.C.; Newman, A.M. Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle. Ann. Oper. Res. 2019, 275, 393–420. [Google Scholar] [CrossRef]
24. Shugart, N.; Johnson, B.; King, J.; Newman, A. Optimizing Nuclear Material Accounting and Measurement Systems. Nucl. Technol. 2018, 204, 260–282. [Google Scholar] [CrossRef]
25. Tosoni, E.; Salo, A.; Govaerts, J.; Zio, E. Comprehensiveness of scenarios in the safety assessment of nuclear waste repositories. Reliab. Eng. Syst. Saf. 2019, 188, 561–573. [Google Scholar] [CrossRef]
26. Official Statistics of Finland (OSF). Production of Electricity and Heat. ISSN 1798-5099. Available online: https://www.stat.fi/til/salatuo/index_en.html (accessed on 11 December 2019).
27. STUK. Regulatory Guides on Nuclear Safety and Security (YVL). Available online: https://www.stuk.fi/web/en/regulations/stuk-s-regulatory-guides/regulatory-guides-on-nuclear-safety-yvl- (accessed on 18 December 2019).
28. Ikonen, K.; Kuutti, J.; Raiko, H. Thermal Dimensioning for the Olkiluoto Repository—2018 Update. Technical Report 26, Posiva Working Report. 2018. Available online: http://www.posiva.fi/files/4973/WR_2018-26_web.pdf (accessed on 1 April 2020).
29. Posiva Oy. Safety Case for the Disposal of Spent Nuclear Fuel at Olkiluoto—Synthesis 2012, POSIVA 2012-12; Posiva Oy: Eurajoki, Finland, 2012; Available online: https://inis.iaea.org/search/search.aspx?orig_q=RN:44091445 (accessed on 1 April 2020).
30. Posiva Oy and SKB. Safety Functions, Performance Targets and Technical Design Requirements for a KBS-3V Repository, Posiva SKB Report 01; Swedish Nuclear Fuel and Waste Management Co.: Stockholm, Sweden, 2017. [Google Scholar]
31. Posiva Oy. Image Gallery. Available online: http://posiva.fi/en/media/image_gallery?gfid_2061=92#gallery_2061 (accessed on 18 March 2020).
32. Raiko, H. Canister Design 2012; Technical Report 13, Posiva Working Report; Posiva Oy: Eurajoki, Finland, 2012. [Google Scholar]
33. Huttunen, J.A.S. Teollisuuden Voima Oyj, Olkiluoto, 27160 Eurajoki, Finland. Personal Communication, 2020. [Google Scholar]
34. Ministry of Economic Affairs and Employment of Finland. Nuclear Facilities Include Nuclear Power Plants and Facilities For Nuclear Waste Management. Available online: https://tem.fi/en/nuclear-facilities-and-projects (accessed on 18 December 2019).
35. Wierzbicki, A.P. Basic properties of scalarizing functionals for multiobjective optimization. Optimization 1977, 8, 55–60. [Google Scholar]
36. Buchanan, J.T. A naive approach for solving MCDM problems: The GUESS method. J. Oper. Res. Soc. 1997, 48, 202–206. [Google Scholar] [CrossRef]
37. Wilppu, O.; Mäkelä, M.M.; Nikulin, Y. New two-slope parameterized achievement scalarizing functions for nonlinear multiobjective optimization. In Operations Research, Engineering, and Cyber Security; Optimization and Its Applications; Daras, N.J., Rassias, T.M., Eds.; Springer: Cham/Heidelberg, Germany, 2017; Volume 113, pp. 403–422. [Google Scholar]
38. Nikulin, Y.; Miettinen, K.; Mäkelä, M.M. A new achievement scalarizing function based on parameterization in multiobjective optimization. OR Spectrum 2012, 34, 69–87. [Google Scholar] [CrossRef]
39. Luque, M.; Miettinen, K.; Ruiz, A.B.; Ruiz, F. A two-slope achievement scalarizing dunction for interactive multiobjective optimization. Comput. Oper. Res. 2012, 39, 1673–1681. [Google Scholar] [CrossRef]
40. Désidéri, J.A. Multiple-gradient descent algorithm (MGDA) for multiobjective optimization. Compte Rendus De L’Académie Des Sci. Ser. I 2012, 350, 313–318. [Google Scholar] [CrossRef]
41. Mäkelä, M.M.; Karmitsa, N.; Wilppu, O. Proximal Bundle Method for Nonsmooth and Nonconvex Multiobjective Optimization. In Mathematical Modeling and Optimization of Complex Structures; Computational Methods in Applied Sciences; Tuovinen, T., Repin, S., Neittaanmäki, P., Eds.; Springer: Heidelberg, Germany, 2016; Volume 40, pp. 191–204. [Google Scholar]
42. Montonen, O.; Karmitsa, N.; Mäkelä, M.M. Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization. Optimization 2018, 67, 139–158. [Google Scholar] [CrossRef]
43. Montonen, O.; Joki, K. Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints. J. Glob. Optim. 2018, 72, 403–429. [Google Scholar] [CrossRef]
44. Qu, S.; Liu, C.; Goh, M.; Li, Y.; Ji, Y. Nonsmooth multiobjective programming with quasi-Newton methods. Eur. J. Oper. Res. 2014, 235, 503–510. [Google Scholar] [CrossRef]
45. Achterberg, T.; Berthold, T.; Koch, T.; Wolter, K. Constraint integer programming: A new approach to integrate CP and MIP. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems; Perron, L., Trick, M.A., Eds.; Springer: Berlin/Heidelberg, Germany, 2008; pp. 6–20. [Google Scholar]
46. Achterberg, T. SCIP: Solving constraint integer programs. Math. Program. Comput. 2009, 1, 1–41. [Google Scholar] [CrossRef]
47. Vigerske, S.; Gleixner, A. SCIP: Global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 2018, 33, 563–593. [Google Scholar] [CrossRef]
48. GAMS Development Corporation. General Algebraic Modeling System (GAMS) Release 26.1.0; GAMS Development Corporation: Washington, DC, USA. Available online: http://www.gams.com/ (accessed on 1 April 2020).
Figure 1. Multiple release barriers of the KBS-3 concept—Posiva Oy [31].
Figure 1. Multiple release barriers of the KBS-3 concept—Posiva Oy [31].
Figure 2. Operation history and forecasts of reactors and properties of the spent nuclear fuel [33].
Figure 2. Operation history and forecasts of reactors and properties of the spent nuclear fuel [33].
Figure 3. The schematic layout of the disposal facility—Posiva Oy [31].
Figure 3. The schematic layout of the disposal facility—Posiva Oy [31].
Figure 4. Results for the single-objective problems.
Figure 4. Results for the single-objective problems.
Figure 5. Results for the iteration 1.
Figure 5. Results for the iteration 1.
Figure 6. Results for iteration 2.
Figure 6. Results for iteration 2.
Figure 7. Results for iteration 3.
Figure 7. Results for iteration 3.
Figure 8. Result having increasing production.
Figure 8. Result having increasing production.
Figure 9. Result without hiatus.
Figure 9. Result without hiatus.