Next Article in Journal
Socio-Economic Benefits in Community Energy Structures
Previous Article in Journal
The Coal, Petroleum, and Gas Embedded in the Sectoral Demand-and-Supply Chain: Evidence from China
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Stochastic Optimization Model for Sustainable Multimodal Transportation for Bioenergy Production

Korea Railroad Research Institute, Uiwang-si 16105, Gyeonggi-do, Korea
*
Author to whom correspondence should be addressed.
Sustainability 2022, 14(3), 1889; https://doi.org/10.3390/su14031889
Submission received: 2 December 2021 / Revised: 21 January 2022 / Accepted: 2 February 2022 / Published: 7 February 2022
(This article belongs to the Special Issue Woody Biomass Power Generation and Sustainable Energy Development)

Abstract

:
While many previous studies have suggested well-defined procedures to find appropriate supply chains, a limited number of studies have been conducted with uncertain values relating to transportation costs. Most of these have included only limited detail on multimodal transportation, or have not considered economic, social, and environmental transportation cost factors together. The main purpose of this study is to suggest a multi-objective stochastic model for sustainable biomass transportation, and to identify the impact level of model selection on the transportation mode. It begins with a deterministic formulation of sustainable transportation, which is then modified to a stochastic problem with vectorization of cost parameters. Based on the model developed, we examined four uncertainty cases from a combination of annual capacity and average distance of biomass transportation. The experimental results provide more cost savings from multimodal transportation, which can be identified if we analyze transportation costs with stochastic modeling. Regarding short-distance plant cases, the study reveals that the impact of the utilization of stochastic methods is insignificant, as the costs savings from multimodal transportation is trivial. Other findings from the experiments show that multimodal transportation could provide cost savings in the economic cost factor, except in the case of low annual capacity and short average distance.

1. Introduction

While bioenergy has received increased attention as a potential replacement for fossil fuels in energy production, the share of US energy generated by biomass has remained the same over the last decade. This is because the implementation of bioenergy can increase only if it can be justified from an economic, environmental and social perspective. One of the critical aspects required to increase its usage is cost-effective transportation. Transportation is critical to bioenergy production, as the intrinsic characteristics of biomass cause transportation to account for a high proportion of costs in the overall biomass supply chain. This also makes transportation an important area of study in terms of the bioenergy supply chain.
Biomass transportation research commonly includes modeling approaches, both in the form of optimization and simulation. Optimization methods, sometimes called analytical tools, commonly use data processing through mathematical equations or algebraic expressions. Most optimization models have used a deterministic mathematical programming approach [1,2,3,4]. For example, Devlin and Talbot (2014) [3] used a linear programming approach to analyze transportation strategies for optimal woody biomass allocation to meet the co-firing targets of Ireland. Similarly, Sosa et al. (2015) [4] developed a linear programming model to analyze the optimal wood supply of short wood for the peat-based electricity sector that minimized harvesting, storage, chipping and transportation costs, while also considering competition with existing wood-based panel industries. Recently, stochastic programming models have been suggested to overcome these uncertainties [5,6,7]. For instance, Osmani and Zhang (2014) [5] proposed a stochastic programming model which sought to optimally balance supply from wind and biomass resources considering regional electricity demand and uncertainties in wind speed. While several other researchers have also chosen a mathematical programming approach to address uncertain parameters, most studies account for the energy price [5,8], market demand [9], and feedstock supply quantities [7] as uncertain parameters. A limited number of studies have been conducted with uncertain values relating to transportation costs. Kim et al. (2011) [10] have tried to figure out the impact of several uncertain parameters, including transportation cost, to reduce the design problem to a manageable size. However, they suggested a robustness and global sensitivity analysis using Monte Carlo simulation, rather than the stochastic optimization model. Thus, this study seeks to determine the impact on the complete transportation costs while considering uncertainty parameters.
When it comes to the mode of biomass transportation, most previous papers considered only a single mode of transport, the truck [11,12,13,14], as trucks are the dominant mode of biomass transportation. Rail transportation possesses unavoidable shortcomings due to limited accessibility and specific infrastructure needs, such as track, terminals, rail sidings, and transload facilities/equipment, but does become economically attractive with higher volumes and/or distances. Especially in the case of a large capacity bioenergy plant, interest in multimodal transportation using truck and rail may increase as well, since biomass utilization economics are sensitive to mobilization costs and hauling distances to markets [15]. Also, inclusion of external cost factors such as social and environmental costs escalate the share of rail shipments to minimize total sustainable transportation costs [16]. A study by Kumar et al. (2006) [17] also suggests the importance of multimodal transportation by determining the ranking of alternatives for biomass transportation systems while considering economic, social, environmental, and technical factors. The study found rail was the best alternative, followed by truck and pipeline for large capacity bioenergy production.
In this paper, the general integer linear/nonlinear programming models for a simple biomass transportation network for single and multimodal transportation scenarios is formulated. The main purposes of this study are to suggest the multi-objective stochastic model for sustainable biomass transportation system, and to identify the impact level of model selection (deterministic and stochastic) on a transportation mode (single and multimodal transportation). The study begins with a deterministic formulation of sustainable transportation which considers economic, social, and environmental cost factors. Then it is modified to a stochastic problem with vectorization of cost parameters. Four uncertainty scenarios are developed from different combinations of annual capacity and average distance of biomass transportation and then examined based on the developed stochastic model of biomass transportation.

2. Materials and Methods

The objective of this study is to develop a stochastic model of multimodal biomass transportation considering external cost factors. This model is considered to have three decision variables in terms of the mode of biomass transportation: X, Y, and Z. Xi indicates the number of trucks shipped long distance between supply area “i” and the conversion plant. In the same way, the number of trucks shipped short distance between supply area “i” to rail siding is expressed by Yi. Lastly, Z indicates the number of unit trains from rail siding to the conversion plant. Since it is assumed in this study that the total number of cars in a unit train is 50, the tonnage of biomass feedstock which this unit train can transport at once is 5000 tons, while each truck has a 28-ton capacity. Total time lag in this model is a year (365 days).
Unlike a typical single mode transportation system, the inclusion of a new transportation mode “rail” is considered for shipping biomass feedstock. Since multimodal transportation definitely needs to have intermediate facilities for loading and unloading between trucks and rail, the storage parameter “a” is added to the model which indicates the installment costs of storage facility rail siding. In this perspective of multimodal transportation, trans-loading cost factors should also be considered as new critical parameters. The variable “l” and “u” are used to indicate transfer costs for loading and unloading work in rail siding. In addition, since it takes such a long time to load feedstock on to the railcar of a unit train, the strategy of leasing used rail cars was selected to minimize demurrage costs in rail siding. While tank car leasing is prevalent in the market of rail car leasing [18], the leasing rate for grain hopper cars is used as an annual unit cost for rail transportation.
Meanwhile, two kinds of social factors are considered for sustainable biomass transportation: traffic congestions and accident risks. The Government Accountability Office (GAO) [19] conducted a comparative method for the external costs of road, rail, and waterways freight shipments which are not passed on to consumers. They suggested some categories for external cost factors of road and rail which are calculated from the trucking-to-rail ratio in terms of fatalities and cost of delay per ton-miles. In terms of environmental costs, the price of CO2 emissions, particulate matter (PM), and NOx are also considered. Therefore, in this research, we also used the same parameters as non-economic sustainable factors. The summarized explanations about decision variables and parameters for this model are described in Table 1.

2.1. Step 1: Define a Deterministic Formulation of Sustainable Transportation Model

The mathematical formulation of the problem in this study can be expressed as shown below:
MIN
    w 1 i = 1 I ( C i X × X i ) + C i Y × Y i + C r × Z + a × K + w 2 i = 1 I R i X × X i + R i Y × Y i + R r × Z + w 3 i = 1 I E i X × X i + E i Y × Y i + E R × Z
