Next Article in Journal
Computing Analysis of Connection-Based Indices and Coindices for Product of Molecular Networks
Next Article in Special Issue
Prospective Teachers’ Development of Meta-Cognitive Functions in Solving Mathematical-Based Programming Problems with Scratch
Previous Article in Journal
Analytical Calculation of the Tooth Surface Contact Stress of Cylindrical Gear with Variable Hyperbolic Circular-Arc-Tooth-Trace
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Heuristic Simulation–Optimization Approach to Information Sharing in Supply Chains

Department of Business Administration, Gwangju University, 277 Hyodeok-ro, Nam-gu, Gwangju 61743, Korea
Symmetry 2020, 12(8), 1319; https://doi.org/10.3390/sym12081319
Submission received: 25 June 2020 / Revised: 5 August 2020 / Accepted: 7 August 2020 / Published: 7 August 2020

Abstract

:
The sustainability of the supply chain is possible only if the profitability of all the tiers participating in that supply chain is guaranteed. The profitability of each of these tiers is ensured if information sharing as well as an effective and seamless coordination system are realized between the tiers. This process reduces the influence of an important risk factor known as the bullwhip effect. The purpose of the current study is to determine the necessary information sharing level to optimize the supply chain that has asymmetric flows of input and output values and to examine the effects of information sharing on the order fill rate (OFR) and total inventory cost (TIC) of the supply chain through analysis of variance (ANOVA) testing. In this work, the supply chain was optimized by using the particle swarm optimization (PSO) technique, with an objective function that assumes the maximization of OFR and minimization of TIC. The proposed method showed excellent results in comparing the mean, variance, and coefficient of variation. In addition, the method used the ANOVA test with a 5% significance level to verify the impact of the information sharing level.

1. Introduction

Supply chain management (SCM) is defined as a way to maximize profitability while keeping the overall cost of the supply chain to a minimum and meeting the customer’s service requirements at the same time. SCM is described as a systematic method that can be used to effectively integrate suppliers, manufacturers, distributors, and retailers so that an optimal product can be delivered in optimal amounts, at an optimal location, and at the optimal time [1]. The most ideal supply chain is the symmetric chain in which the product quantity, equal to the order quantity of the tier, is transferred from the upstream tier to the downstream tier. However, information sharing is not enabled and shows asymmetric results that differ between input and output values. Supply chains are complicated systems, involving, for example, demand handling, lead-times, batch orders, payments, price changes, and promotions [2]. This means that unexpected problems can arise. The most prominent of these is the “bullwhip effect”, whereby errors in demand forecasts increase along the supply chain [3].
Typically, the bullwhip effect is influenced by the level of information sharing [4,5], lead time [6], forecasting method [7], and inventory policy [8]. Lee and Wu [8] showed that inventory management is significant in supply chain management, and efficient inventory management can improve customer satisfaction, balance product plans, and reduce operating costs. In another study, Graves [7] investigated the effect of forecasting methods on the bullwhip effect. Furthermore, Chen et al. [6] used a simulation to validate the idea that an increase in the bullwhip effect is directly associated with lead time, and explained that the lead time has an effect on the safety of the inventory level and demand forecasting. Lee and Whang [5] demonstrated that information sharing has a significant effect on the determination of order quantity for a supplier in terms of reducing the inventory level and cost.
One of the methods to resolve the bullwhip effect is to allow each tier such as the supplier, manufacturer, distributor, and retailer to share information [9,10]. However, Chatfield et al. [9] indicated that this may increase the bullwhip effect as the range of order fluctuation becomes wider if a tier completely trusts order information. Their research indicated that information sharing can be effective only if the downstream information has a certain level of reliability; however, the level of information sharing was not considered by the authors.
Earlier studies concentrated on the effects of information sharing, inventory policy, and forecasting policy on the bullwhip effect, rather than the reduction of the total inventory cost (TIC) or the enhancement of the order fill rate (OFR) by improving the performance of the entire supply chain [11,12]. A supply chain that is sustainable and robust should be able to address all the problems that arise from the supply chain, as described by the bullwhip effect, and achieve supply chain optimization from a global perspective to ensure that all tiers participating in the supply chain are profitable.
One of the most effective ways to increase the sustainability of a supply chain to accomplish overall optimization is to reduce uncertainty in the supply chain and strengthen the partnership with the tiers participating in the supply chain by allowing the maximum information sharing among those tiers. To this end, the current study analyzes the level of information sharing and its effect on the supply chain by varying the level. The particle swarm optimization (PSO) technique has been used to optimize the overall supply chain, and the objective assumes the minimization of TIC and maximization of OFR. The effect of θ, which is the level of information sharing, was verified via ANOVA.
In this paper, therefore, first, the level of information sharing (θ) that optimizes the TIC and OFR, which are the objectives of the supply chain, was determined using PSO. Second, this result was compared with the condition when the level of information sharing is different. Third, ANOVA was used to evaluate the impact between information sharing levels and significant impact on TIC and OFR.
The rest of this paper is organized as follows. Section 2 provides a literature review, and the characteristics of the proposed model are shown in Section 3. The simulation of the model and analysis of the results are presented in Section 4, and a discussion is presented in Section 5. Finally, the suggested method is formalized and future work is discussed in Section 6.

2. Literature Review

