Two inventory review policies on supply chain configuration problem

With increasing business competition and complexity, supply chain provides opportunity to increase business competitiveness. Supply chain configuration is an important strategy to enhance business advantage. It is a vital approach to develop new products and manage dynamic supply chain. In this paper, two inventory review policies, continuous replenishment and periodic replenishment, are modeled in the supply chain configuration problem. Harmony search is used to solve the problem. Numerical example is given to illustrate how the models work. Using three different scenarios of various average on hand inventory rate and work in process rate, both review policies are tested. The proposed model shows that the average on hand inventory plays a more significant role when compared with the work in process.     

The governing dynamics of supply chains: The impact of altruistic behaviour

This paper analyses an infinite horizon two-echelon supply chain inventory problem and shows that a sequence of the optimum ordering policies does not yield globally optimal solutions for the overall supply chain. First-order autoregressive demand pattern is assumed and each participant adopts the order-up-to (OUT) policy with a minimum mean square error forecasting scheme to generate replenishment orders. To control the dynamics of the supply chain, a proportional controller is incorporated into the OUT policy, which we call a generalised OUT policy. A two-echelon supply chain with this generalised OUT policy achieves over 10% inventory related cost reduction. To enjoy this cost saving, the attitude of first echelon player to cost increases is an essential factor. This attitude also reduces the bullwhip effect. An important insight revealed herein is that a significant amount of benefit comes from the player doing what is the best for the overall supply chain, rather than what is the best for local cost minimisation.     

An integrated approach for logistic and vendor managed inventory in supply chain

In this paper, a quaternary policy system towards integrated logistics and inventory aspect of the supply chain has been proposed. A system of multi retailers and distributors, with each distributor following a unique policy, will be analysed. The first policy is continuous time replenishment policy where the retailers’ inventory is replenished in every time interval. In the next three policies, inventory of the retailers will be replenished by some definite policy factors. The vendor managed inventory (VMI) system is used for updating the inventory of the retailers. An order-up-to policy (q, Q) is used for updating the inventory of distributors. Total erstwhile demands to the retailer will be used to determine the amount of inventory acclivity. Furthermore, the distributors will be sending the delivery vehicles to few fellow retailers who are shortlisted according to the policy, followed by the retailers and associated distributors. On the basis of random demand that the retailers are facing from end customers and the total demand that has incurred in the supply chain, products are unloaded to the selected retailers from the delivery vehicle. The path of the delivery vehicle is retrieved by dynamic ant colony optimization. In addition, a framework has been developed to measure the end-customer satisfaction level and total supply chain cost incorporating the inventory holding cost, ordering cost and the transportation cost. The framework has been numerically moulded with different settings to compare the performance of the quadruplet policies.     

考虑碳排放量与数量折扣的闭环供应链网络设计与多目标决策优化研究

由于闭环供应链网络在环境法规、客户压力等方面都受到关注,故供应商选择在供应链管理中更具挑战性,本文所提闭环供应链网络模型可解决上述问题.其中,供应商会提供数量折扣以激励买家购买更多的产品.模型的目标函数是将经济成本与碳排放量降至最低,最大限度提升客户满意度等参数,并确定出最佳的供应商、采购量、运输方式、技术类型、碳排放...     

Decomposition heuristic to minimize total cost in a multi-level supply chain network

In this paper, the distribution planning model for the multi-level supply chain network is studied. Products which are manufactured at factory are delivered to customers through warehouses and distribution centers for the given customer demands. The objective function of suggested model is to minimize logistic costs such as replenishment cost, inventory holding cost and transportation cost. A mixed integer programming formulation and heuristics for practical use are suggested. Heuristics are composed of two steps: decomposition and post improving process. In the decomposition heuristics, the problems are solved optimally only considering the transportation route first by the minimum cost flow problem, and the replenishment plan is generated by applying the cost-saving heuristic which was originally suggested in the manufacturing assembly line operation, and integrating with the transportation plan. Another heuristic, in which the original model is segmented due to the time periods, and run on a rolling horizon based method, is suggested. With the post-improving process using tabu search method, the performances are evaluated, and it was shown that solutions can be computed within a reasonable computation time by the gap of about 10% in average from the lower bound of the optimal solutions.     

A study on inventory replenishment policies in a two-echelon supply chain system