S.T.
t X × X i + t Y × Y i   Q i                       i     I  
t X × X i + t Z × Z     O p                     i     I  
i = 1 I t Y × Y i = t Z × Z                         i     I
Z       K × M                                   K     0 ,   1
X i ,     Y i ,     Z = P o s i t i v e   I n t e g e r                   i I
M = Big positive constant
where
C i X = D i X × c i X × t X       i     I
C i Y = D i Y × c i Y + u × t Y               i     I
C r = D r × c r + l × t Z
R i X = D i X × γ i X + δ i X × t X             i     I
R i Y = D i Y × γ i Y + δ i Y × t Y                   i     I
R r = D r × γ r + δ r × t Z
E i X = D i X × e c X + e p X + e n X × t X       i     I
E i Y = D i Y × e c Y + e p Y + e n Y × t Y             i     I
E r = D r × e c r + e p r + e n r × t Z
The first constraint (1) indicates weekly quantitative limitation in collecting areas of biomass feedstock. The second constraint (2) means the minimum quantities of supply to meet market demands required for this plant. The next constraint (3) identifies all quantities of biomass feedstock, from collecting areas not used by direct truck shipping, that should be equal to the total sum of quantities shipped to plants by rail. Finally, constraint (4) relates to the cost of a rail car lease. The dummy variable “K” expresses the idea that the annual cost of a rail car lease would occur only if a rail transportation option existed for this problem. In other words, the value of K is 0 if the value of Z is 0, otherwise the value of K is 1. M is the big positive constant (Big M). In this study, it is assumed that the daily demurrage cost in rail siding and operation costs for storage facilities are not needed, because 50 rail cars are leased by the shipper and these cars are able to function as storage, as well as hauling by locomotive.

2.2. Step 2: Modification to Stochastic Problem with Vectorization