The problem considered in this study can be classified as a simulation–optimization problem in which the supply chain model used in the experiment was implemented as a simulation model and the result was obtained through the optimization process. In addition, the supply chain model used in this study was classified as a discrete stochastic simulation–optimization model that targets discrete decision variables rather than continuous decision variables.
The discrete stochastic simulation–optimization techniques with discrete decision variables include learning automata [13], ranking-and-selection [14], simulated annealing [15], stochastic comparison method [16], evolutionary algorithm [17], etc.
Among these methods, the meta-heuristic method that can be applied regardless of the type of problem or the size of decision variables are evolutionary algorithms, of which the genetic algorithm and PSO technique are representatives [18]. This study applies the PSO technique because it uses primitive and simple mathematical operators, is very efficient in terms of the memory requirements and execution speed of the computer, and is much more efficient than the genetic algorithm in certain specific areas [19,20]. The PSO is an efficient algorithm for feature selection areas because the method is faster to converge and easier to implement when compared to other meta heuristic algorithms [21]. Additionally, the PSO is one of the most important meta heuristic algorithms in the field of collective intelligence [22]. A detailed description of the PSO technique is described in detail in Section 3.
Members of the supply chain have a different range of information that needs to be shared, and sharing information is necessary to make good decisions, increase visibility among members, and increase profitability, but the risk of information leakage affects a company’s competitive advantage [23]. An important prerequisite for information sharing is supply chain integration (SCI), which is important in the information sharing process because SCI enhances the connectivity, coordination, and collaboration between members of the supply chain. Therefore, information sharing with customers, information sharing with suppliers, information sharing with functions, and information sharing with the organization should all be included [24]. Information sharing and technology are some of the main factors in coordination between parties in a supply chain. In particular, information sharing improves the efficiency of the supply chain because information sharing reduces the inventory and facilitates production, thereby increasing supply chain efficiency [25]. Information sharing provides the manufacturing sector with benefits such as reduced inventory and efficient inventory management, reduced costs, increased visibility (significantly reduced uncertainty), significantly reduced or eliminated bullwhip effects, improved resource utilization, improved productivity, improved organizational efficiency, improved service, social bond building and strengthening, early problem detection, rapid response, reduced time from ordering to delivery, and optimized capacity. However, there are also difficulties in implementing information sharing [26].
The studies presented above emphasized the importance of information sharing, but did not provide an optimization perspective that would make information sharing more efficient. Therefore, this study aims to provide the most desirable level of information sharing for participants in the supply chain by considering information sharing and non-sharing while applying the simulation–optimization approach.

3. The Proposed Model

The supply chain we studied comprised a factory, distributor, wholesaler, and retailer, as depicted in Figure 1.
The decision variables used in this study (Figure 1) are illustrated as follows:
FPD 1 t : the production delay 1 of a factory at time t
FPD 2 t : the production delay 2 of a factory at time t
FED t : the expected demand of a factory at time t
FOS t : the outgoing shipment of a factory at time t
FIO t : the incoming order of a factory at time t
FPR t : the production of a factory at time t
FBL t : the backlog of a factory at time t
FINV t : the inventory of a factory at time t
DED t : the expected demand of a distributor at time t
DOS t : the outgoing shipment of a distributor at time t
DIO t : the incoming order of a distributor at time t
DIS t : the incoming shipment of a distributor at time t
DOP t : the order placed by a distributor at time t
DBL t : the backlog of a distributor at time t
DINV t : the inventory of a distributor at time t
WED t : the expected demand of a wholesaler at time t
WOS t : the outgoing shipment of a wholesaler at time t
WIO t : the incoming order of a wholesaler at time t
WIS t : the incoming shipment of a wholesaler at time t
WOP t : the order placed by a wholesaler at time t
WBL t : the backlog of a wholesaler at time t
WINV t : the inventory of a wholesaler at time t
RED t : the expected demand of a retailer at time t
ROS t : the outgoing shipment of a retailer at time t
RIO t : the incoming order of a retailer at time t
RIS t : the incoming shipment of a retailer at time t
ROP t : the order placed by a retailer at time t
RBL t : the backlog of a retailer at time t
RINV t : the inventory of a retailer at time t
COR t : the order of a customer at time t
In the supply chain (Figure 1), the factory receives orders from the distributor, the distributor from the wholesaler, the wholesaler from the retailer, and the retailer from the customers. In this sequence, an upstream tier interprets the information related to the order quantity received from a downstream tier. If there is no information sharing between the tiers, the upstream tier is severely affected by the bullwhip effect and experiences a much greater demand distortion and variance amplification than the downstream tier. On the other hand, if the upstream tier receives sufficient information from the downstream tier, the reliability of the received order is high. In such a case, when new expected demand ( ED t ) is determined, a large weight is put on the incoming order ( IO t 1 ) which is the order placed ( OP t 1 ) by the downstream tier, and less weight is put on past expected demand ( ED t 1 ). In the present study, to evaluate the level of information sharing, Equation (1) is used for ED t , ED t 1 , and IO t 1 by the proper adjustment of their weight.
ED t = θ · ED t 1 + ( 1 θ ) · IO t 1
where ED t and ED t 1 are the expected demand at time t and t − 1, respectively; IO t 1 is the actual demand ordered at time t − 1; and θ ( 0 θ 1 ) is the relative weight between the expected demand and the actual demand. That is, expected demand ( ED t ) means the sum of the incoming order ( IO t 1 ) from the downstream tier to the additional expected demand ( ED t 1 ) determined through its own information to prevent a shortage due to uncertainties in information coming from the downstream tier. When θ = 0, there is 100% confidence in the information of the order ( IO t 1 ) originating from the downstream tier. If θ = 1, the information coming from the downstream tier cannot be trusted, implying that ED t is self-determining, and there is no need for any shared information. Thus, the closer value θ is to 0, the higher the level of information sharing.
Equation (1) can be transformed to Equation (2) if the quantity ordered by the customer is disclosed at each tier. In Equation (2), COR t 1 denotes the order quantity of the customer at time t − 1. If the upstream tier has sufficient information sharing with the downstream tier, it can reduce the dependence on the expected demand ( ED t 1 ) because it can accurately identify and trust the attributes of the order ( COR t 1 ) from the customer.
ED t = θ · ED t 1 + ( 1 θ ) · COR t 1
Since the supply chain involves many tiers and is exposed to various situations and problems, a value of θ close to 0 does not indicate that the entire supply chain is optimal. That is, θ, which satisfies the total tiers involved in the supply chain, may have a value other than zero. Therefore, to analyze the influence of information sharing in supply chains, the value of θ should be varied. This is because the satisfaction of a supply chain varies with changes in the θ-value, which signifies changes in the level of information sharing. As the tiers involved in the supply chain are all different and the levels of information are different, the θ value that satisfies the entire supply chain should be determined as appropriate for the supply chain situation, not θ = 0, as the ideal level of information sharing that reflects 100% of customer demand.
In this study, optimization is achieved by applying PSO, a meta-heuristic method based on the social behavior of biological groups such as a flock of birds or a school of fish, rather than a genetic algorithm, to imitate the natural evolutionary process [30]. The PSO method regards a decision variable as a particle, and the population of decision variables is considered as a swarm. It is important to note that the PSO algorithm finds the optimal solution by moving particles, and the movement of the particles are updated via the position equation, Equation (3), and the velocity equation, Equation (4).
Position : X nk ( t + 1 ) = X nk ( t ) + χ V nk ( t ) + ϵ ( t )
Velocity : V nk ( t + 1 ) = wV nk ( t ) + c 1 r 1 ( P nk X nk ( t ) ) + c 2 r 2 ( G nk X nk ( t ) )
The velocity of each particle, v nk ( t + 1 ) , is updated considering both the particle optimum, P nk , and the global optimum, G nk . v nk ( t + 1 ) is the velocity of the kth component of the nth particle of the t + 1th generation.   P nk is the particle optimum that is found by each particle up to the present time, and G nk is the global optimum that is found by population to share information and search the place. r 1 and r 2 are random variables uniformly distributed on the interval [0, 1], and c 1 and c 2 are acceleration constants adjusting the effect of the particle optimum and the effect of the group optimum [12]. w is the inertia weight and limits this velocity.
Furthermore, the PSO prevents algorithms from converging to local optima by using the position, velocity, inertia weight, acceleration constants, and population size. The PSO, one of meta heuristic methods, is used as an optimization methodology in order to allow for the information sharing level. The method uses primitive and simple mathematical operators and is known to be highly efficient in memory requirement and running speed [18,19]. In addition, it shows superiority to genetic algorithm (GA) in some application areas [20]. The PSO is considered to be simpler and more efficient than a genetic algorithm [12,18].
Our proposed model is graphically explained in Figure 2. The initial information for supply chain optimization is the information sharing level (θ), AR (1), which represents customer demand, and the expected demand reflecting the level of information sharing. The supply chain model accepts the initial information, performs the simulation, and confirms the values of TIC and OFR. The optimization process is performed using PSO as the optimization method. If the optimization condition of the supply chain model is satisfactory, the model execution is terminated. Otherwise, the model is executed until a satisfactory optimization condition is realized.

4. Experiment and Results Analysis

A demand from the end-customer was assumed to be stochastic and to follow a first-order autoregressive process (AR (1)) via the following expression:
D t = μ + ρ D t 1 + ϵ t ,   where   | ρ | < 1
Furthermore, D t is the end-customer demand at time t; μ is a non-negative constant; ϵ t is the error term following independent and identical distribution (i.i.d.) with a mean of 0 and a standard deviation σ 2 ; and ρ is the first-order autocorrelation coefficient.
The expected demand for each tier was estimated by adding the actual order from the downstream to the expected demand of the current tier using Equation (1). Now, the smaller the θ value, the higher the importance of the actual demand from downstream and the smaller the weight of the expected demand including uncertainty. If the end-customer demand is shared through the supply chain, the expected demand is calculated using Equation (2). The TIC for a supply chain is estimated by the following expression:
t = 1 n ( BLC ( i = 1 m BL t , i ) + HIC ( i = 1 m INV t , i ) ) .
The TIC consists of the sum of the shortage cost (BLC) and inventory holding cost (HIC) at each tier (i = 1, …, m) during time t (t = 1, …, n). The shortage cost is assumed to be higher than the inventory holding cost, because a shortage causes a tier to forego a sales opportunity as well as the reliability of the tier. BL t , i is the amount of shortage and INV t , i is the amount of inventory in tier i at time t.
Typical inventory replenishment policies are implemented: order-up-to level policy, an order point-order quantity (s, Q) system, order point-order up to level (s, S) system, periodic review order up to level (R, S) system, and an (R, s, S) system [31]. In the (s, Q) system, a fixed Quantity Q is ordered whenever the inventory position drops to the reorder point s or lower. S means s + Q and R means every R units of time. We determined the optimal order quantity by using OP t , i = max { 0 ,   OP t , i } in tier i at time t considering the inventory adjustments for each tier and for the entire supply chain, and OP t is represented by Equation (7) [28]:
OP t , i = ED t , i + AS t , i + ASL t , i
where ED t , i is the expected demand for each tier i at time t, and AS t , i is the inventory adjustment for each tier i at time t, as shown in Equation (8). ASL t , i is the inventory adjustment for the whole supply chain at time t and is calculated by summing the inventory adjustment for each tier i at time t, as shown in Equation (9):
AS t , i = α S ( DINV t , i INV t , i + BL t , i )
where DINV t , i is the ideal inventory quantity for each tier i at time t; INV t , i is the actual current inventory level for each tier i at time t; and BL t , i is the shortage quantity for each tier i at time t. Furthermore, α S is the ratio of discordance between the ideal inventory and the actual inventory in each round.
ASL t , i = α SL ( DSL SL t , i )
where DSL is the ideal inventory quantity for the entire supply chain; SL t , i is the actual current inventory for each tier i in the supply chain; and α SL is the ratio of the ideal inventory quantity to the actual current inventory quantity in each round. Using Equations (8) and (9), Strozzi et al. [28] defined order quantity (Q) as follows:
Q = DINV t , i + β · DSL ,   where   β = α SL / α S ,   α SL < α S ,   ( α SL α S ) 1 .
In Equation (10), high values of α SL explain the high attention to the inventory, and high β values mean high attention to the supply chain in comparison with the inventory.
In the optimization algorithm, the input data include the level of initial information sharing, the forecasted demand for each tier, and expected demand. The optimization model consists of the supply chain model and the optimization algorithm (Figure 2). The supply chain model fetches initial information, performs the simulation, and sends the optimization algorithm and simulation result. Subsequently, the optimization algorithm performs PSO and builds a population by selecting the decision variables, the relative weight of the expected demand information of θ , and other additional parameters. The population obtained from the optimization algorithm becomes the optimal Pareto candidate set to satisfy the objectives.
The population is composed of the initial inventory level, the relative weight of the expected demand information of θ , shortage cost, and inventory holding cost, all of which were added at each tier in the supply chain. The population of parameters and decision variables generated a set of Pareto candidates during the optimization process. The decision variables and parameters were automatically adjusted according to the objective function. The optimization process iteratively performed the computation based on the model in Figure 2, minimized the TIC, and maximized the OFR by considering the information sharing level and other parameters.
The assumptions used for this simulation of the supply chain model are as follows [28]:
The lead time for the distributor, wholesaler, and retailer is one week;
The lead time for the factory tier is three weeks, considering the lead time of the raw-material supplier;
The capacity of each tier is infinite;
The order requested is never canceled; and
The inventory left is never returned.
Since it is difficult to obtain a theoretical value for a dynamic supply chain, we applied the same parameter values used by Strozzi et al. [28]. Thus, the customer demand model is AR(1) with ρ   = −0.6, μ   = 100, and ϵ t follows a normal distribution, N(0, 102). The range of θ is between 0 and 1. The size of the population is 200, and the number of generations is 100. The information lead time and the material lead time are one week, and the total replication length and warm-up period are 600 weeks and 100 weeks, respectively. Since Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 , as suggested by Strozzi et al. [28], are reasonable, we applied those values in the present work. The shortage and inventory holding costs were kept unchanged so that the simulation results could be compared objectively. The inventory holding cost was 0.5 per unit, and the shortage cost was 2 per unit per period.
The roles of the objective functions are to minimize the total inventory holding cost and maximize the OFR, as shown in Equations (11) and (12).
Minimize   TIC = t = 1 n ( BLC ( i = 1 m BL t , i ) + HIC ( i = 1 m INV t , i ) )
Maximize   OFR = i = 1 m OFR i / m
In Equations (11) and (12), m is the number of tiers, and the overall OFR in the entire supply chain is represented by dividing the sum of the order fill rate ( OFR i ) for each tier by the number of tiers (m). Note that the objective of the OFR is to maximize Equation (6) of the end-customer’s OFR instead of the overall OFR. The OFR means the percentage of the number of orders that are satisfied among the final customer’s orders during the entire simulation time. The TIC is determined by the sum of BLC and HIC at all tiers during the entire simulation time, and OFR is calculated as the average of order satisfaction at all tiers during the entire simulation time.
The simulation was tested in two ways: (1) using Equation (1) based on the information from downstream, and (2) using Equation (2) based on the information from the end-customer. For both cases, two scenarios were compared: (1) when the relative weight of the expected demand information of θ is automatically adjusted from 0 to 1, and (2) when the relative importance of the expected demand information of θ is fixed to 0.25, as suggested by Strozzi et al. [28]. The difference between the two cases in that the end-customer information is used in the second case, and the relative weight of the expected demand information of θ is fixed to 0.

4.1. The Case of Using the Downstream Information

The simulation results for the first case are presented in Figure 3 and Figure 4, and the specific values are summarized in Table 1.
As shown in Table 1, the TIC, by adjusting θ from 0 to 1, was between 1,424,416.167 and 1,866,388.589, and the TIC, when θ was set to 0.25, was between 1,630,458.682 and 2,170,367.994. The range of OFR, when θ has a constant value of 0.25, was 0.475 to 0.54, and the range of the OFR, by adjusting θ from 0 to 1, was 0.478 to 0.537.
A detailed comparison of TIC was carried out by summarizing the statistical total inventory cost data for both scenarios (see Table 2).
As shown in Table 2, both the mean and variance of TIC were lower when θ was automatically adjusted, and it seems that adjusting θ from 0 to 1 is a more effective solution than fixing θ to 0.25 in terms of TIC. This was validated further by performing an ANOVA test at the 0.05 level of significance to determine whether any significant difference in the TIC between the two scenarios could be found. The result of the ANOVA test is summarized in Table 3.
As shown in Table 3, since p = 1.16374 × 10−39, the p-value is lower than the α-level. Thus, it can be concluded that there is a difference between adjusting θ from 0 to 1 and fixing θ to 0.25. Consequently, the method of determining the relative weight of the expected demand information is a more effective solution for TIC under non-information sharing conditions.
As TIC is described, it is necessary to find OFRs for both scenarios, viz. adjusting θ from 0 to 1 and fixing θ to 0.25. The results of the statistical analysis of the OFRs are summarized in Table 4.
As shown in Table 4, the values of the mean and variance of the OFRs are not considerably different. That is, the coefficient of variance for adjusting θ, 0.0328225, does not differ greatly from that for fixing θ, 0.0331152. The ANOVA test was further employed at the 0.05 level of significance to determine whether there was any significant difference in the TIC between the two scenarios. The ANOVA test results are summarized in Table 5.
As shown in Table 5, since p = 0.1674999, the p-value is higher than the α-level. Thus, it cannot be inferred that there is a significant difference between adjusting θ and fixing θ. Consequently, the relative importance of the expected demand information does not affect the OFR.
In summary, adjusting the relative weight of the expected demand information has no real influence on the OFR. On the other hand, the results confirmed that the relative importance of the expected demand information reduced the TIC by more than 16%. Therefore, it may be concluded that the method of adjusting the relative weight of the expected demand information can improve TIC while maintaining the same OFR.

4.2. The Case of Using the Information from the End-Customer

As already mentioned, the purpose of this simulation is to test the case in which the information from the end-customer is used regarding two scenarios: (1) when the relative weight of the expected demand information of θ is automatically adjusted from 0 to 1, and (2) when the relative weight of the expected demand information of θ is fixed to 0. The simulation results are plotted in Figure 5 and Figure 6, and the specific values are summarized in Table 6.
As shown in Table 6, the TIC for θ 1 was between 707,502.4 and 1,072,705.1, whereas for θ = 0 , the TIC was between 747,763.7 and 909,893.5. The ranges of the OFR for θ   fixed at 0 and θ 1 were 0.502 to 0.548 and 0.503 to 0.543, respectively.
A detailed comparison of the TIC for both scenarios is shown in Table 7.
As shown in Table 7, the mean and variance of the TIC were 842,588.4999 and 15,474,607,605, respectively, when θ was automatically adjusted. When θ was zero, the mean and variance of the TIC were 807,374.6062 and 3,400,844,185, respectively. The ANOVA test at a 0.05 level of significance was performed to identify whether any significant difference in the TIC existed between the two scenarios. The ANOVA test results are summarized in Table 8.
As shown in Table 8, since p = 0.0003267, the p-value was lower than the α-level. Thus, it can be concluded that there was a difference between adjusting θ and fixing θ. Consequently, the TIC varied according to the relative weight of the expected demand information.
Furthermore, it is necessary to understand the OFRs for both the adjusted θ and fixed-value θ. The results of the statistical analysis of the OFRs are summarized in Table 9.
As shown in Table 9, when the θ was adjusted from 0 to 1, the mean and variance of the OFR were 0.531542 and 0.000163, respectively. When the value of θ was fixed to 0, the mean and variance of the OFR were 0.526958 and 0.000205, respectively. An ANOVA test was also performed at a 0.05 level of significance to find out whether there was any significant difference in the TIC between these two scenarios. The ANOVA test results are summarized in Table 10.
As shown in Table 10, since p = 0.000797, the p-value was lower than the α-level. Thus, it can be concluded that there was a difference between adjusting θ and fixing θ. Consequently, the level of information quality affects the OFR when end-customer information is shared.
In summary, adjusting the relative importance of the expected demand information has an influence on OFR. The coefficient of variance for adjusting θ was 0.024 and for fixing θ to 0, it was 0.027. Thus, adjusting the relative weight of the expected demand information is considered to improve and stabilize OFR. In terms of total inventory cost, this adjustment indicates that trusting the level of downstream information quality completely may reduce the bullwhip effect.
The data presented above are rearranged in Table 11 to compare the two cases of sharing and non-sharing information.
In terms of TIC, adjusting the relative weight of the expected demand information offers a more effective solution in the absence of information sharing, and fixing the relative importance of the expected demand information to zero offers an improved solution when information is shared. To identify whether there was any significant difference in the TIC between these two scenarios, an ANOVA test was performed at a 0.05 level of significance, and the results are summarized in Table 12.
As shown in Table 12, the p-value was lower than the α-level, because p = 4.3 × 10−221. Thus, it can be concluded that there is a difference between adjusting the relative weight without information sharing and fixing the relative importance to 0 when information is shared. When comparing the mean values of TIC as shown Table 11, the TIC for adjusting the relative weight without information sharing was 101.2% higher than that for fixing the relative importance with information sharing. The coefficient of variance for adjusting the relative weight without information sharing was 0.098, and the coefficient of variance for fixing the relative importance to 0 with information sharing was 0.072. Thus, fixing the relative weight of the expected demand information to 0 can be considered to be more stable.
Consequently, adjusting the initial conditions and the relative weight of the expected demand information offers a better solution than fixing the initial conditions by referring to existing valid values when information is not shared via the supply chain. When information sharing is allowed, fixing the relative importance of the expected demand information to 0 offers a more optimal solution than adjusting the relative weight, although the TIC only improved by 4.2%. This suggests that the proposed optimization method is as efficient as the method that uses 100% of information from the end-customer.

5. Discussion

A supply chain is affected by the extent to which information from downstream tiers is shared. The current study introduced a method that automatically adjusts the conditions by considering the level of information shared in terms of TIC and OFR in the supply chain. The TICs and OFRs were analyzed with and without end-customer information sharing. Without information sharing, viz. adjusting and fixing the relative weight of the expected demand information, different levels of information quality were developed. Likewise, these two scenarios were also investigated under information sharing conditions. The best solutions for information sharing and non-sharing were also compared in terms of TIC.
When comparing the best solution for information sharing with that of information non-sharing, the ANOVA test showed that there is evidence of a significant difference between the total inventory cost of adjusting the relative weight of the expected demand information without information sharing and that of fixing the relative weight of the expected demand information to 0 with information sharing at a 0.05 level of significance. The TIC of adjusting the relative importance without information sharing was higher than that of fixing the relative importance to 0 with information sharing. Additionally, fixing the relative weight to 0 with information sharing offers a more stable solution than adjusting the relative weight without information sharing because the coefficient of variance for fixing the relative importance to 0 is smaller than that of adjusting the relative importance.
Consequently, adjusting the relative weight of the expected demand information offers an improved solution without information sharing, and fixing the relative importance of the expected demand information to 0 improves the solution when sharing information. Furthermore, adjusting the relative importance could still be considered to be more efficient than the proposed method, although the scenario of fixing the relative importance produces an improved solution when sharing information.

6. Conclusions

The current study suggested a method for supply chain optimization by considering the conditions and level of information quality under conditions of information sharing and non-information sharing. In this regard, PSO was applied as the algorithm for supply chain optimization, and OFR and TIC were used as objective functions. The customer demand was assumed to be the AR (1) model with normal distribution N ( 0 ,   σ 2 ) with a mean value of 0, standard deviation σ 2 , and ρ as the first-order autocorrelation coefficient. Both information sharing and non-sharing were compared, and the level of information sharing, expressed as the θ value, was adjusted while performing supply chain optimization.
In conclusion, this study performed an overall optimization of the supply chain to satisfy the objective functions TIC and OFR when the θ value, which means the level of information sharing in the upstream and downstream tiers of the supply chain, is fixed and varied. When the information was not shared, when the θ value was changed, it was superior to when it was fixed. When information sharing was permitted, θ = 1 was better than when it was changed, but there was no significant difference. The effect of the level of information sharing on the objective functions TIC and OFR was analyzed using ANOVA and was found to have a significant effect on OFR and TIC.
Since the level of information sharing depends on factors and effects associated with the supply chain, it may be necessary to not only consider end-customer information, but also various other forms of information in the supply chain.

Funding

This study was conducted by research funds from Gwangju University in 2020.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Zhang, C.; Zhang, C. Design and Simulation of Demand Information Sharing in a Supply Chain. Simul. Model. Pract. Theory 2007, 15, 32–46. [Google Scholar] [CrossRef]
  2. Lee, H.L.; Padmanabhan, V.; Whang, S. Information Distortion in the Supply Chain: The Bullwhip Effect. Manag. Sci. 1997, 43, 546–558. [Google Scholar] [CrossRef]
  3. Forrester, J.W. Industrial Dynamics—A Major Breakthrough for Decision Making. Harvard Bus. Rev. 1958, 36, 37–66. [Google Scholar]
  4. Lee, H.L.; So, K.C.; Tang, C.S. The Value of Information Sharing in a Two-Level Supply Chain. Manag. Sci. 2000, 46, 626–643. [Google Scholar] [CrossRef] [Green Version]
  5. Lee, H.L.; Whang, S.J. Information Sharing in a Supply Chain. Int. J. Technol. Manag. 2000, 20, 373–387. [Google Scholar] [CrossRef]
  6. Chen, F.; Drezner, Z.; Ryan, J.K.; Simchi-Levi, D. Quantifying the Bullwhip Effect in a Simple Supply Chain: The Impact of Forecasting, Lead Times, and Information. Manag. Sci. 2000, 46, 436–443. [Google Scholar] [CrossRef] [Green Version]
  7. Graves, S.C. A Single-Item Inventory Model for a Nonstationary Demand Process. Manuf. Serv. Oper. Manag. 1999, 1, 50–61. [Google Scholar] [CrossRef] [Green Version]
  8. Lee, H.T.; Wu, J.C. A Study on Inventory Replenishment Policies in a Two-Echelon Supply Chain System. Comput. Ind. Eng. 2006, 51, 257–263. [Google Scholar] [CrossRef]
  9. Chatfield, D.C.; Kim, J.G.; Harrison, T.P.; Hayya, J.C. The Bullwhip Effect—Impact of Stochastic Lead Time, Information Quality, and Information Sharing: A Simulation Study. Prod. Oper. Manag. 2004, 13, 340–353. [Google Scholar] [CrossRef]
  10. Park, K.J. Effect on Initial Conditions on the Total Inventory Cost in a Supply Chain. J. Korea Soc. Ind. Syst. Eng. 2010, 10, 191–198. [Google Scholar]
  11. Park, K.J. Effect of Customer Demand on Total Inventory Cost and Order Fill Rate in a Supply Chain. J. Korea Soc. Ind. Syst. Eng. 2009, 32, 93–98. [Google Scholar]
  12. Park, K.J.; Kyung, G. Optimization of Total Inventory Cost and Order Fill Rate in a Supply Chain Using PSO. Int. J. Adv. Manuf. Technol. 2014, 70, 1533–1541. [Google Scholar] [CrossRef]
  13. Yakowitz, S.; Lugosi, E. Random Search in the Presence of Noise with Application to Machine Learning. SIAM J. Sci. Stat. Comput. 1990, 11, 702–712. [Google Scholar] [CrossRef]
  14. Yang, W.N.; Nelson, B.L. Using Common Random Numbers and Control Variates in Multiple Comparison Procedures. Oper. Res. 1991, 39, 583–591. [Google Scholar] [CrossRef]
  15. Lee, Y.H.; Iwata, K. Part Ordering through Simulation-Optimization in an FMS. Int. J. Prod. Res. 1991, 29, 1309–1323. [Google Scholar] [CrossRef]
  16. Gong, W.B.; Ho, Y.C.; Zhai, W. Stochastic Comparison Algorithm for Discrete Optimization with Estimation. In Proceedings of the 31st IEEE Conference on Decision and Control, Tucson, AZ, USA, 16–18 December 1992; pp. 795–800. [Google Scholar]
  17. Pierreval, H.; Tautou, L. Using Evolutionary Algorithms and Simulation for the Optimization of Manufacturing Systems. IIE Trans. 1997, 29, 181–189. [Google Scholar] [CrossRef]
  18. Alvarez-Benitez, E.A.; Everson, R.M.; Fieldsend, J.E. A MOPSO Algorithm Based Exclusively on Pareto Dominance Concepts. In Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science; Coello, C.A., Hernández Aguirre, A., Zitzler, E., Eds.; Springer: Berlin/Heidelberg, Germany, 2005; Volume 3410, pp. 459–473. [Google Scholar] [CrossRef] [Green Version]
  19. Mahnam, M.; Yadollahpour, M.R.; Famil-Dardashti, V.; Hejazi, S. Supply Chain Modeling in Uncertain Environment with Bi-objective Approach. Comput. Ind. Eng. 2009, 56, 1535–1544. [Google Scholar] [CrossRef]
  20. Mostaghim, S.; Teich, J. Strategies of Finding Good Local Guides in Multi-Objective Particle Swarm Optimization. In Proceedings of the IEEE Swarm Intelligent Symposium, Indianapolis, IN, USA, 24–26 April 2003; pp. 26–33. [Google Scholar]
  21. Elmasry, W.; Akbulut, A.; Zaim, A.H. Evolving Deep Learning Architectures for Network Intrusion Detection using a Double PSO Metaheuristic. Comput. Netw. 2020, 168, 1–21. [Google Scholar] [CrossRef]
  22. Keykhah, S.; Assareh, E.; Moltames, R.; Izadi, M.; Ali, H.M. Heat Transfer and Fluid Flow for Tube Included a Porous Media: Assessment and Multi-Objective Optimization Using Particle Swarm Optimization (PSO) Algorithm. Physica A 2020, 545, 1–17. [Google Scholar] [CrossRef]
  23. Hassan, A.Y.; Nasereddin, H.H.O. Importance of Information Sharing in Supply Chain and Knowledge Leakage. Transylv. Rev. 2018, 26, 6769–6775. [Google Scholar]
  24. Kocoglu, I.; Imamoglu, S.Z.; Ince, H.; Keskin, H. The Effect of Supply Chain Integration on Information Sharing: Enhancing the Supply Chain Performance. Procedia Soc. Behav. Sci. 2011, 24, 1630–1649. [Google Scholar] [CrossRef] [Green Version]
  25. Kumar, R.S.; Pugazhendhi, S. Information Sharing in Supply Chains: An Overview. Procedia Eng. 2012, 38, 2147–2154. [Google Scholar] [CrossRef] [Green Version]
  26. Lotfi, Z.; Mukhtar, M.; Sahran, S.; Taei Zadeh, A. Information Sharing in Supply Chain Management. Procedia Technol. 2013, 11, 298–304. [Google Scholar] [CrossRef] [Green Version]
  27. Park, K.J. Effect of Initial Conditions of Beer Game in a Supply Chain. In Proceedings of the 5th International Congress on Logistics and SCM Systems (ICLS2009), Seoul, Korea, 2–5 June 2009; pp. 156–162. [Google Scholar]
  28. Strozzi, F.; Bosch, J.; Zaldivar, J.M. Beer Game Order Policy Optimization under Changing Customer Demand. Decis. Support Syst. 2007, 42, 2153–2163. [Google Scholar] [CrossRef]
  29. Thomson, J.S.; Mosekilde, E.; Sterman, J.D. Hyperchaotic Phenomena in Dynamic Decision Making. In Complexity, Chaos, and Biological Evolution; Mosekilde, E., Mosekilde, L., Eds.; Springer: New York, NY, USA, 1991; pp. 397–420. [Google Scholar]
  30. Eberhart, R.; Kennedy, J. A New Optimizer Using Particles Swarm Theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, 4–6 October 1995; IEEE: New York, NY, USA; pp. 39–43. [Google Scholar]
  31. Silver, E.A.; Pyke, D.F.; Peterson, R. Inventory Management and Production Planning and Scheduling, 3rd ed.; Wiley & Sons: Hoboken, NJ, USA, 1989; pp. 237–241. [Google Scholar]