Inventory control plays an important role in supply chain management. Properly controlled inventory can satisfy customers’ demands, smooth the production plans, and reduce the operation costs; yet failing to budget the inventory expenses may lead to serious consequences. The bullwhip effect, observed in many supply chain management cases, causes excessive inventory due to information distortion, i.e. the order amount is exaggerated while a minor demand variation occurs, and the information amplified dramatically as the supply chain moves to the upstream. In this paper, one of the main causes of bullwhip effect, order batching, is considered. A simplified two-echelon supply chain system, with one supplier and one retailer that can choose different replenishment policies, is used as a demonstration. Two types of inventory replenishment methods are considered: the traditional methods (the event-triggered and the time-triggered ordering policies), and the statistical process control (SPC) based replenishment method. The results show that the latter outperforms the traditional method in the categories of inventory variation, and in the number of backlog when the fill-rate of the prior model is set to be 99%. This research provides a different approach to inventory cost-down other than the common methods like: information sharing, order batch cutting, and lead time reduction. By choosing a suitable replenishment policy, the number of backorder and the cost of inventory can be reduced.     

Development of risk based dynamic backorder replenishment planning framework using Bayesian Belief Network

Due to the rapid changes in circumstances of cooperates such as globalization, technical innovation and competition, inter-dependence among cooperates which compose supply chain has been intensified. This make cooperates be exposed to various risk and even a small uncertainty can disrupt the balance of whole supply chain. Therefore, in this paper, the framework to develop alternative backorder replenishment plan to minimize the total replenishment cost and expected risk cost has been devised. In order to model the relationship between risks and risk propagation, Bayesian Belief Network has been applied. Moreover, with the fast heuristic algorithm, breath first search and elementary stepwise system based reverse Dijkstra, the alternative backorder replenishment plan can be established. The numerical example shows how to apply the proposed framework and make dynamic backorder replenishment plan considering impact of risk.     

Incorporating lateral transfers of vehicles and inventory into an integrated replenishment and routing plan for a three-echelon supply chain

This paper focuses on developing an integrated replenishment and routing plan that takes into account lateral transfers of both vehicles and inventory for a three-echelon supply chain system including a single plant, multiple distribution centers and multiple retailers. A mixed integer programming model to the overall system is formulated first, and then an optimization-based heuristic consisting of three major components is proposed. The purpose of the first component is to assign retailers to distribution centers, and determine routing schedules for each distribution center. And the remaining two components are corresponding to two smaller optimization models – a variant of the classical transportation problem modeled for determining vehicle transfer between distribution centers, and a variant of the conventional minimum cost network flow problem modeled for determining inventory replenishment and transfer. Experimental results reveal that the proposed algorithm is rather computational effectiveness, and the pooling strategy that considers both vehicles and inventory transfers is a worthy option in designing supply chain operations.     

The replenishment policy of agri-products with stochastic demand in integrated agricultural supply chains

Market demand of agri-products is influenced by uncertain factors, such as weather, temperature, and customer preferences. In integrated agricultural supply chains, traditional inventory models are useless because of the stochastic demand and deteriorative characteristic of agri-products. This paper provides a method to determine the optimal replenishment policy of integrated agricultural supply chains with stochastic demand. In these EOQ/EPQ models, shortages are allowed and are backlogged if market demand is stochastic. The objective function is to minimize the total cost of the supply chain in the planning horizon. The total cost includes the ordering cost, the holding cost, the shortage cost and the purchasing cost. Thinking of the nonlinear relationship and dynamic forces in models, a system dynamic (SD) simulation model is constructed to find the optimal lot size and replenishment interval. Finally, an example is given to make a sensitivity analysis of the simulation model. Compared to traditional methods (such as equalize stochastic demand), the total cost decreases by 16.27% if the supply chains adopt the new replenishment policy. The results illustrated that the new replenishment policy (with intelligent method) is beneficial to help supply chain make decision scientifically. Moreover, the intelligent method can simulate stochastic demand perfectly, and it is effectively for solving the complicated and mathematically intractable replenishment problem.     

A genetic algorithm for the vendor-managed inventory routing problem with lost sales

This paper proposes a genetic algorithm (GA) for the inventory routing problem with lost sales under a vendor-managed inventory strategy in a two-echelon supply chain comprised of a single manufacturer and multiple retailers. The proposed GA is inspired by the solving mechanism of CPLEX for the optimization model of the problem. The proposed GA determines replenishment times and quantities and vehicle routes in a decoupled manner, while maximizing supply chain profits. The proposed GA is compared with the optimization model with respect to the effectiveness and efficiency in various test problems. The proposed GA finds solutions in a short computational time that are very close to those obtained with the optimization model for small problems and solutions that are within 3.2% of those for large problems. Furthermore, sensitivity analysis is conducted to investigate the effects of several problem parameters on the performance of the proposed GA and total profits.     

A differential evolution algorithm for joint replenishment problem using direct grouping and its application

There has been much work in establishing joint replenishment model and designing effective and robust algorithms. Little research has been done by direct grouping methods. In this paper, we present a differential evolution (DE) algorithm that uses direct grouping to solve joint replenishment problem (JRP). Extensive computational experiments are performed to compare the performances of the DE algorithm with results of evolutionary algorithm (GA). The experimental results indicate that the DE algorithm can find a replenishment policy that incurs a lower total cost than the GA. We also conducted a case study to test the proposed DE algorithm for the JRP. The findings suggest that the proposed model is successful in decreasing spare parts ordering costs and holding costs significantly in a power plant.     

Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point

In the supply chain, most businesses in the pre-order penetration point (pre-OPP) operate under the forecast-driven mode, so that the decisions regarding inventory are made in accordance with the forecast and replenishment planning. This paper considers the stochastic dynamic lot-sizing problem of the two-phased transportation cost, service level constraint, and cash flow under a non-deterministic demand. This problem includes a nonlinear integer programming sub-problem. Therefore, this paper proposes an optimisation replenishment policy method based on modified ant colony optimisation (ACO) and response surface methodology. The main differences between the modified ACO and the traditional ACO lie in the modified update of pheromone intensity and the dynamic mutation operator. The experimental result shows that when the demand is normal distribution, the proposed approach, successfully finds the stationary point of minimum response. Besides, in the test of the algorithm solution quality, the modified ACO is better than the traditional ACO in all scenarios.     

A joint replenishment problem considering multiple trucks with shipment and resource constraints

A joint replenishment problem (JRP) is presented to determine the optimal reordering policy for multi-items with a percentage of defective items. This JRP also has several constraints, such as shipment constraint, budget constraint, and transportation capacity constraint. At the meantime, multiple trucks, each with a fixed transportation cost, are considered and also order quantities of restricted items are not shared among the trucks during the shipment. The objective is to minimize the total expected cost per unit time. A two-dimensional genetic algorithm (GA) is provided to determine an optimal family cycle length and the reorder frequencies. A numerical example is presented and the results are discussed. Extensive computational experiments are performed to test the performance of the GA. The JRP is also solved by using an evolutionary algorithm (EA) and the results obtained from GA and EA are compared.     

Modelling and analysis of inventory replenishment for perishable agricultural products with buyer–seller collaboration

In this article, we study the inventory replenishment model for perishable agricultural products in a simple two-level supply chain. Collaborative forecasting is introduced into the inventory replenishment decisions to avoid overstocking and understocking of agricultural products, and to maximise profits. We analyse the model with ordering cost, holding cost, shortage cost, deterioration cost and opportunity lost cost of perishable agricultural products. Extensive numerical analysis is carried out to study the performance of the inventory policy. The optimal replenishment policy that minimises the total cost can be obtained from the model. It has demonstrated that the supply chain cost decreases with supplier and retailer's collaborative forecasting.     

Hybrid GA for material routing optimization in supply chain

In designing a supply chain (SC) system, the problem arises when a company has unsatisfactory inventory control policy and material routing between supplier–producer and distributor in SC considering specified cost and demand. The integration of decisions of different functions into a single optimization model is the base of this research. The aim of this paper is to study and compare the existing models of supply, production and distribution in SC and propose a model which integrates mentioned criteria in supply chain management (SCM). Furthermore, it proposes a new method for calculation of fitness function in genetic algorithm (GA) process. The successful designing of this model has led us to explore the use of heuristic methods such as GA to quantify the flow of SC, information and material flow. At first, fuzzy analytic hierarchy process (FAHP) is adapted to evaluate objective function weights in SC. Then final weights of objective function are determined by the technique for order of preference by similarity to ideal solution (TOPSIS). This research also simulated the real company SC operations, and determines the most effective strategic and operational policies for an effective SC system. The result obtained from the model shows that it is robust. This model can also be applied to other industrial environments with slight modifications.     

The multi-item replenishment problem in a two-echelon supply chain: the effect of centralization versus decentralization

This paper deals with a joint replenishment arrangement with a two-echelon supply chain, having one supplier or manufacturer and one buyer or retailer, facing a deterministic demand and selling a number of products in the marketplace. We considered a situation involving a family of products sharing a common production facility, in which there is a major setup cost for each production run and an item-specific minor processing cost for each item being added into production. The retailer also has major setup costs due to economies of scale in transportation and distribution expenses and an item-specific minor setup cost for each additional item involved in the order. In such a setting, it seemed as if it would be economically beneficial for both parties to enter into a joint replenishment arrangement. We proposed both centralized and decentralized decision models to determine the best solution to minimize costs. We proved the optimal properties of the models, developed a search algorithm and numerically illustrated the benefits generated from such an arrangement. In addition, we have proposed a profit sharing mechanism through a well-known quantity discount scheme, so that potential Pareto improvements may be achieved among the participants of a coordinated supply chain.     

A supply chain network with product remanufacturing and carbon emission considerations: a two-phase design

Growing awareness of environmental issues is prompting the development of sustainable supply chain management. Closed-loop supply chains in which used products can be returned for remanufacture are becoming increasingly popular. This paper introduces a two-phase approach to the design of supply chain networks taking into account carbon emission and remanufacturing. In the first phase, a continuous approximation model is used to design the forward supply chain network. The objective is to minimize the total forward network cost by simultaneously determining the number and the service areas of distribution centers (DCs) and the replenishment cycle time for DCs. A nonlinear optimization technique is used to solve the forward supply chain network design problem. In the second phase, a reverse supply chain network is formulated based on the results of the first phase to determine the optimal number and service areas of remanufacturing centers (RCs) and the replenishment cycle time for RCs. Finally, numerical analyses are conducted to show the solution approach and provide some managerial insights.     

A new efficient encoding/decoding procedure for the design of a supply chain network with genetic algorithms

Supply chain network (SCN) design is a strategic issue which aims at selecting the best combination of a set of facilities to achieve an efficient and effective management of the supply chain. This paper presents an innovative encoding–decoding procedure embedded within a genetic algorithm (GA) to minimize the total logistic cost resulting from the transportation of goods and the location and opening of the facilities in a single product three-stage supply chain network. The new procedure allows a proper demand allocation procedure to be run which avoids the decoding of unfeasible distribution flows at the stage of the supply chain transporting products from plants to distribution centers. A numerical study on a benchmark of problems demonstrates the statistical outperformance of the proposed approach vs. others currently available in literature in terms of total supply chain logistic cost saving and reduction of the required computation burden to achieve an optimal design.     

Multi-item integrated supply chain model for deteriorating items with stock dependent demand under fuzzy random and bifuzzy environments

In this paper, we have investigated multi-item integrated production-inventory models of supplier and retailer with a constant rate of deterioration under stock dependent demand. Here we have considered supplier’s production cost as nonlinear function depending on production rate, retailers procurement cost exponentially depends on the credit period and suppliers transportation cost as a non-linear function of the amount of quantity purchased by the retailer. The models are optimized to get the value of the credit periods and total time of the supply chain cycle under the space and budget constraints. The models are also formulated under fuzzy random and bifuzzy environments. The ordering cost, procurement cost, selling price of retailer’s and holding costs, production cost, transportation cost, setup cost of the supplier’s and the total storage area and budget are taken in imprecise environments. To show the validity of the proposed models, few sensitivity analyses are also presented under the different rate of deterioration. The models are also discussed in non deteriorating items as a special case of the deteriorating items. The deterministic optimization models are formulated for minimizing the entire monetary value of the supply chain and solved using genetic algorithm (GA). A case study has been performed to illustrate those models numerically.     

考虑多种运输方式的整车物流服务供应链订单分配问题

针对整车物流服务供应链的订单分配问题，提出了考虑多种运输方式的双层订单分配模型。首先，考虑到运输方式会影响运输成本、客户的准时送达要求等因素，建立以准时送达和最小化物流采购成本为目标的双层规划模型；其次，设计启发式算法（HA）确定各运输方式的任务量；然后，借助混合蛙跳算法（SFLA）求解各功能物流服务提供商间各运输方式的任务量分配；最后，通过不同规模的算例与遗传算法（GA）、粒子群算法（PSO）、蚁群算法（ACO）等进行求解对比。算例结果表明，与原有的成本438万元相比，所提模型得到显著优化的421万元，说明所构建模型的订单分配方案能够更有效解决整车物流的订单分配问题。实验对比表明，较传统智能算法（GA、PSO、ACO）的求解结果，两阶段的HA-SFLA算法能更快得出显著优化的结果，说明HA-SFLA算法能更好地求解考虑运输方式的双层订单分配规划模型。在满足客户送达时间要求的同时，考虑运输方式的双层订单分配模型及算法显著降低物流成本，促进物流集成商为获取更多利益而在订单分配阶段考虑运输方式。