It will be convenient to work with the following compact notation for aforementioned model:
MIN
w 1 C X T ξ X + C Y T ξ Y + C Z ξ Z + a ξ K + w 2 R X T ξ X + R Y T ξ Y + R Z ξ Z + w 3 E X T ξ X + E Y T ξ Y + E Z ξ Z
S.T.
t X X + t Y Y Q ξ
t X X + t Z Z     O ξ
t Y Y = t Z Z
Z       K × M                                   K     0 ,   1
X i ,     Y i ,     Z = P o s i t i v e   I n t e g e r                   i I
M = Big positive constant
Where ,   C X T ξ = D X T × c X T ξ × t X
C Y T ξ = D Y T × c Y T ξ + u ξ × t Y
C Z ξ = D Z × c Z ξ + l ξ × t Z
R X T ξ = D X T × γ X ξ + δ X ξ × t X
R Y T ξ = D Y T × γ Y ξ + δ Y ξ × t Y
R Z ξ = D Z × γ Z ξ + δ Z ξ × t Z
E X T ξ = D X T × e c X ξ + e p X ξ + e n X ξ × t X
E Y T ξ = D Y T × e c Y ξ + e p Y ξ + e n Y ξ × t Y
E Z ξ = D Z × e c Z ξ + e p Z ξ + e n Z ξ × t Z
In this paper, a stochastic program is proposed that considers random vectors of economic, social, and environmental cost factors, as well as total quantities and demands constraints. In other words, it considers ξ = ( C X ,   C Y ,   C Z ,   C K ,   R X ,   R Y , R Z , E X ,   E Y ,   E Z ,   Q ,   O ,   a ) as uncertain factors.
The objective function of the aforementioned linear program can be disassembled into several random vectors as follows:
= w 1 C X 1 ξ X 1 + C X 2 ξ X 2 + + C X n ξ X n + C Y 1 ξ Y 1 + C Y 2 ξ Y 2 + + C Y n ξ Y n + C Z ξ Z + a ξ K
+ w 2 R X 1 ξ X 1 + R X 2 ξ X 2 + + R X n ξ X n + R Y 1 ξ Y 1 + R Y 2 ξ Y 2 + + R Y n ξ Y n + R Z ξ Z
+ w 3 E X 1 ξ X 1 + E X 2 ξ X 2 + + E X n ξ X n + E Y 1 ξ Y 1 + E Y 2 ξ Y 2 + + E Y n ξ Y n + E Z ξ Z
Meanwhile, if V is a vector that is consisted with a set of decision variables V = {X, Y, Z, K}, the first and second constraints (which includes the stochastic parameter) can be expressed as follows:
t X X 1 X 2 X n + t Y Y 1 Y 2 Y n Q 1 ξ Q 2 ξ Q n ξ
t X t X t X X 1 X 2 X n + t z Z O ξ
A T V B ξ 0
where A T is a deterministic coefficient vector and B(ξ) is random vectors defined as right-hand side values in constraint functions, respectively.
If we change Equation (5) to F(ξ)V, this deterministic optimization program can be a multi-objective stochastic linear program, which is a problem of the following type:
MIN         F ξ V
S . T .         V D ξ
D ξ = V R n   : A T V B ξ 0
t Y Y = t Z Z  
Z       K × M
V = X i ,   Y i ,   Z ,   K = P o s i t i v e   I n t e g e r                   i I ,     K     0 ,   1
M = Big positive constant
where F(ξ) = {C(ξ), R(ξ), E(ξ), a(ξ)} is a set of random vectors defined on a probability space (Ω, F, P). That is, it is assumed that the original three objective functions are aggregated in the form of F(ξ) × V. Based on Kampempe and Luhandjula (2012) [20]’s approach, we can say that V* R n is an (α, β)-satisfying solution to the problem if (V*, s*) is optimal for the following optimization problem:
MIN s
S . T .             P [ F ξ V   s ]     β
P [ A T V B ξ 0 ]     α
t Y Y = t Z Z
Z       K × M
V = X i ,   Y i ,   Z ,   K = P o s i t i v e   I n t e g e r                   i I ,     K     0 ,   1
M = Big positive constant
where α = ( 1 ,   m ) with i 0 ,   1 and β i 0 ,   1 are probability levels a priori fixed by the decision maker.
One of the most important aspects of the conceptual background in this approach is that it tried to find a solution that satisfied non-deterministic conditions rather than finding an optimal goal clearly.
From now on, this form will be changed into another expression which leads us to solve this problem easily. See Kampempe and Luhandjula (2012) [20] to review the detailed process of the transformation.
It must be assumed that all random vectors F(ξ) = {C(ξ), R(ξ), E(ξ), a(ξ)} are independent and normally distributed. This requirement indicates that our economic, social, and environmental cost factors from three objective functions are independent to each other. Suppose also that right-hand side value B(ξ) is independent and normally distributed. This means we assume the constraint of feedstock quantities from supply areas are independent to the demand constraint of the processing plant.
Then, the first constraint of the transformed model (6) can be expressed as:
P ( F ξ V 0 )
= P F ξ V   E F ξ V Var F ξ V   s     E F ξ V Var F ξ V
= Φ s     E F ξ V Var F ξ V
where Φ x = 1 2 π x e y 2 / 2 d y . Because, F ξ V   E F ξ V Var F ξ V is normally distributed with mean 0 and variance 1. Therefore, the first constraint of this transformed model (6) becomes as follows:
Φ s     E F ξ V Var F ξ V     β
That is,
s     E F ξ V Var F ξ V     Φ 1 ( β )
which is equivalent to:
E F ξ V + Φ 1 ( β )   Var F ξ V
Meanwhile, the second constraint transformed model (6) can also be established in a new formulation using the same method. Let random vector
G ξ = A T V B ξ
and G(ξ) is independent and normally distributed too. The expected value of G(ξ) is
E G ξ = A T V E B ξ
and its variance is as follows:
Var G ξ = Var B ξ
Then, second constraint of transformed model (5) can also be expressed as
P   ( G ξ 0 )
= G ξ   E G ξ Var G ξ     E G ξ Var G ξ
= Φ   E G ξ Var G ξ
where Φ x = 1 2 π x e y 2 / 2 d y . Therefore, the second constraint of this transformed model (6) becomes Φ   E G ξ Var G ξ     α . That is   E G ξ Var G ξ     Φ 1 ( α ) which is equivalent to:
E G ξ + Φ 1 ( α ) Var ( G ξ 0 .
We can replace E G ξ and Var G ξ by their values given by (8) and (9), then we obtain
A T V E B ξ + Φ 1 ( α ) Var B ξ 0
With combining Equations (7) and (10), we can finally get a transformed optimization model considering stochastic variables as follows:
MIN      s
S . T .                 E F ξ V + Φ 1 ( β )   Var F ξ V s
A T V E B ξ + Φ 1 ( α ) Var B ξ 0
t Y Y = t Z Z
Z       K × M
V = X i ,   Y i ,   Z ,   K = P o s i t i v e   I n t e g e r                   i I ,     K     0 ,   1
M = Big positive constant
The expected value and variance of F(ξ)V in formulation (11) can be developed as follows: (The rest of detail calculation about transformations of the first constraint are described in Appendix A).
E F ξ V = w 1 [ d X 1 t X 1 E ( c X ξ ) X 1 + d X 2 t X 2 E ( c X ξ ) X 2 + + d X n t X n E ( c X ξ ) X n + { d Y 1 E ( c Y ξ ) + E u ξ } t Y 1 Y 1 + { d Y 2 E ( c Y ξ ) + E u ξ } t Y 2 Y 2 + + { d Y n E ( c Y ξ ) + E u ξ } t Y n Y n + { d Z E ( c Z ξ + E l ξ } t Z Z + E a ξ K ]
+ w 2 [ d X 1 t X 1 { E ( γ X ξ ) + E ( δ X ξ ) } X 1 + d X 2 t X 2 { E ( γ X ξ ) + E ( δ X ξ ) } X 2 + + d X n t X n { E ( γ X ξ ) + E ( δ X ξ ) } X n + d Y 1 t Y 1 { E ( γ Y ξ ) + E ( δ Y ξ ) } Y 1 + d Y 2 t Y 2 { E ( γ Y ξ ) + E ( δ Y ξ ) } Y 2 + + d Y n t Y n { E ( γ Y ξ ) + E ( δ Y ξ ) } Y n + d Z t Z { E ( γ Z ξ ) + E ( δ Z ξ ) } Z ]
+ w 3 [ d X 1 t X 1 E e X C ξ + E e X P ξ + E e X N ξ X 1 + d X 2 t X 2 E e X C ξ + E e X P ξ + E e X N ξ X 2 + + d X n t X n E e X C ξ + E e X P ξ + E e X N ξ X n + d Y 1 t Y 1 { E e Y C ξ + E e Y P ξ + E e Y N ξ } Y 1 + d Y 2 t Y 2 E e Y C ξ + E e Y P ξ + E e Y N ξ Y 2 + + d Y n t Y n { E e Y C ξ + E e Y P ξ + E e Y N ξ } Y n + d Z t Z E e Z C ξ + E e Z P ξ + E e Z N ξ Z ]
V a r F ξ V = w 1 2 [ { d X 1 2 t X 1 2 V a r ( c X ξ ) X 1 2 + d X 2 2 t X 2 2 V a r ( c X ξ ) X 2 2 + + d X n 2 t X n 2 V a r ( c X ξ ) X n 2 + { d Y 1 2 V a r ( c Y ξ ) + V a r u ξ } t Y 1 2 Y 1 2 + { d Y 2 2 V a r ( c Y ξ ) + V a r u ξ } t Y 2 2 Y 2 2 + + { d Y n 2 V a r ( c Y ξ ) + V a r u ξ } t Y n 2 Y n 2 + { d Z 2 V a r ( c Z ξ + V a r l ξ } t Z 2 Z 2 + V a r a ξ K 2 } ]
+ w 2 2 [ { d X 1 2 t X 1 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X 1 2 + d X 2 2 t X 2 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X 2 2 + + d X n 2 t X n 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X n 2 + d Y 1 2 t Y 1 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y 1 2 + d Y 2 2 t Y 2 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y 2 2 + + d Y n 2 t Y n 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y n 2 + d Z 2 t Z 2 { V a r ( γ Z ξ ) + V a r ( δ Z ξ ) } Z 2 } ]
+ w 3 2 [ { d X 1 2 t X 1 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X 1 2 + d X 2 2 t X 2 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X 2 2 + + d X n 2 t X n 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X n 2 + d Y 1 2 t Y 1 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y 1 2 + d Y 2 2 t Y 2 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y 2 2 + + d Y n 2 t Y n 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y n 2 + d Z 2 t Z 2 { V a r e Z C ξ + V a r e Z P ξ + V a r e Z N ξ } Z 2 } ]

2.3. Numerical Example: 4 Cases

As shown in Figure 1, a total of 187 bio-electricity plants currently use woody biomass in a form of woods solids (WDS) as a plant primary fuel in the US. In terms of plant nameplate capacity, the annual capacity of 75% of the 187 plants is less than 47 MW [21]. As seen in Figure 1, most of the bio-electricity plants using wood solids do not currently need high quantities of woody feedstock. The average capacity of all these plants is 37 MW. Considering a typical case of biomass plants, less than 500,000 tons of woody feedstocks are procured from collecting areas to produce about 50 MW capacity annually.
In this study, 60% and 99% percent of a plant’s capacity were considered as target example cases. Plants at these percentile capacities normally need about 350,000 and 1,200,000 tons of annual woody biomass, respectively.
Meanwhile, the average procurement distance for biomass feedstock is also a critical criterion to classify bio-electricity plants. The breakpoints of economic distance for each mode of transportation are presented variously in previous studies as shown in Table 2.
In this study, we selected 75 miles (120 km) and 150 miles (240 km) as average distance criteria for procurement, considering a marginal economic distance of the trucking system for forest and woody biomass. A numerical analysis is then possible for a total of four different cases using two conditions for classification: annual capacity of feedstock and average procurement distance, as follows:
  • Case A: Low annual capacity and Short procurement distance for feedstock;
  • Case B: High annual capacity and Short procurement distance for feedstock;
  • Case C: Low annual capacity and Long procurement distance for feedstock;
  • Case D: High annual capacity and Long procurement distance for feedstock.
Table 3 indicates these example cases of four strategies for bio-electricity plants in this study.
The next step is to relate the identification of input sources to their values used in this sustainable biomass transportation model. Since most of the data under basic conditions are case-specific, such as the kind of mode type that is possible to use and the number of conversion plants or collecting areas, operational data need to be assumed based on the four different cases above. The values of three sustainable factors are mainly utilized from previous research which suggested some pertinent rules of thumb and empirical data with regards to biomass transportation. Table 4 presents the list of input data for four example cases with uncertainty. Note that it is assumed there are three areas to collect biomass feedstocks. In all cases, it is also assumed that a quantity of each market demand is covered with their processing quantities from each collecting area. All uncertain parameters ξ = ( C X ,   C Y ,   C Z ,   C K ,   R X ,   R Y , R Z , E X ,   E Y ,   E Z ,   Q ,   O ,   a ) are regarded as independent of each other, as well as normally distributed
Note that available estimates used different methods and assumptions for determining the average of each factor, and variations are also assumed by the authors. Unit costs per tonnage for hauling and transloading are based on previous studies [16,17,18]. For social cost factors, we selected traffic congestion and accident risk from the research of the US Governmental Accountability Office (GAO) [19]. The environmental cost factors are based on air emissions (GHG, PM, and NOx) from feedstock transportation by truck and rail [16].
If the decision maker is interested in a satisfying solution with α = 0.99 and β = 0.99 for all cases, then it is possible to solve the following problem by using the stochastic optimization model (11). For example, Case A would be transformed to non-linear integer program as follows:
MIN
((w1 × 55 × 28 × 0.224) + (w2 × 55 × 28 × (0.0066 + 0.0166)) + (w3 × 55 × 28 × (0.0071 + 0.0071 + 0.0022))) × X1 +
((w1 × 75 × 28 × 0.224) + (w2 × 75 × 28 × (0.0066 + 0.0166)) + (w3 × 75 × 28 × (0.0071 + 0.0071 + 0.0022))) × X2 +
((w1 × 95 × 28 × 0.224) + (w2 × 95 × 28 × (0.0066 + 0.0166)) + (w3 × 95 × 28 × (0.0071 + 0.0071 + 0.0022))) × X3 +
(w1 × ((10 × 28 × 0.224) + (28 × 4.8)) + w2 × (10 × 28 × (0.0066 + 0.0166)) + w3 × ((10 × 28 × (0.0071 + 0.0071 + 0.0022)))) × Y1 +
(w1 × ((20 × 28 × 0.224) + (28 × 4.8)) + w2 × (20 × 28 × (0.0066 + 0.0166)) + w3 × ((20 × 28 × (0.0071 + 0.0071 + 0.0022)))) × Y2 +
(w1 × ((30 × 28 × 0.224) + (28 × 4.8)) + w2 × (30 × 28 × (0.0066 + 0.0166)) + w3 × ((30 × 28 × (0.0071 + 0.0071 + 0.0022)))) × Y3 +
(w1 × ((60 × 5000 × 0.048) + (5000 × 4.8)) + w2 × (60 × 5000 × (0.00015 + 0.00018)) + w3 × ((60 × 5000 × (0.0019 + 0.0019 + 0.0005)))) × Z +
(w1 × 4800 × K) +
2.33 × (((w1^2 × 55^2 × 28^2 × 0.01) + (w2^2 × 55^2 × 28^2 × (0.2 + 2)) + (w3^2 × 55^2 × 28^2 × (0.5 + 0.5 + 0.5))) × X1^2 +
((w1^2 × 75^2 × 28^2 × 0.01) + (w2^2 × 75^2 × 28^2 × (0.2 + 2)) + (w3^2 × 75^2 × 28^2 × (0.5 + 0.5 + 0.5))) × X2^2 +
((w1^2 × 95^2 × 28^2 × 0.01) + (w2^2 × 95^2 × 28^2 × (0.2 + 2)) + (w3^2 × 95^2 × 28^2 × (0.5 + 0.5 + 0.5))) × X3^2 +
(w1^2 × ((10^2 × 28^2 × 0.01) + (28^2 × 0.4)) + (w2^2 × 10^2 × 28^2 × (0.2 + 2)) + (w3^2 × 10^2 × 28^2 × (0.5 + 0.5 + 0.5))) × Y1^2 +
(w1^2 × ((20^2 × 28^2 × 0.01) + (28^2 × 0.4)) + (w2^2 × 20^2 × 28^2 × (0.2 + 2)) + (w3^2 × 20^2 × 28^2 × (0.5 + 0.5 + 0.5))) × Y2^2 +
(w1^2 × ((30^2 × 28^2 × 0.01) + (28^2 × 0.4)) + (w2^2 × 30^2 × 28^2 × (0.2 + 2)) + (w3^2 × 30^2 × 28^2 × (0.5 + 0.5 + 0.5))) × Y3^2 +
((w1^2 × (60^2 × 5000^2 × 0.001) + (5000^2 × 0.4)) + (w2^2 × 60^2 × 5000^2 × (0.1 + 0.5)) + (w3^2 × 60^2 × 5000^2 × (2 + 2 + 1))) × Z^2 +
100 × K^2)^0.5;
S.T.
[R1] (28 × X1) + (28 × Y1) − 300,000 + (2.33 × 10,000^0.5) <= 0;
[R2] (28 × X2) + (28 × Y2) − 400,000 + (2.33 × 50,000^0.5) <= 0;
[R3] (28 × X3) + (28 × Y3) − 700,000 + (2.33 × 200,000^0.5) <= 0;
[R4] (28 × X1) + (28 × X2) + (28 × X3) + (5000 × Z) − 350,000 + (2.33 × 1000^0.5) >= 0;
[R5] (28 × Y1) + (28 × Y2) + (28 × Y3) = (5000 × Z;
[R6] Z <= K × 10,000,000;
V = X i ,   Y i ,   Z ,   K = P o s i t i v e   I n t e g e r                   i I ,     K     0 ,   1

3. Results and Discussions

The mathematical model was applied to the four numerical examples described in Table 4. In all cases, the analysis was conducted with four combinations in terms of orientation of sustainable factors: (1) economic only, (2) economic and social oriented, (3) economic and environmental oriented, and (4) economic, social, and environmental oriented. Each combination can be controlled by weighting factors w 1 (Economic), w 2 (Social), and w 3 (Environmental). When external costs (social cost and environmental cost) are fully considered, weighting factors w 1 = w 2 = w 3 = 1. If we calculate the transportation cost excluding the external costs, weighting factor w 1 = 1 and w 2 = w 3 = 0. Figure 2 presents the results of the optimization problem for four cases which are combined with deterministic and stochastic analyses. For all cases, we compared the cost difference between single mode (truck only) and multimodal (truck and rail) biomass transportation.
This figure also suggests the different results of optimized annual number of truck and rail hauling, as well as minimized transportation costs regarding four different cases in perspective of annual capacity and procurement distance options.
According to this result, the optimized cost of biomass transportation considering the economic factor only is generally less than when under consideration of other sustainable factors. The trend of increasing costs, however, is various for each case. Particularly for the case of multi modal with stochastic analysis for Case D (D_S_M in Figure 2), the optimized cost is highest when we only consider economic factors. This may be related to the findings of Ko et al. (2016) that external costs of transportation are strongly associated with distance and tonnage [16]. In other words, shipments using rail can significantly decrease the external costs in cases where high volume is transported for long distance between origins and destinations.
Figure 3 describes the cost savings between single and multimodal transportation for each case. Along with increased distance and volume, cost savings from utilizing multimodal transportation increase for all scenarios. The results indicate that inclusion of external transportation costs and growth of plant capacity both escalate the share of rail shipments while trying to minimize total transportation costs.
We found that more cost savings from multimodal transportation can be identified if we analyze transportation costs with stochastic modeling. This effect is more remarkable when the bioenergy plant is located far from the biomass collecting site (Case C and D). In the case of short-distance cases (Case A and B), it reveals that the impact of utilization of stochastic methods is insignificant, as the costs savings from multimodal transportation is trivial.
In general, most industries are interested in optimization costs in the economic perspective only. Figure 4 shows the optimized transportation costs when we regard economic parameters as the only sustainable factor. Note that experimental results from the deterministic approach (blue color) is distinguished with the results from the stochastic model (orange color) by their colors. In most cases, it shows that multimodal transportation could provide cost savings in the economic cost factor, except in the case of A (low annual capacity and short procurement distance for feedstock). In particular, if we analyze this problem with uncertainty, the cost increases instead (in A_S_M). We surmise that this result may arise since the economic benefit of multimodal transportation cannot cover the variance of increased parameters. When it comes to the effect of the stochastic method, there is also no great difference in optimized costs with deterministic analysis in all cases. Strange as it may seem, it is understandable because these cost gaps are covered with other combinations of transportation modes. In other words, selecting the stochastic method has more significant effects on the modal share than on the whole economic costs savings.
Figure 5, which shows the annual number of rail shipping for each multimodal case, can support this assumption. It can be seen that rail transportation can be used in various cases as a multimodal option for the achievement of optimized costs. This means the modal share between truck and rail varies for each case. The result of Case A reveals an interesting point: that the need for rail shipment arises when the analysis is conducted by stochastic approach, while other cases show reversed patterns. If we compare the results between Figure 3 and Figure 5, we can see the number of rail shipments in Case B is much higher than Case C, though the cost savings of Case B are lower than Case C. This means that the increase of rail shipments does not lead to an increase in cost savings. Thus, it can be concluded that the distance between plant and biomass collecting sites is a more significant factor which affects the benefit of multimodal transportation with rail compared to the capacity of bioenergy plants. Figure 5 also indicates that there would be very little chance of rail shipments for Case A_D_M. This is evident from a previous study [16] that found that direct truck haulage dominates shipment scenarios that cover short distances with small-capacities, as delivery by rail is selected only for large-capacity scenarios.

4. Conclusions

This study investigates transportation costs when using biomass feedstock for electricity plants. More specifically, it attempts to identify and minimize transportation costs, using either single or multimodal transportation. The analysis was conducted through deterministic and stochastic mathematical models that minimize transportation costs, including economic and/or external costs.
The models were tested with four cases classified in terms of a bioenergy plant’s annual capacity and the average distance between biomass collecting sites and the plant. The experimental results show that while the optimized costs of biomass transportation that consider only economic factors is generally less than when under consideration for other sustainable factors, the trend of increasing costs are various for each case. It is also found that more cost savings from multimodal transportation can be identified if we analyze transportation costs with stochastic modeling. This effect is more remarkable when the bioenergy plant is located far from the biomass collecting site. In the case of short-distance plant cases, this reveals that the impact of utilization of stochastic methods is insignificant, as the cost savings from multimodal transportation is trivial. Other findings from our experiments include how multimodal transportation may provide cost savings in the economic cost factor, except in the case of low annual capacity and short average distance. When it comes to the effect of the stochastic method, there is also no great difference in optimized costs with deterministic analysis in all cases. This is understandable because we found that selecting the stochastic method more significantly effects the modal share than the entire economic cost savings. Finally, the experimental results reveal the modal share between truck and rail varies for each case, as rail transportation can be used in various cases as a multimodal option to achieve optimized costs. One of the interesting points is that increase of rail shipments does not necessarily lead to the increase of cost savings. This tells us that the distance between the plant and biomass collecting site is a more significant factor which affects the benefit of multimodal transportation with rail compared to the capacity of the bioenergy plant.
The main contributions of this study include the development of a simple approach to the multi-objective stochastic model for sustainable biomass transportation systems. We also identified the impact level of model selection (deterministic and stochastic) on transportation mode (single and multimodal transportation). Though this study tried to use as much actual experimental data as possible, it is recognized that several assumptions were made, such as the truck and rail operations. In addition, there were certain limitations that should be noted when interpreting the results. For example, exclusion of feedstock seasonality, and the loading/unloading process. In future studies, access to more actual cost data would facilitate the development of more accurate tools to figure out the role of the stochastic method, as well as the benefits of multimodal transportation for bioenergy production.

Author Contributions

Conceptualization, S.K.; methodology, S.K. and K.C.; software, S.K.; validation, K.C. and S.Y.; formal analysis, S.K.; investigation, K.C.; resources, J.L.; data curation, S.K.; writing—original draft preparation, S.K.; writing—review and editing, K.C. and S.Y.; visualization, S.K.; supervision, J.L.; project administration, S.K.; funding acquisition, S.K. and J.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by a grant from R&D program, PK2202C1, of the Korea Railroad Research Institute, Korea, and also supported by the U.S. DOT OST-R Tier 1 University Transportation Center, DTRT12-G-UTC18/DTRT13-G-UTC5.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

According to the principal properties of random vectors in terms of expected value and variance-covariance matrix, if a random matrix is a matrix of random variable Z = (Zij), its expectation is given by E[Z] = (E[Zij]). Therefore, the expected value and variance of F(ξ)V in formulation (11) can be developed as follows:

Appendix A.1 E F ξ V

E w 1 C X 1 ξ C X 2 ξ C X n ξ X 1 X 2 X n + C Y 1 ξ C Y 2 ξ C Y n ξ Y 1 Y 2 Y n + C Z ξ Z + a ξ K + w 2 R X 1 ξ R X 2 ξ R X n ξ X 1 X 2 X n + R Y 1 ξ R Y 2 ξ R Y n ξ Y 1 Y 2 Y n + R Z ξ Z + w 2 R X 1 ξ R X 2 ξ R X n ξ X 1 X 2 X n + R Y 1 ξ R Y 2 ξ R Y n ξ Y 1 Y 2 Y n + R Z ξ Z  
This can be disassemble into several random vectors as follows:
= w 1 E ( C X 1 ξ ) E ( C X 2 ξ ) E ( C X n ξ ) X 1 X 2 X n + E ( C Y 1 ξ ) E C Y 2 ξ E ( C Y n ξ ) Y 1 Y 2 Y n + E ( C Z ξ ) Z + E a ξ K }
+ w 2 E ( R X 1 ξ ) E ( R X 2 ξ ) E ( R X n ξ ) X 1 X 2 X n + E ( R Y 1 ξ ) E ( R Y 2 ξ ) E ( R Y n ξ ) Y 1 Y 2 Y n + E R Z ξ Z
+ w 3 E ( E X 1 ξ ) E ( E X 2 ξ ) E ( E X n ξ ) X 1 X 2 X n + E ( E Y 1 ξ ) E E Y 2 ξ E ( E Y n ξ ) Y 1 Y 2 Y n + E ( E Z ξ ) Z
= w 1 { E ( C X 1 ξ ) X 1 + E ( C X 2 ξ ) X 2 + + E ( C X n ξ ) X n + E ( C Y 1 ξ ) Y 1 + E ( C Y 2 ξ ) Y 2 + + E ( C Y n ξ ) Y n + E ( C Z ξ ) Z + E a ξ K }
+ w 2 { E ( R X 1 ξ ) X 1 + E ( R X 2 ξ ) X 2 + + E ( R X n ξ ) X n + E ( R Y 1 ξ ) Y 1 + E ( R Y 2 ξ ) Y 2 + + E ( R Y n ξ ) Y n + E ( R Z ξ ) Z }
+ w 3 { E ( E X 1 ξ ) X 1 + E ( E X 2 ξ ) X 2 + + E ( E X n ξ ) X n + E ( E Y 1 ξ ) Y 1 + E ( E Y 2 ξ ) Y 2 + + E ( E Y n ξ ) Y n + E ( E Z ξ ) Z }
= w 1 [ d X 1 t X 1 E ( c X ξ ) X 1 + d X 2 t X 2 E ( c X ξ ) X 2 + + d X n t X n E ( c X ξ ) X n + { d Y 1 E ( c Y ξ ) + E u ξ } t Y 1 Y 1 + { d Y 2 E ( c Y ξ ) + E u ξ } t Y 2 Y 2 + + { d Y n E ( c Y ξ ) + E u ξ } t Y n Y n + { d Z E ( c Z ξ + E l ξ } t Z Z + E a ξ K ]
+ w 2 [ d X 1 t X 1 { E ( γ X ξ ) + E ( δ X ξ ) } X 1 + d X 2 t X 2 { E ( γ X ξ ) + E ( δ X ξ ) } X 2 + + d X n t X n { E ( γ X ξ ) + E ( δ X ξ ) } X n + d Y 1 t Y 1 { E ( γ Y ξ ) + E ( δ Y ξ ) } Y 1 + d Y 2 t Y 2 { E ( γ Y ξ ) + E ( δ Y ξ ) } Y 2 + + d Y n t Y n { E ( γ Y ξ ) + E ( δ Y ξ ) } Y n + d Z t Z { E ( γ Z ξ ) + E ( δ Z ξ ) } Z ]
+ w 3 [ d X 1 t X 1 E e X C ξ + E e X P ξ + E e X N ξ X 1 + d X 2 t X 2 E e X C ξ + E e X P ξ + E e X N ξ X 2 + + d X n t X n E e X C ξ + E e X P ξ + E e X N ξ X n + d Y 1 t Y 1 E e Y C ξ + E e Y P ξ + E e Y N ξ Y 1 + d Y 2 t Y 2 E e Y C ξ + E e Y P ξ + E e Y N ξ Y 2 + + d Y n t Y n E e Y C ξ + E e Y P ξ + E e Y N ξ Y n + d Z t Z E e Z C ξ + E e Z P ξ + E e Z N ξ Z ]
( All uncertain parameters are independent each other)

Appendix A.2 V a r F ξ V

V a r w 1 C X 1 ξ C X 2 ξ C X n ξ X 1 X 2 X n + C Y 1 ξ C Y 2 ξ C Y n ξ Y 1 Y 2 Y n + C Z ξ Z + a ξ K + w 2 R X 1 ξ R X 2 ξ R X n ξ X 1 X 2 X n + R Y 1 ξ R Y 2 ξ R Y n ξ Y 1 Y 2 Y n + R Z ξ Z + w 2 R X 1 ξ R X 2 ξ R X n ξ X 1 X 2 X n + R Y 1 ξ R Y 2 ξ R Y n ξ Y 1 Y 2 Y n + R Z ξ Z  
= w 1 2 X 1 X 2 X n V a r C X 1 ξ C X 2 ξ C X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r C Y 1 ξ C Y 2 ξ C Y n ξ Y 1 Y 2 Y n + Z V a r ( C Z ξ ) Z + K V a r a ξ K
+ w 2 2 X 1 X 2 X n V a r R X 1 ξ R X 2 ξ R X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r R Y 1 ξ R Y 2 ξ R Y n ξ Y 1 Y 2 Y n + Z V a r ( R Z ξ ) Z
+ w 3 2 X 1 X 2 X n V a r E X 1 ξ E X 2 ξ E X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r E Y 1 ξ E Y 2 ξ E Y n ξ Y 1 Y 2 Y n + Z V a r ( E Z ξ ) Z
( All uncertain parameters are independent each other)
= w 1 2 { X 1 X 2 X n V a r C X 1 ξ Cov C X 1 ξ ,   C X 2 ξ   Cov C X 1 ξ ,   C X n ξ Cov C X 2 ξ ,   C X 1 ξ V a r C X 2 ξ Cov C X 2 ξ ,   C X n ξ Cov C X n ξ ,   C X 1 ξ Cov C X n ξ ,   C X 2 ξ V a r C X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r C Y 1 ξ Cov C Y 1 ξ ,   C Y 2 ξ   Cov C Y 1 ξ ,   C Y n ξ Cov C Y 2 ξ ,   C Y 1 ξ V a r C Y 2 ξ Cov C Y 2 ξ ,   C Y n ξ Cov C Y n ξ ,   C Y 1 ξ Cov C Y n ξ ,   C Y 2 ξ V a r C Y n ξ Y 1 Y 2 Y n + Z V a r ( C Z ξ ) Z + K V a r a ξ K }
+ w 2 2 { X 1 X 2 X n V a r R X 1 ξ Cov R X 1 ξ , R X 2 ξ Cov R X 1 ξ , R X n ξ Cov R X 2 ξ , R X 1 ξ V a r R X 2 ξ Cov R X 2 ξ , R X n ξ Cov R X n ξ , R X 1 ξ Cov R X n ξ , R X 2 ξ V a r R X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r R Y 1 ξ Cov R Y 1 ξ , R Y 2 ξ Cov R Y 1 ξ , R Y n ξ Cov R Y 2 ξ , R Y 1 ξ V a r R Y 2 ξ Cov R Y 2 ξ , R Y n ξ Cov R Y n ξ , R Y 1 ξ Cov R Y n ξ , R Y 2 ξ V a r R Y n ξ Y 1 Y 2 Y n + Z V a r ( R Z ξ ) Z }
+ w 3 2 { X 1 X 2 X n V a r E X 1 ξ Cov E X 1 ξ , E X 2 ξ Cov E X 1 ξ , E X n ξ Cov E X 2 ξ , E X 1 ξ V a r E X 2 ξ Cov E X 2 ξ , E X n ξ Cov E X n ξ , E X 1 ξ Cov E X n ξ , E X 2 ξ V a r E X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r E Y 1 ξ Cov E Y 1 ξ , E Y 2 ξ Cov E Y 1 ξ , E Y n ξ Cov E Y 2 ξ , E Y 1 ξ V a r E Y 2 ξ Cov E Y 2 ξ , E Y n ξ Cov E Y n ξ , E Y 1 ξ Cov E Y n ξ , E Y 2 ξ V a r E Y n ξ Y 1 Y 2 Y n + Z V a r ( E Z ξ ) Z }
= w 1 2 { X 1 X 2 X n V a r C X 1 ξ 0   0 0 V a r C X 2 ξ 0 0 0 V a r C X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r C Y 1 ξ 0   0 0 V a r C Y 2 ξ 0 0 0 V a r C Y n ξ Y 1 Y 2 Y n + Z V a r ( C Z ξ ) Z + K V a r a ξ K }
+ w 2 2 { X 1 X 2 X n V a r R X 1 ξ 0   0 0 V a r R X 2 ξ 0 0 0 V a r R X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r R Y 1 ξ 0   0 0 V a r R Y 2 ξ 0 0 0 V a r R Y n ξ Y 1 Y 2 Y n + Z V a r ( R Z ξ ) Z }
+ w 3 2 { X 1 X 2 X n V a r E X 1 ξ 0 0 0 V a r E X 2 ξ 0 0 0 V a r E X n ξ X 1 X 2 X n + Y 1 Y 2 Y n V a r E Y 1 ξ 0 0 0 V a r E Y 2 ξ 0 0 0 V a r E Y n ξ Y 1 Y 2 Y n + Z V a r ( E Z ξ ) Z }
= w 1 2 { V a r C X 1 ξ X 1 2 + V a r C X 2 ξ X 2 2 + + V a r C X n ξ X n 2 + V a r C Y 1 ξ Y 1 2 + V a r C Y 2 ξ Y 2 2 + + V a r C Y n ξ Y n 2 + V a r ( C Z ξ ) Z 2 + V a r a ξ K 2 }
+ w 2 2 { V a r R X 1 ξ X 1 2 + V a r R X 2 ξ X 2 2 + + V a r R X n ξ X n 2 + V a r R Y 1 ξ Y 1 2 + V a r R Y 2 ξ Y 2 2 + + V a r R Y n ξ Y n 2 + V a r ( R Z ξ ) Z 2 }
+ w 3 2 { V a r E X 1 ξ X 1 2 + V a r E X 2 ξ X 2 2 + + V a r E X n ξ X n 2 + V a r E Y 1 ξ Y 1 2 + V a r E Y 2 ξ Y 2 2 + + V a r E Y n ξ Y n 2 + V a r ( E Z ξ ) Z 2 }
= w 1 2 [ { d X 1 2 t X 1 2 V a r ( c X ξ ) X 1 2 + d X 2 2 t X 2 2 V a r ( c X ξ ) X 2 2 + + d X n 2 t X n 2 V a r ( c X ξ ) X n 2 + { d Y 1 2 V a r ( c Y ξ ) + V a r u ξ } t Y 1 2 Y 1 2 + { d Y 2 2 V a r ( c Y ξ ) + V a r u ξ } t Y 2 2 Y 2 2 + + { d Y n 2 V a r ( c Y ξ ) + V a r u ξ } t Y n 2 Y n 2 + { d Z 2 V a r ( c Z ξ + V a r l ξ } t Z 2 Z 2 + V a r a ξ K 2 } ]
+ w 2 2 [ { d X 1 2 t X 1 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X 1 2 + d X 2 2 t X 2 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X 2 2 + + d X n 2 t X n 2 { V a r ( γ X ξ ) + V a r ( δ X ξ ) } X n 2 + d Y 1 2 t Y 1 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y 1 2 + d Y 2 2 t Y 2 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y 2 2 + + d Y n 2 t Y n 2 { V a r ( γ Y ξ ) + V a r ( δ Y ξ ) } Y n 2 + d Z 2 t Z 2 { V a r ( γ Z ξ ) + V a r ( δ Z ξ ) } Z 2 } ]
+ w 3 2 [ { d X 1 2 t X 1 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X 1 2 + d X 2 2 t X 2 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X 2 2 + + d X n 2 t X n 2 V a r e X C ξ + V a r e X P ξ + V a r e X N ξ X n 2 + d Y 1 2 t Y 1 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y 1 2 + d Y 2 2 t Y 2 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y 2 2 + + d Y n 2 t Y n 2 V a r e Y C ξ + V a r e Y P ξ + V a r e Y N ξ Y n 2 + d Z 2 t Z 2 V a r e Z C ξ + V a r e Z P ξ + V a r e Z N ξ Z 2 } ]
( All uncertain parameters are independent each other)

References

  1. Cundiff, J.S.; Dias, N.; Sherali, H.D. A linear programming approach for designing a herbaceous biomass delivery system. Bioresour. Technol. 1997, 59, 47–55. [Google Scholar] [CrossRef]
  2. Zhu, X.Y.; Li, X.; Yao, Q.; Chen, Y. Challenges and models in supporting logistics system design for dedicated-biomass-based bioenergy industry. Bioresour. Technol. 2011, 102, 1344–1351. [Google Scholar] [CrossRef] [PubMed]
  3. Devlin, G.; Talbot, B. Deriving cooperative biomass resource transport supply strategies in meeting co-firing energy regulations: A case for peat and wood fibre in Ireland. Appl. Energy 2014, 113, 1700–1709. [Google Scholar] [CrossRef] [Green Version]
  4. Sosa, A.; Acuna, M.; McDonnell, K.; Devlin, G. Managing the moisture content of wood biomass for the optimisation of Ireland’s transport supply strategy to bioenergy markets and competing industries. Energy 2015, 86, 354–368. [Google Scholar] [CrossRef]
  5. Osmani, A.; Zhang, J. Optimal grid design and logistic planning for wind and biomass based renewable electricity supply chains under uncertainties. Energy 2014, 70, 514–528. [Google Scholar] [CrossRef]
  6. Cucek, L.; Martin, M.; Grossmann, I.E.; Kravanja, Z. Multi-period synthesis of optimally integrated biomass and bioenergy supply network. Comput. Chem. Eng. 2014, 66, 57–70. [Google Scholar] [CrossRef]
  7. Poudel, S.R.; Marufuzzaman, M.; Bian, L. A hybrid decomposition algorithm for designing a multi-modal transportation network under biomass supply uncertainty. Transp. Res. Part E Logist. Transp. Rev. 2016, 94, 1–25. [Google Scholar] [CrossRef]
  8. Dal Mas, M.; Giarola, S.; Zamboni, A.; Bezzo, F. Capacity planning and financial optimization of the bioethanol supply chain under price uncertainty. Comput. Aided Chem. Eng. 2010, 28, 97–102. [Google Scholar]
  9. You, F.; Grossmann, I.E. Design of responsive supply chains under demand uncertainty. Comput. Chem. Eng. 2008, 32, 3090–3111. [Google Scholar] [CrossRef]
  10. Kim, J.; Realff, M.J.; Lee, J.H.; Whittaker, C.; Furtner, L. Design of biomass processing network for biofuel production using an MILP model. Biomass Bioenergy 2011, 35, 853–871. [Google Scholar] [CrossRef]
  11. Ravula, P.P.; Grisso, R.D.; Cundiff, J.S. Comparison between two policy strategies for scheduling trucks in a biomass logistic system. Bioresour. Technol. 2008, 99, 5710–5721. [Google Scholar] [CrossRef] [PubMed]
  12. Simwanda, M.; Wing, M.G.; Sessions, J. Evaluating global positioning system accuracy for forest biomass transportation tracking within varying forest canopy. West. J. Appl. For. 2011, 26, 165–173. [Google Scholar] [CrossRef] [Green Version]
  13. Han, S.K.; Murphy, G.E. Solving a woody biomass truck scheduling problem for a transport company in Western Oregon, USA. Biomass Bioenergy 2012, 44, 47–55. [Google Scholar] [CrossRef]
  14. Jones, G.; Loeffler, D.; Butler, E.; Hummel, S.; Chung, W. The financial feasibility of delivering forest treatment residues to bioenergy facilities over a range of diesel fuel and delivered biomass prices. Biomass Bioenergy 2013, 48, 171–180. [Google Scholar] [CrossRef]
  15. Abbas, D.; Arnosti, D. Economics and Logistics of Biomass Utilization in the Superior National Forest. J. Sustain. For. 2013, 32, 41–57. [Google Scholar] [CrossRef]
  16. Ko, S.; Lautala, P.; Fan, J.; Shonnard, D.R. Economic, social, and environmental cost optimization of biomass transportation: A regional model for transportation analysis in plant location process. Biofuel Bioprod. Biorefin. 2019, 13, 582–598. [Google Scholar] [CrossRef]
  17. Kumar, A.; Sokhansanj, S.; Flynn, P.C. Development of a multicriteria assessment model for ranking biomass feedstock collection and transportation systems. Appl. Biochem. Biotechnol. 2006, 129, 71–87. [Google Scholar] [CrossRef]
  18. Tita, B. Railcar Shortage in US Pushes Up Lease Rates. The Wall Street Journal. 2014. Available online: https://www.wsj.com/articles/railcar-shortage-in-u-s-pushes-up-lease-rates-1401393331 (accessed on 1 September 2020).
  19. GAO. Transportation Surface Freight: A comparison of the Costs of Road, Rail, and Waterways Freight Shipments That Are Not Passed on to Consumers. 2011, GAO-11-134. Available online: https://www.gao.gov/assets/gao-11-134.pdf (accessed on 15 November 2020).
  20. Kampempe, J.D.B.; Luhandjula, M.K. Chance-constrained approaches for multiobjective stochastic linear programming problems. Am. J. Oper. Res. 2012, 2, 519–526. [Google Scholar] [CrossRef] [Green Version]
  21. US EIA. Form EIA-860 Detailed Data with Previous form Data: Year 2020. 2021, Washington, DC. Available online: https://www.eia.gov/electricity/data/eia860/ (accessed on 1 September 2021).
  22. Hamelinck, C.N.; Suurs, R.A.A.; Faaij, A.P.C. International bioenergy transport costs and energy balance. Biomass Bioenergy 2005, 29, 114–134. [Google Scholar] [CrossRef]
  23. Ruiz, J.A.; Juarez, M.C.; Morales, M.P.; Munoz, P.; Mendivil, M.A. Biomass logistics: Financial & environmental costs. Case study: 2 MW electrical power plants. Biomass Bioenergy 2013, 56, 260–267. [Google Scholar]
  24. Mahmudi, H.; Flynn, P.C. Rail vs truck transport of biomass. Appl. Biochem. Biotechnol. 2006, 129, 88–103. [Google Scholar] [CrossRef]
  25. Gonzales, D.; Searcy, E.M.; Eksioglu, S.D. Cost analysis for high-volume and long-haul transportation of densified biomass feedstock. Transp. Res. 2013, 49, 48–61. [Google Scholar] [CrossRef]
  26. Searcy, E.; Flynn, P.; Ghafoori, E.; Kumar, A. The relative cost of biomass energy transport. Appl. Biochem. Biotechnol. 2007, 137, 639–652. [Google Scholar] [PubMed]
Figure 1. The name plate capacity (MW) of bio-electricity plants in US [21].
Figure 1. The name plate capacity (MW) of bio-electricity plants in US [21].
Sustainability 14 01889 g001
Figure 2. Results of Optimized transportation costs for each case.
Figure 2. Results of Optimized transportation costs for each case.
Sustainability 14 01889 g002
Figure 3. Cost Savings between Single and Multimodal Transportation.
Figure 3. Cost Savings between Single and Multimodal Transportation.
Sustainability 14 01889 g003
Figure 4. Optimized transportation costs considering economic factor only.
Figure 4. Optimized transportation costs considering economic factor only.
Sustainability 14 01889 g004
Figure 5. Annual number of rail shipments for each multimodal case.
Figure 5. Annual number of rail shipments for each multimodal case.
Sustainability 14 01889 g005
Table 1. Notations for Set, Decision Variables, and Input Parameters.
Table 1. Notations for Set, Decision Variables, and Input Parameters.
I = total number of collecting points (supply areas),
X i = number of trucks shipped between supply area “i” to the conversion plant,
Y i = number of trucks shipped short distances between supply area “i” to the rail siding,
Z = number of unit train from rail siding to the conversion plant,
C i X ,   C i Y ,   C r = economic transportation costs by mode X, Y at “i”, and Z, respectively,
R i X ,   R i Y ,   R r = social transportation costs by mode X, Y at “i”, and Z, respectively,
E i X ,   E i Y ,   E r = environmental transportation costs by mode X, Y at “i”, and Z, respectively,
t X ,   t Y ,   t Z = tonnage shipped by mode X, Y, and Z at one time, respectively,
P = number of demand points (Conversion Plants),
O p = required demand orders that are transported to conversion plant p,
K = dummy variable which value is 0 if the value of Z is 0, 1 otherwise.
Q i   = daily quantitative limitation in a supply area “i”,
D i X = distance between supply area “i” and the conversion plant (long distance),
D i Y = distance between supply area “i” and the rail siding (short distance),
D r = distance between rail siding and the conversion plant (railroad),
c i X ,   c i Y ,   c r = unit costs of economic transport by mode X, Y at “i”, and Z, respectively,
u = unit costs of unloading work in a rail siding from truck to storage facility,
l = unit costs of loading work in a rail siding from storage facility to rail cars,
a = unit costs of leasing a railcar for annual contract,
γ i X ,   γ i Y ,   γ r = unit costs of traffic congestions by mode X, Y at “i”, and Z, respectively,
δ i X ,   δ i Y , δ r = unit costs of accident risks by mode X, Y at “i”, and Z, respectively,
e c X ,   e c Y ,   e c r = unit costs of CO2 emissions by mode X, Y at “i”, and Z, respectively,
e p X ,   e p Y ,   e p r = unit costs of PM emissions by mode X, Y at “i”, and Z, respectively,
e n X ,   e n Y ,   e n r = unit costs of NOx emissions by mode X, Y at “i”, and Z, respectively,
w 1 ,   w 2 ,   w 3 = weight factors for economic, social and environmental transportation
Table 2. The Economic Distances by Modes for Biomass Transportation.
Table 2. The Economic Distances by Modes for Biomass Transportation.
FeedstockTruckRailShipRegionReference
Forest~100 km<<100 km~ Natherland[22]
Forest~50 km<<50~200 km<<200~1200 km<Spain[23]
Woodchip~145 km<<145 km~ Canada (Unit Train)[24]
Woodchip~386 km<<386 km~ US (Unit Train)[25]
Woodchip~500 km<<500 km~<800 km~Canada (Unit Train)[26]
straw~170 km<<170 km~ Canada (Unit Train)[24]
straw~500 km<<500 km~<1500 km~Canada (Unit Train)[26]
corn stover~500 km<<500 km~<1500 km~US (Unit Train)[26]
corn stover~170 km<<170 km~ Canada (Unit Train)[24]
Grain~161 km<<161 km~ US (Unit Train)[25]
Grain~338 km<<338 km~ US (Unit Train)[25]
Table 3. Numerical example cases of bio-electricity plants for this study.
Table 3. Numerical example cases of bio-electricity plants for this study.
Annual Capacity350,000 Tons1,200,000 Tons
Avg. Distance
75 milesCase: ACase: B
150 milesCase: CCase: D
Table 4. Example values of input parameters for stochastic optimization model.
Table 4. Example values of input parameters for stochastic optimization model.
Input CategoryValues of Each Case
Case ACase BCase CCase D
ConditionsPossible Mode typesTruckTruck,Truck,Truck,
RailRailRailRail
Number of collecting areas3333
Annual capacity of each collecting areas (Tons)N~(300,000, 10,000)N~(300,000, 10,000)N~(300,000, 10,000)N~(300,000, 10,000)
N~(400,000, 50,000)N~(400,000, 50,000)N~(400,000, 50,000)N~(400,000, 50,000)
N~(500,000, 200,000)N~(500,000, 200,000)N~(500,000, 200,000)N~(500,000, 200,000)
Number of1111
conversion plants
Distance (Mile) from collecting area and plantAvg. 75Avg. 75Avg. 150Avg. 150
Distance (Mile) from collecting area rail sidingAvg. 20Avg. 20Avg. 40Avg. 40
Distance (Mile) from rail siding and plantAvg. 60Avg. 60Avg. 120Avg. 120
Economic costDemand quantitiesN~(350,000, 1000)N~(1,200,000, 5000)N~(350,000, 1000)N~(1,200,000, 5000)
(Tons)
Supply quantitiesN~(350,000, 1000)N~(1,200,000, 5000)N~(350,000, 1000)N~(1,200,000, 5000)
(Tons)
Unit costs per tonnage for haulingTruck: N~(0.14, 0.01)Truck: N~(0.14, 0.01)Truck: N~(0.14, 0.01)Truck: N~(0.14, 0.01)
factors(US $/Dry ton/km, [17])Rail:Rail:Rail:Rail:
N~(0.03, 0.001)N~(0.03, 0.001)N~(0.03, 0.001)N~(0.03, 0.001)
Unit costs of loading/unloading for railN~(4.8, 0.4)N~(4.8, 0.4)N~(4.8, 0.4)N~(4.8, 0.4)
(US $/Dry ton, [16])
unit costs ofN~(400, 100)N~(400, 100)N~(400, 100)N~(400, 100)
leasing a railcar
(US $/month, [18])
Social costTraffic CongestionTruck: N~(0.66, 0.2)Truck: N~(0.66, 0.2)Truck: N~(0.66, 0.2)Truck: N~(0.66, 0.2)
Rail:Rail:Rail:Rail:
(US cent/ton-mile, [19])N~(0.015, 0.1)N~(0.015, 0.1)N~(0.015, 0.1)N~(0.015, 0.1)
factorsAccident RiskTruck: N~(1.66, 2)Truck: N~(1.66, 2)Truck: N~(1.66, 2)Truck: N~(1.66, 2)
Rail:Rail:Rail:Rail:
(US cent/ton-mile, [19])N~(0.018, 0.5)N~(0.018, 0.5)N~(0.018, 0.5)N~(0.018, 0.5)
Environmental costCosts of EmissionsTruck: N~(0.71, 0.5)Truck: N~(0.71, 0.5)Truck: N~(0.71, 0.5)Truck: N~(0.71, 0.5)
: PM and NOxRail:Rail:Rail:Rail:
(US cent/ton-mile, [16])N~(0.19, 2)N~(0.19, 2)N~(0.19, 2)N~(0.19, 2)
factorsCosts of EmissionsTruck: N~(0.22, 0.5)Truck: N~(0.22, 0.5)Truck: N~(0.22, 0.5)Truck: N~(0.22, 0.5)
: CO2Rail:Rail:Rail:Rail:
(US cent/ton-mile, [16])N~(0.05, 1)N~(0.05, 1)N~(0.05, 1)N~(0.05, 1)
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ko, S.; Choi, K.; Yu, S.; Lee, J. A Stochastic Optimization Model for Sustainable Multimodal Transportation for Bioenergy Production. Sustainability 2022, 14, 1889. https://doi.org/10.3390/su14031889

AMA Style

Ko S, Choi K, Yu S, Lee J. A Stochastic Optimization Model for Sustainable Multimodal Transportation for Bioenergy Production. Sustainability. 2022; 14(3):1889. https://doi.org/10.3390/su14031889

Chicago/Turabian Style

Ko, Sangpil, Kyoungjoon Choi, Seungmin Yu, and Jun Lee. 2022. "A Stochastic Optimization Model for Sustainable Multimodal Transportation for Bioenergy Production" Sustainability 14, no. 3: 1889. https://doi.org/10.3390/su14031889

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop