Scientific Research

An Academic Publisher

Algebraic or Algorithmic: Searching for Optimal Solutions in Multi-Stage Supply Chain Models

**Author(s)**Leave a comment

*AMH*Supply Chain model to obtain optimal solutions for Two-, Three- and Four-Stage for deterministic models. Besides deriving its algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers. Our model has shown promising results in comparison to

*Equal Cycle Time*and other existing ones. The tests focused on obtaining optimal total annual costs and other related details of Two-, Three- and Four-Stage for deterministic models. The results are run under

*Visual Basic Programming*platform using Intel® Core

^{TM}2 Duo T6500 Processor.

KEYWORDS

1. Introduction

The term Supply Chain Management (SCM) has emerged in the late 1980s and since then many definitions of SCM [1] have been proposed. SCM deals with the managing materials, information and financial flows in a network consisting of suppliers, manufacturers, distributors, wholesalers, retailers and customers (consumers). SCM [2] is defined in as a set of approaches utilized to efficiently integrate suppliers, manufactures, warehouses, and stores, so that merchandise is produced and distributed at the right quantities, to the right locations, and at the right time, in order to minimize system-wide cost while satisfying service level requirements.

There are many different models developed for SCM and planning objectives. The models [3] developed for implementation and application in supply chain management are classified in two mathematical types, i.e., descriptive models and optimization models. The descriptive models are created by modeling practitioners to better understanding functional relationship in the supply chain. They include demand forecasting models, cost relationship model, resource utilization relationship models, and supply chain system simulation model.

Research findings in inventory-distribution coordination and information sharing reveal that these can help in reducing inventories, order costs and transportation costs. The firms are advised to device strategies that lead to smaller batches or frequent replenishments. The exchanging substantial quantities of information among the parties involved can increase the efficiency and effectiveness of the supply chain. This can significantly reduced inventory which has a significant impact on supply chain activities.

The focus [4] [5] is on the integrated vendor-buyer inventory and the joint economic lot sizing problem models. The inventories [4] across the entire supply chain can be more efficiently managed through greater cooperation and better coordination. A review in [5] on the joint replenishment problem shows that there is interest in the new kind of problem with dynamic or stochastic demand. Recent research on the problem has also focused on finding faster algorithms to the problem.

The case of a Two-Stage serial supply chain system [6] involves a single vendor who supplies a single buyer with a single product. The vendor’s production rate is assumed finite whilst the demand at the buyer is assumed deterministic. The model fully shares the relevant information in order to coordinate the replenishment policies and joint optimize their operational costs. The study developed an integrated inventory replenishment model which assumed linear and fixed backorders costs. A hybrid geometric-algebraic method is used to derive the optimal replenishment policy and the minimum supply chain total cost in a closed form.

Some studies suggested synchronization of cycle times across the chain stages; however, in many cases pure Just-In-Time schedules using a common synchronized common production replenishment cycle are found not to be optimal. The supply chain model [7] achieved better the coordination by applying integer multipliers mechanisms in which the cycle time at each stage is an integer multiple of the cycle time of the adjacent downstream stage.

This research [8] deals with inventory and production co-ordination in a Three-Stage supply chain involving suppliers, manufacturers and retailers. The cycle time used at each stage is an integer multiple of the cycle time of the adjacent downstream stage. The produced lot is sent as soon as they are produced and not to wait until the whole lot is produced. A numerical example shows that the policy leads to better savings compared to the scheme that allows shipments only after the whole lot is produced.

A discrete-event simulation model [9] is developed for a Four-Stage supply chain. The model assumed to share their inventories and demands information. The evaluation on the system performance is the expected total cost which consists of the inventory holding cost, the ordering cost, and the shortage cost. The simulation model is optimized using SimRunner optimization package.

A more generalized inventory coordination mechanism in an *n*-stage, multi-customer, non-serial supply chain [10] used algebraic method to optimize coordinated supply chain. The established recursive expressions are used for the derivation of the optimal replenishment policy and the development of the solution algorithm. Further, a simple procedure is derived that can help in sharing the coordination cost benefits to induce all stages to adopt the inventory coordination mechanism.

In [11] , a proposed formulation for n-stage multi customers supply chain inventory model where a company can supply products to several customers. The formulation is for the model with the simplest inventory coordination mechanism, i.e., same cycle time for all companies in the supply chain. Instead of using differential calculus, it is feasible to use perfect square method to obtain an algebraic approach to optimize the supply chain model.

A generalization [7] is performed in [12] and individual derivation of the optimal solution to the Three- and Four-Stage models using the perfect squares method. A simple algebraic approach is considered good for those unfamiliar with differential calculus to understand better the optimal solution procedure. The study also deduced the optimal expressions [7] and [11] via two numerical examples.

The objective for this paper is to introduce our supply chain model called AMH, to develop algebraic solutions and performing search algorithms to obtain optimal solutions for multi-stage supply chain models. The development of mathematical formulations can assist the integrated design of strategic supply chain networks. Whenever algebraic formulations are not easily derived, then the alternative is to perform search algorithm. Both results can be utilized to coordinate and integrate the production-inventory decisions efficiently among supply chain partners, for example, suppliers, manufactures, distributors, wholesalers and retailers.

2. The Notations for Supply Chain Models

In this paper, up to Four-Stage supply chain partners are considered where a firm can supplies many customers. The production rates for the suppliers, manufactures and distributors are assumed finite and the demand for each firm is assumed to be deterministic. The production and inventory decisions across the supply chain will be coordinated so that the total cost of the system is minimized. The inventory and production cycles in these models are assumed synchronized across the entire supply chain. Figures 1-3 illustrates the examples of

Two-, Three- and Four-Stage supply chain model.

The models are developed under the following assumptions:

Figure 1. An example of two-stage supply chain model.

・ A single product is produced and distributed up to Four-Stage non-serial multi customers supply chain

・ Production rates and demand are deterministic and uniform

・ Unsatisfied demands at the end retailers are backordered

・ Ordering/setup costs, holding costs are, shortage costs the same for firms at the same stage

・ A lot produced at stage is sent in equal shipments to the upstream stage.

The following notations are used in the models developed; where the letters R, D, M and S are referred to Retailers, Distributors, Manufactures, and Suppliers.

Figure 2. An example of three-stage [7] supply chain model.

Figure 3. An example of four-stage [10] supply chain model.

The total annual cost for a downstream firm consist of

$\sum TC}=\text{Costofkeepingproducts}+\text{reordercost$

For example, the total annual cost for retailers is given by

${\sum}_{j}T{C}_{R,j}}={\displaystyle {\sum}_{j}\left(\frac{T{D}_{R,j}{h}_{R}}{2}+\frac{{A}_{R}}{T}\right)$ .

For a firm involves in making products, we can express it in three parts

$\sum TC}=\text{Costofmakingproduct}+\text{costofkeepingfinishedproduct}+\text{setupcost$

For example, the total annual cost for manufacturers is

${\sum}_{j}T{C}_{M,j}}={\displaystyle {\sum}_{j}\left(\frac{T{D}_{M,j}^{2}}{2{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+\frac{{A}_{M}}{T}\right)$ .

The variation on the cost of keeping finished products can determine the lowest annual cost.

We present a deterministic Four-Stage supply chain model formulated for two inventory coordination mechanisms―Equal Cycle Time (ECT) and Integer Multipliers (IM). The mathematical formulation for Two- and Three-Stage can be derived accordingly by reducing the model into required stage. Under the configuration, a firm can supply any customer in the adjacent upstream stage.

3. Four-Stage Supply Chain Models

Four-Stage supply chain model example based on [10] is depicted in Figure 3. The chain consists of a supplier, two manufacturers, four distributors and six retailers.

First, we discuss the coordination mechanisms, i.e., the equal cycle time and the integer multipliers. Let T is the basic cycle time. In Equal Cycle Time (ECT) mechanism, all firms in the chain have similar cycle time T. In contrast, for the Integer Multipliers (IM) mechanism models firms, each stage use the same cycle time but the cycle time at each stage is multiplied by an integer of the cycle time at the adjacent downstream stage. This implies that ${T}_{D}={K}_{D}T$ , ${T}_{M}={K}_{M}{K}_{D}T$ and ${T}_{S}={K}_{S}{K}_{M}{K}_{D}T$ where ${K}_{D}$ , ${K}_{M}$ , ${K}_{S}$ and ${T}_{D}$ , ${T}_{M}$ , ${T}_{S}$ are the IM and cycle times for Distributors, Manufacturers and Suppliers respectively.

3.1. Equal Cycle Time (ECT)

Under ECT, the total annual cost for four-stage model is summarized as Equation (1)

$\begin{array}{c}{\displaystyle \sum TC}={\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}\left(\frac{T{D}_{R,j}}{2}{h}_{R}+\frac{{A}_{R}}{T}\right)}+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{T{D}_{D,j}^{2}}{2{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+\frac{{A}_{D}}{T}\right)}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{T{D}_{M,j}^{2}}{2{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+\frac{{A}_{M}}{T}\right)}+{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{T{D}_{S,j}^{2}}{2{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+\frac{{A}_{S}}{T}\right)}\\ =\frac{T}{2}[{\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\frac{T{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)}+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\frac{T{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\frac{T{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)}]+\frac{1}{T}\left({N}_{R}{A}_{R}+{N}_{D}{A}_{D}+{N}_{M}{A}_{M}+{N}_{S}{A}_{S}\right)\end{array}$ (1)

Let

$W=\frac{T}{2}[{\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\frac{T{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)}+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\frac{T{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)}$ $+{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\frac{T{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)}]$

and $Y=\frac{1}{T}\left({N}_{R}{A}_{R}+{N}_{D}{A}_{D}+{N}_{M}{A}_{M}+{N}_{S}{A}_{S}\right)$ .

The algebraic solution for the T and TC can be obtained using simple procedure as follows:

With $TC=WT+\frac{Y}{T}$ , then $\frac{\text{d}TC}{\text{d}t}=W-\frac{Y}{{T}^{2}}$ .

Equating $\frac{\text{d}TC}{\text{d}t}=0$ , we then have $W-\frac{Y}{{T}^{2}}=0$ , thus giving the solution as

Equation (2)

${T}_{opt}=\sqrt{\frac{Y}{W}}$ and $T{C}_{opt}=2\sqrt{WY}$ . (2)

3.2. Khouja’s Model

During non-production times [7] , the distributors’ inventory drop every T years by $T{D}_{D,j}$ which reduce the annual holding cost to $0.5\left({K}_{D}-1\right)T{D}_{D,j}{h}_{D}$ . The same applies to manufacturers and suppliers where the costs are reduced to $0.5{K}_{D}\left({K}_{M}-1\right)T{D}_{M,j}{h}_{M}$ and $0.5{K}_{D}{K}_{M}\left({K}_{S}-1\right)T{D}_{S,j}{h}_{S}$ respectively. Thus, we obtain Equation (3) as follows

$\begin{array}{c}{\displaystyle \sum TC}={\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}\left(\frac{T{D}_{R,j}}{2}{h}_{R}+\frac{{A}_{R}}{T}\right)}\end{array}$ $+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{{K}_{D}T{D}_{D,j}^{2}}{2{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+\frac{\left({K}_{D}-1\right)T{D}_{D,j}}{2}{h}_{D}+\frac{{A}_{D}}{{K}_{D}T}\right)}\text{\hspace{0.17em}}\text{\hspace{0.17em}}$ $+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{{K}_{D}{K}_{M}T{D}_{M,j}^{2}}{2{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+\frac{{K}_{D}\left({K}_{M}-1\right)T{D}_{M,j}}{2}{h}_{M}+\frac{{A}_{M}}{{K}_{D}{K}_{M}T}\right)}\text{\hspace{0.17em}}\text{\hspace{0.17em}}$ $+{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{{K}_{D}{K}_{M}{K}_{S}T{D}_{S,j}^{2}}{2{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+\frac{{K}_{D}{K}_{M}\left({K}_{S}-1\right)T{D}_{S,j}}{2}{h}_{S}+\frac{{A}_{S}}{{K}_{D}{K}_{M}{K}_{S}T}\right)}$ (3)

Rearranging Equation (3) as Equation (4), we have

$\begin{array}{c}{\displaystyle \sum TC}=\frac{T}{2}[{K}_{D}[{K}_{M}({K}_{S}{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+{D}_{S,j}{h}_{S}\right)}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+{D}_{M,j}{h}_{M}\right)}-{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}{D}_{S,j}{h}_{S}})\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+{D}_{D,j}{h}_{D}\right)}-{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}{D}_{M,j}{h}_{M}}]+{\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}-{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}{D}_{D,j}{h}_{D}}]+\frac{1}{T}\left({N}_{R}{A}_{R}+\frac{{N}_{D}{A}_{D}}{{K}_{D}}+\frac{{N}_{M}{A}_{M}}{{K}_{D}{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{D}{K}_{M}{K}_{S}}\right)\end{array}$ (4)

and let

${\alpha}_{D}={\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+{D}_{D,j}{h}_{D}\right)}$ , ${\alpha}_{M}={\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+{D}_{M,j}{h}_{M}\right)}$

${\alpha}_{S}={\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+{D}_{S,j}{h}_{S}\right)}$ , ${\beta}_{RD}={\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}-{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}{D}_{D,j}{h}_{D}}$

${\beta}_{M}={\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}{D}_{M,j}{h}_{M}}$ , ${\beta}_{S}={\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}{D}_{S,j}{h}_{S}}$ ,

$\omega =\left({N}_{R}{A}_{R}+\frac{{N}_{D}{A}_{D}}{{K}_{D}}+\frac{{N}_{M}{A}_{M}}{{K}_{D}{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{D}{K}_{M}{K}_{S}}\right)$

$\omega ={N}_{R}{A}_{R}+\frac{{\phi}_{D}}{{K}_{D}}$ and ${\phi}_{D}={N}_{D}{A}_{D}+\frac{{N}_{M}{A}_{M}}{{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{M}{K}_{S}}$ , ${\phi}_{M}={N}_{M}{A}_{M}+\frac{{N}_{S}{A}_{S}}{{K}_{S}}$

$\sum TC}=T\left[\frac{{K}_{D}}{2}\left[{K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right]+{\beta}_{RD}\right]+\frac{\omega}{T$ . Let,

$W=\frac{{K}_{D}}{2}\left({K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right)+{\beta}_{RD},\text{\hspace{0.17em}}\text{\hspace{0.17em}}Y=\omega .$ (5)

Differentiating $\frac{\text{d}TC}{\text{d}T}$ then solving for $\frac{\text{d}TC}{\text{d}T}=0$ , we obtain Equation (6)

$\begin{array}{l}T=\sqrt{\frac{2\omega}{{K}_{D}\left[{K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right]+{\beta}_{RD}}}\\ TC=\sqrt{2\left[{K}_{D}\left[{K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right]+{\beta}_{RD}\right]\omega}.\end{array}$ (6)

Next, differentiating and solving for $\frac{\text{d}TC}{\text{d}{K}_{D}}=0$ , $\frac{\text{d}TC}{\text{d}{K}_{M}}=0$ and $\frac{\text{d}TC}{\text{d}{K}_{S}}=0$ we

then have Equation (7)

$\begin{array}{l}{K}_{S}^{opt}=\sqrt{\frac{\left({\alpha}_{M}-{\beta}_{S}\right){N}_{S}{A}_{S}}{{\alpha}_{S}{N}_{M}{A}_{M}}},\text{\hspace{1em}}{K}_{M}^{opt}=\sqrt{\frac{\left({\alpha}_{D}-{\beta}_{M}\right){\phi}_{M}}{\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right){N}_{D}{A}_{D}}}\\ {K}_{D}^{opt}=\sqrt{\frac{{\beta}_{RD}{\phi}_{D}}{\left[{K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right]{N}_{R}{A}_{R}}}.\end{array}$ (7)

Substituting (7) in (6), gives us ${T}_{opt}$ and $T{C}_{opt}$ .

3.3. Our Proposed Model―AMH

Our proposed model AMH-Ahmad, Mohamad and Halawani is an improvement based on Three-Stage model [8] . Instead of using both algebraic and searching algorithm, we will show our model requires only a mathematical formulation in obtaining the results.

In this model, goods produced at any stage are delivered to the upstream stage in equal shipments as they are produced and depend on the cycle time of the stage. In 4-Stage model, the inventory level of distributors at the beginning is at its minimum level which is equal to ${D}_{D,j}^{2}/{P}_{D,j}$ . Then it starts to increase at the rate of ${P}_{D,j}-{D}_{D,j}$ until it reaches its peak at $\left({P}_{D,j}-{D}_{D,j}\right){K}_{D}T{D}_{D,j}/{P}_{D,j}$ . Then it is consumed at the rate ${D}_{D,j}$ until the end of the cycle.

For manufacturers and suppliers, their respective inventory levels reach their peaks at $\left({P}_{M,j}-{D}_{M,j}\right){K}_{D}{K}_{M}T{D}_{M,j}/{P}_{M,j}$ and $\left({P}_{S,j}-{D}_{S,j}\right){K}_{D}{K}_{M}{K}_{S}T{D}_{S,j}/{P}_{S,j}$ . These then consumed at the respective rate of ${K}_{D}{D}_{M,j}$ and ${K}_{D}{K}_{M}{D}_{S,j}$ until the end of the cycle. The total annual cost for Four-Stage AMH model can be summarized as Equation (8)

Rearranging Equation (8) as Equation (9), we obtain

$\begin{array}{c}{\displaystyle \sum TC}=\frac{T}{2}[{K}_{D}({K}_{M}({K}_{S}{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+\frac{\left({P}_{S,j}-{D}_{S,j}\right){h}_{S}{D}_{S,j}}{{P}_{S,j}}\right)}\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+\frac{\left({P}_{M,j}-{D}_{M,j}\right){h}_{M}{D}_{M,j}}{{P}_{M,j}}\right)}-{\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}{h}_{S}{D}_{S,j}})\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+\frac{\left({P}_{D,j}-{D}_{D,j}\right){h}_{D}{D}_{D,j}}{{P}_{D,j}}\right)}-{\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}{h}_{M}{D}_{M,j}})\\ \text{\hspace{0.17em}}\text{\hspace{0.17em}}+{\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}-{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}{h}_{D}{D}_{D,j}}]+\frac{1}{T}\left({N}_{R}{A}_{R}+\frac{{N}_{D}{A}_{D}}{{K}_{D}}+\frac{{N}_{M}{A}_{M}}{{K}_{D}{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{D}{K}_{M}{K}_{S}}\right)\end{array}$ (9)

and let

${\alpha}_{D}={\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}\left(\frac{{D}_{D,j}^{2}}{{P}_{D,j}}\left({h}_{M}+{h}_{D}\right)+\frac{\left({P}_{D,j}-{D}_{D,j}\right){h}_{D}{D}_{D,j}}{{P}_{D,j}}\right)}$ , ${\beta}_{M}={\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}{h}_{M}{D}_{M,j}}$

${\alpha}_{M}={\displaystyle \underset{j=1}{\overset{{N}_{M}}{\sum}}\left(\frac{{D}_{M,j}^{2}}{{P}_{M,j}}\left({h}_{S}+{h}_{M}\right)+\frac{\left({P}_{M,j}-{D}_{M,j}\right){h}_{M}{D}_{M,j}}{{P}_{M,j}}\right)}$ , ${\beta}_{RD}={\displaystyle \underset{j=1}{\overset{{N}_{R}}{\sum}}{D}_{R,j}{h}_{R}}-{\displaystyle \underset{j=1}{\overset{{N}_{D}}{\sum}}{h}_{D}{D}_{D,j}}$

${\alpha}_{S}={\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}\left(\frac{{D}_{S,j}^{2}}{{P}_{S,j}}\left({h}_{0}+{h}_{S}\right)+\frac{\left({P}_{S,j}-{D}_{S,j}\right){h}_{S}{D}_{S,j}}{{P}_{S,j}}\right)}$ , ${\beta}_{S}={\displaystyle \underset{j=1}{\overset{{N}_{S}}{\sum}}{h}_{S}{D}_{S,j}}$

$\omega ={N}_{R}{A}_{R}+\frac{{N}_{D}{A}_{D}}{{K}_{D}}+\frac{{N}_{M}{A}_{M}}{{K}_{D}{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{D}{K}_{M}{K}_{S}}$ , $\omega ={N}_{R}{A}_{R}+\frac{{\phi}_{D}}{{K}_{D}}$

${\phi}_{D}={N}_{D}{A}_{D}+\frac{{N}_{M}{A}_{M}}{{K}_{M}}+\frac{{N}_{S}{A}_{S}}{{K}_{M}{K}_{S}}$ , and ${\phi}_{M}={N}_{M}{A}_{M}+\frac{{N}_{S}{A}_{S}}{{K}_{S}}$

$\sum TC}=\frac{T}{2}\left[{K}_{D}\left({K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right)+{\beta}_{RD}\right]+\frac{\omega}{T$ . Let,

$W=\frac{{K}_{D}}{2}\left({K}_{M}\left({K}_{S}{\alpha}_{S}+{\alpha}_{M}-{\beta}_{S}\right)+{\alpha}_{D}-{\beta}_{M}\right)+{\beta}_{RD}$ , $Y=\omega $ ,

which is similar to Equation (5). Using (7) and (6), we can obtain ${K}_{S}^{opt}$ , ${K}_{M}^{opt}$ , ${K}_{D}^{opt}$ , ${T}_{opt}$ and $T{C}_{opt}$ .

4. Searching Algorithm

Algebraic solutions to some mathematical problems can be derived to obtain the intended results instantly. However, some difficult expressions might require the solutions to be obtained iteratively or by approximation. Three-Stage Model [8] for example, is first solved by mathematical formulation then requires a method of searching for its final solution. For this purpose, we devise a simple searching method that can provide solutions as accurate as algebraic counterparts.

Equations (1), (4) and (9) can be written in the form of Equation (10)

$TC=WT+\frac{Y}{T}$ (10)

where W and Y are constants and positive. This gives TC > 0 and depends on T.

To illustrates this, Figure 4 shows an example for $TC=WT+Y/T$ where W = 1 and Y = 20. The blue line (straight) ${Y}_{1}=T$ and the red hyperbola (curve) ${Y}_{2}=20/T$ meets to yield an optimal annual cost, $T{C}_{opt}$ on the green line function $TC$ .

A simple search to determine ${T}_{opt}$ and $T{C}_{opt}$ based on Figure 5 is presented as follows. First, an initial value for $T{C}_{opt}$ is required prior to perform the search. Let $T$ , ${T}_{S}$ , ${T}_{E}$ and ${T}_{A}$ are the respective cycle time, its start, end and accuracy that create the main loop. Since the bounds of cycle time T is $\left(0,1\right)$ , then we can select ${T}_{S}=0.01$ and ${T}_{E}=0.99$ . For ${T}_{A}$ , the good choice is within 0.001 to 0.00001 (3 to 5 decimal places accuracy).

The main loop is sufficient for Equation (1); however Equations (4) and (9) involve integer multipliers which require more calculations. In addition to the loop created by cycle time T, the number of multipliers used in IM mechanisms generates more loops. The bounds set for these mechanisms determine the number of repetition required. For Four-Stage IM, the number of loops generated are ${L}_{D}\times {L}_{M}\times {L}_{S}$ where ${L}_{D}$ , ${L}_{M}$ and ${K}_{S}$ are the respective limits for

Figure 4. The sketch of an optimal solution for ${T}_{opt}$ and $T{C}_{opt}$ .

Figure 5. Searching for an optimal solution for ${T}_{opt}$ and $T{C}_{opt}$ .

${K}_{D}$ , ${K}_{M}$ and ${K}_{S}$ . When these limits are reached the loops terminate, giving us ${T}_{opt}$ , $T{C}_{opt}$ and the optimal values of multipliers.

We present the flowchart for Searching for an Optimal Solution for ${T}_{opt}$ and $T{C}_{opt}$ for Four-Stage IM model as depicted in Figure 5.

For Three-Stage IM model skips ${K}_{D}$ ; for Two-Stage IM model skips ${K}_{D}$ and ${K}_{M}$ ; and for Multi-Stage ECT model skips ${K}_{D}$ , ${K}_{M}$ and ${K}_{S}$ .

5. Results and Discussion

Figures 6-8 are the results for the respective Two-, Three- and Four-Stage models run on Visual Basic Programming platform. The sample data [7] is used for Two- and Three-Stage (Figure 6 and Figure 7) whilst for Four-Stage (Figure 8) we have considered the sample [9] . Figure 9 shows the nature of total costs where the optimal value for each stage and mechanism exists.

For Three-Stage model as shown in Figure 7, our model (AMH) yields similar results as [8] at 45,987 but the advantage is we are able to solve it algebraically or

Figure 6. The detail results for two-stage supply chain models.

Figure 7. The detail results for three-stage supply chain models.

via searching. A better improvement over ECT and [7] is clear, both at 54,688 and 51,960 respectively. Another saving is also shown in Two-Stage model (Figure 6), where the total cost for AMH is 23,859 in comparison to 26,486 and 25,933. More convincing result is shown further in Four-Stage model, Figure 8. AMH shows very much further reduction with the total cost of 51,400. The saving over ECT for three different stages is 10%, 16% 35% compared to KH of 2%, 5% and 25%.

Figure 9 displays a clear behavior of total costs $TC=WT+Y/T$ , $W,Y>0$ for each model and mechanism.

Figure 8. The detail results for four-stage supply chain models.

Figure 9. The graph for two, three and four-stage supply chain models.

These significant gains in all cases are due to proper handling of finished products within non-production activities. These products are shipped as soon as they are produced, thus saving the holding cost drastically. This can be seen from the reduction in individual cost for distributors, manufacturers and suppliers in Figure 8 for each mechanism.

Algebraically, it has been shown in each case that there exists only one optimal value. The dots represent the optimal value for the mechanisms in each model. This is similar to the chart depicted in Figures 6-8 which shows the evidence that AMH is a far better scheme over ECT and [7] . The searching technique used also yields the same results as the algebraic solutions as shown in Figures 6-8.

For searching algorithm, the time taken for Two-, Three- and Four-Stage are measured in second. Their respective times are 0.81, 1.51 and 3.09 seconds and running under Inter® Core^{TM}2 duo T6500 Processor. The latest processor with faster speed would reduce further the time required to produce the results. It is clear that the results are obtainable via mathematical formulation or perform searching algorithm.

6. Conclusions

To date, supply chains are spanning thousands of miles across the globe involving numerous suppliers, manufacturers, distributors, wholesalers, dealers, retailers and finally to customers (consumers). All are important in each of their scopes and interdependent on one another. It is consumers who create the demand based on manufacturers’ goods produced. If consumers reduce the consumption of a particular product, its supply also has to be reduced to balance the demand.

In this paper we have developed AMH model to obtain optimal solutions for Two-, Three- and Four-Stage Supply Chain models. Our AMH model has shown promising results in comparison to ECT and [7] . Besides deriving algebraic solutions, a simple searching method is successfully applied in obtaining optimal total costs and its integer multipliers.

The model is just tested on deterministic demand; however, this can be extended to deal with other issues, variations and constraints such as stochastic demand or other costs incurred. Developing a computerized system that can handle transactions in small or medium business is feasible. The system should be able to perform some required tasks in simple Two-Stage to bigger N-Stage models that involve more firms and with the variation in supply chain management.

Acknowledgements

This project was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah under grant no 499/830/1431. The authors, therefore, acknowledge with thanks to DSR technical and financial support.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

*Journal of Software Engineering and Applications*,

**10**, 663-676. doi: 10.4236/jsea.2017.108036.

[1] | Nahmias, S. (2005) Production and Operations Analysis. 5th Edition, McGraw-Hill/Irwin, Singapore. |

[2] | Simchi-Levi, D., Kaminsky, P. and Simchi-Levi, E. (2008) Designing & Managing the Supply Chain: Concepts, Strategies, and Case Studies. 3rd Edition, McGraw Hill/Irwin, Boston. |

[3] | Shapiro, J.F. (2009) Modeling the Supply Chain. 2nd Edition, Cengage Learning, Duxbury, MA. |

[4] |
Ben-Daya, M., Darwish, M. and Ertogral, K. (2008) The Joint Economic Lot Sizing Problem: Review and Extensions. European Journal of Operational Research, 185, 726-742. https://doi.org/10.1016/j.ejor.2006.12.026 |

[5] |
Khouja, M. and Goyal, S. (2008) A Review of the Joint Replenishment Problem Literature: 1989-2005. European Journal of Operational Research, 186, 1-16.
https://doi.org/10.1016/j.ejor.2007.03.007 |

[6] |
Seliaman, M.E. (2013) Optimizing the Two-Stage Supply Chain Inventory Model with Full Information Sharing and Two Backorders Costs Using Hybrid Geometric-Algebraic Method. Journal of Optimization, 5 p.
https://doi.org/10.1155/2013/519180 |

[7] |
Khouja, M. (2003) Optimizing Inventory Decisions in a Multi-Stage Multi-Customer Supply Chain. Transportation Research Part E Logistics and Transportation Review, 39, 193-208. https://doi.org/10.1016/S1366-5545(02)00036-4 |

[8] |
Ben-Daya, M. and Al-Nassar, A. (2008) An Integrated Inventory Production System in a Three-Layer Supply Chain. Journal of Production Planning and Control, 19, 97-104. https://doi.org/10.1080/09537280801895930 |

[9] |
Saif, A.-W.A., Seliaman, M.E. and Ahmad A.R. (2006) Simulation Optimization of a Four-Stage Supply Chain System. IEEE 2nd Information and Communication Technologies, 2006. ICTTA '06, Damascus, 24-28 April 2006, 2798-2802.
https://doi.org/10.1109/ictta.2006.1684855 |

[10] |
Seliaman, M.E. and Ahmad, A.R. (2009) A Generalized Algebraic Model for Optimizing Inventory Decisions in A Multi-Stage Complex Supply Chain. Transportation Research Part E, 45, 409-418. https://doi.org/10.1016/j.tre.2008.09.012 |

[11] |
Cárdenas-Barrón, L.E. (2007) Optimizing Inventory Decisions in a Multi-Stage Multi-Customer Supply Chain: A Note. Transportation Research Part E, 43, 647-654. https://doi.org/10.1016/j.tre.2005.09.011 |

[12] |
Leung, K.N.F. (2009) A Technical Note on Optimizing Inventory Decisions in a Multi-Stage Multi-Customer Supply Chain. Transportation Research Part E, 45, 572-582. https://doi.org/10.1016/j.tre.2009.01.007 |

Copyright © 2018 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.