Figure 1. Supply chain model [10,12,27,28,29].
Figure 1. Supply chain model [10,12,27,28,29].
Symmetry 12 01319 g001
Figure 2. The suggested optimization model.
Figure 2. The suggested optimization model.
Symmetry 12 01319 g002
Figure 3. Simulation result under non-information sharing conditions, θ 1 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Figure 3. Simulation result under non-information sharing conditions, θ 1 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Symmetry 12 01319 g003
Figure 4. Simulation result under non-information sharing conditions, θ = 0.25 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Figure 4. Simulation result under non-information sharing conditions, θ = 0.25 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Symmetry 12 01319 g004
Figure 5. Simulation result under information sharing conditions, θ = 0.0 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Figure 5. Simulation result under information sharing conditions, θ = 0.0 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Symmetry 12 01319 g005
Figure 6. Simulation result under information sharing conditions, θ 1 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Figure 6. Simulation result under information sharing conditions, θ 1 , Q = 17 , α S = 0.317 , and ( α SL α S ) = 0.317 .
Symmetry 12 01319 g006
Table 1. Total ranges of the inventory cost and order fill rate under non-information sharing conditions.
Table 1. Total ranges of the inventory cost and order fill rate under non-information sharing conditions.
θ θ 1 θ = 0.25
Objectives
Total inventory costMin1,424,416.1671,630,458.682
Max1,866,388.5892,170,367.994
Order fill rateMin0.4780.475
Max0.5370.540
Table 2. Statistical analysis of total inventory cost under non-information sharing conditions.
Table 2. Statistical analysis of total inventory cost under non-information sharing conditions.
FactorNTotalMeanVariance
TIC(0 θ 1)200324,948,399.51,624,741.99825,534,935,240
TIC(θ = 0.25)200378,125,334.51,890,626.67239,302,200,428
Table 3. ANOVA test result for total inventory cost under non-information sharing conditions.
Table 3. ANOVA test result for total inventory cost under non-information sharing conditions.
Cause of VarianceSum of SquaresdfMean SquareFSig.Pr > F
Treatment (factor)7.06947 × 101217.06947 × 1012218.11.16374 × 10−393.9
Residual1.29026 × 101339832,418,567,834
Total1.99721 × 1013399
Table 4. Statistical analysis of the order fill rate (OFR) under non-information sharing conditions.
Table 4. Statistical analysis of the order fill rate (OFR) under non-information sharing conditions.
FactorNTotalMeanVariance
OFR(0 θ 1)200103.5850.5179250.000289
OFR(θ = 0.25)200104.058330.52029170.0002969
Table 5. ANOVA test results for order fill rate under non-information sharing conditions.
Table 5. ANOVA test results for order fill rate under non-information sharing conditions.
Cause of VarianceSum of SquaresdfMean SquareFSig.Pr > F
Treatment (factor)0.000560110.00056011.91215080.16749993.9
Residual0.1165833980.0002929
Total0.1171431399
Table 6. Ranges of total inventory cost and order fill rate considering the level of information quality under information sharing conditions.
Table 6. Ranges of total inventory cost and order fill rate considering the level of information quality under information sharing conditions.
θ θ 0 θ = 1
Objective Function
Total inventory costMin707,502.4747,763.7
Max1,072,705.1909,893.5
Order fill rateMin0.5030.502
Max0.5430.548
Table 7. Statistical analysis of total inventory cost under information sharing conditions.
Table 7. Statistical analysis of total inventory cost under information sharing conditions.
FactorNTotalMeanVariance
TIC( θ 1 )200168517700842,588.499915,474,607,605
TIC( θ = 0 )200161474921807,374.60623,400,844,185
Table 8. ANOVA test results for total inventory cost under information sharing conditions.
Table 8. ANOVA test results for total inventory cost under information sharing conditions.
Cause of Variance Sum of SquaresdfMean SquareFSig.Pr > F
Treatment (factor)1.24002 × 101111.24002 × 101113.138952330.00032673.8649292
Residual3.75621 × 10123989437725895
3.88022 × 1011399
Table 9. Statistical analysis of order fill rate under information sharing conditions.
Table 9. Statistical analysis of order fill rate under information sharing conditions.
FactorNTotalMeanVariance
OFR( θ 1 )200106.30830.5315420.000163
OFR( θ = 0 )200105.39170.5269580.000205
Table 10. ANOVA test results for order fill rate under information sharing conditions.
Table 10. ANOVA test results for order fill rate under information sharing conditions.
Cause of Variance Sum of SquaresdfMean SquareFSig.Pr > F
Treatment (factor)0.00210110.00210111.422350.0007973.864929
Residual0.0731973980.000184
Total0.075297399
Table 11. Statistical information on total inventory cost and order fill rate under both information non-sharing and sharing conditions.
Table 11. Statistical information on total inventory cost and order fill rate under both information non-sharing and sharing conditions.
Sharing ConditionObjective Function θ 1 θ = 0.25
Non-Information SharingTotal inventory costMin1,424,416.1671,630,458.682
Max1,866,388.5892,170,367.994
Mean1,624,741.9981,890,626.672
Variance2,553,493,524039,302,200,428
Order fill rateMin0.4780.475
Max0.5370.540
Mean0.5179250.5202917
Variance0.0002890002969
θ 1 θ = 0
Information SharingTotal inventory costMin707,502.400747,763.700
Max1,072,705.100909,893.500
Mean842,588.4999807,374.6062
Variance15,474,607,6053,400,844,185
Order fill rateMin0.5030.502
Max0.5430.548
Mean0.5315420.526958
Variance0.0001630.000205
Table 12. ANOVA test results for inventory holding costs with and without information sharing.
Table 12. ANOVA test results for inventory holding costs with and without information sharing.
Cause of VarianceSum of SquaresdfMean SquareFSig.Pr > F
Treatment(factor)6.68 × 101316.68 × 10134617.7394.3 × 10−2213.864929
Residual5.76 × 10123981.45 × 1010
Total7.26 × 1013399

Share and Cite

MDPI and ACS Style

Park, K. A Heuristic Simulation–Optimization Approach to Information Sharing in Supply Chains. Symmetry 2020, 12, 1319. https://doi.org/10.3390/sym12081319

AMA Style

Park K. A Heuristic Simulation–Optimization Approach to Information Sharing in Supply Chains. Symmetry. 2020; 12(8):1319. https://doi.org/10.3390/sym12081319

Chicago/Turabian Style

Park, KyoungJong. 2020. "A Heuristic Simulation–Optimization Approach to Information Sharing in Supply Chains" Symmetry 12, no. 8: 1319. https://doi.org/10.3390/sym12081319

APA Style

Park, K. (2020). A Heuristic Simulation–Optimization Approach to Information Sharing in Supply Chains. Symmetry, 12(8), 1319. https://doi.org/10.3390/sym12081319

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