Two-storage inventory model with lot-size dependent fuzzy lead-time under possibility constraints via genetic algorithm

Multi-item inventory models with stock dependent demand and two storage facilities are developed in a fuzzy environment where processing time of each unit is fuzzy and the processing time of a lot is correlated with its size. These are order-quantity reorder-point models with back-ordering if required. Here possibility and crisp constraints on investment and capacity of the small storehouse respectively are considered. The models are formulated as fuzzy chance constrained programming problem and is solved via generalized reduced gradient (GRG) technique when crisp equivalent of the constraints are available. A genetic algorithm (GA) is developed based on fuzzy simulation and entropy where region of search space gradually decreases to a small neighborhood of the optima and it is used to solve the models whenever the equivalent crisp form of the constraint is not available. The models are illustrated with some numerical examples and some sensitivity analyses have been done. For some particular cases results observed via GRG and GA are compared.     

On (<Emphasis Type="Italic">T,S</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>) Policy Inventory Model for Deteriorating Items with Time Proportional Demand

This paper considers the economic order-quantity model when shortages are allowed for the situation of fixed cycle time and increasing (or decreasing) levels of order quantities for the time proportional demand and in which items of inventory deteriorate at a constant rate. The results are supported with the help of an example. Sensitivity analysis is also discussed for the given model.     

Simple expressions for finding recovery system inventory control parameter values

In recent years considerable effort has been devoted to the development of inventory control models for joint manufacturing and remanufacturing. Optimality of control policies is analyzed and algorithms for the determination of parameter values have been developed. However, there is still a lack of formulae or algorithms that allow for an easy computation of optimal or near optimal policy parameter values. This paper addresses the problem of computing the produce-up-to level S and the remanufacture-up-to level M in a periodic review inventory control model. We provide simple formulae for the policy parameter values, which can easily be implemented within spreadsheet applications. The approach is to derive news-vendor-type formulae that are based on underage and overage cost considerations. We propose different formulae depending on whether lead times for production and remanufacturing are identical or not. A numerical study shows that the obtained solutions provide relatively small cost deviations compared to the optimal solution within the investigated class of inventory control policies.     

Convenient expressions for computing the exact annual cost of a continuous-review (<Emphasis Type="Italic">Q</Emphasis>,<Emphasis Type="Italic">R</Emphasis>) system with backordering

For a continuous-review order-quantity reorder point system, the ‘average on-hand inventory level’ (‘AOI’) is often computed by the approximate Hadley–Whitin expression, while the exact AOI is given by a double integral that appears daunting to both students and practitioners. This paper presents exact AOI expressions that are simple enough to be executed by the most basic business softwares. Numerical examples are provided to illustrate the ease of using these expressions as well as the necessity of using them in situations where the standard Hadley–Whitin approximation becomes too inaccurate.     

具有定价和开机成本的生产-库存系统的最优(s,d,S)策略

考虑一个具有有限容量和开机成本的连续盘点生产-库存系统, 其控制策略为(s,d,S)策略. 未被满足的需求都会丢失. 当机器处于关闭状态时,库存产品可以两个不同的价格进行销售. 当机器处于开机状态时,库存只能以较高的价格进行销售. 研究了如何发现该系统下的最优(s,d,S)策略,并开发了用于计算最优控制参数的有效算法.     

Búsqueda exhaustiva por entornos aplicada al diseño económico de bóvedas de hormigón armado

This paper presents two gradient algorithms applied to the economic optimization of reinforced concrete vaults, typically used in the construction of underpasses. The algorithms are gradient multi start neighbourhood exhaustive search procedures. The vault is defined by 45 design variables and the objective function is an economic one. Both methods have been applied to a vault of 12.40 m of diameter and 3.00 m of lateral walls. Design variables have been coded in base 2 for algorithms GB1 and in Gray coding for GB2. The neighbourhood is defined by the set of solutions that differ in one bit. The Gray coding solves the lack of proximity between two solutions typical of the ordinary binary coding. The positive effect of the Gray coding is proven in the present paper, where the average cost of 3,000 runs of GB2 improves by 3.81% a similar run by algorithm GB1. In addition, GB2 attains the best cost solution. The paper includes a stop criterion for the algorithm based on the stability of the statistics of the multi start results. The algorithms are simple and can be applied to other structural problems. The structure of best cost has a high slenderness and a span to depth ratio of 40. The study reports savings of 6% when compared to a design by an experienced practitioner office.     

(<Emphasis Type="Italic">Q,r</Emphasis>) Inventory Model with a Mixture of Lost Sales and Time-Weighted Backorders

This paper presents a stochastic inventory model for situations in which, during a stockout period, a fraction β of the demand is backordered and the remaining fraction 1 – β is lost. The model is suggested by the customers' different reactions to a stockout condition: during the stockout period, some patient customers wait until their demand is satisfied, while other impatient or urgent customers cannot wait and have to fill their demand from another source. The cost of a backorder is assumed to be proportional to the length of time for which the backorder exists, and a fixed penalty cost is incurred per unit of lost demand. Based on a heuristic treatment of a lot-size reorder-point policy, a mathematical model representing the average annual cost of operating the inventory system is developed. The optimal operating policy variables minimizing the average annual cost can be calculated iteratively. At the extremes β = 1 and β = 0, the model presented reduces to the usual backorders and lost sales case, respectively.     

CVaR准则下两条供应链的促销努力竞争与链内协调研究

研究两条供应链相互竞争下决策者风险厌恶程度的影响和链内协调问题。针对两条分别由风险中性制造商和风险厌恶零售商组成、进行订货与促销竞争的可替代产品供应链,假定需求随机且依赖于促销努力水平与产品合格率,利用条件风险值(CVaR)方法和博弈理论建立了对应两条供应链均为分散式供应链(DD模式)、均为集中式供应链(II模式)、一条为分散式供应链一条为集中式供应链(DI模式)的EPEC、Nash和MPEC竞争决策模型,给出了三种模式下的竞争均衡决策、以及零售商为风险厌恶者时可实现链内协调的回购加促销补贴契约。进一步分析了零售商风险中性情况。最后的算例验证了模型的合理性和协调契约的有效性。研究表明,零售商越厌恶风险,其订货量越低;产品合格率越高,零售商的促销努力水平越大;供应链协调是供应链竞争下的占优策略。     

An analytical method for cost analysis in multi-stage supply chains: A stochastic network model approach

This paper studies the cost distribution characteristics in multi-stage supply chain networks. Based on the graphical evaluation and review technique, we propose a novel stochastic network mathematical model for cost distribution analysis in multi-stage supply chain networks. Further, to investigate the effects of cost components, including the procurement costs, inventory costs, shortage costs, production costs and transportation costs of supply chain members, on the total supply chain operation cost, we propose the concept of cost sensitivity and provide corresponding algorithms based on the proposed stochastic network model. Then the model is extended to analyze the cost performance of supply chain robustness under different order compensation ability scenarios and the corresponding algorithms are developed. Simulation experiment shows the effectiveness and flexibility of the proposed model, and also promotes a better understanding of the model approach and its managerial implications in cost management of supply chains.     

Sourcing from suppliers with random yield for price-dependent demand

We study a multi-period inventory planning problem. In each period, the firm under consideration can source from two possibly unreliable suppliers for a price-dependent demand. Our analysis suggests that the optimal procurement policy is neither a simple reorder-point policy nor a complex one without any structure, as previous studies suggest. Instead, we prove the existence of a reorder point for each supplier. No order is placed to that supplier for any inventory level above the reorder point and a positive order is issued to that supplier for almost every inventory level below the reorder point. We characterize conditions under which the optimal policy reveals monotone response to changes in the inventory level. Furthermore, two special cases of our model are examined in detail to demonstrate how our analysis generalizes a number of well-known results in the literature.     

Computing the Expected Markov Reward Rates with Stationarity Detection and Relative Error Control

By combining in a novel way the randomization method with the stationary detection technique, we develop two new algorithms for the computation of the expected reward rates of finite, irreducible Markov reward models, with control of the relative error. The first algorithm computes the expected transient reward rate and the second one computes the expected averaged reward rate. The algorithms are numerically stable. Further, it is argued that, from the point of view of run-time computational cost, for medium-sized and large Markov reward models, we can expect the algorithms to be better than the only variant of the randomization method that allows to control the relative error and better than the approach that consists in employing iteratively the currently existing algorithms that use the randomization method with stationarity detection but allow to control the absolute error. The performance of the new algorithms is illustrated by means of examples, showing that the algorithms can be not only faster but also more efficient than the alternatives in terms of run-time computational cost in relation to accuracy.     

Forward differential dynamic programming

The dynamic programming formulation of the forward principle of optimality in the solution of optimal control problems results in a partial differential equation with initial boundary condition whose solution is independent of terminal cost and terminal constraints. Based on this property, two computational algorithms are described. The first-order algorithm with minimum computer storage requirements uses only integration of a system of differential equations with specified initial conditions and numerical minimization in finite-dimensional space. The second-order algorithm is based on the differential dynamic programming approach. Either of the two algorithms may be used for problems with nondifferentiable terminal cost or terminal constraints, and the solution of problems with complicated terminal conditions (e.g., with free terminal time) is greatly simplified.     

Type II sensitivity analysis of cost coefficients in the degenerate transportation problem

This paper focuses on sensitivity analysis of the degenerate transportation problem (DTP) when perturbation occurs on one cost coefficient. The conventional Type I sensitivity analysis of the transportation problem (TP) determines the perturbation ranges for the invariant optimal basis. Due to different degenerate optimal basic solutions yielding different Type I ranges, the Type I range is misleading for the DTP. Type II sensitivity analysis, which determines the perturbation ranges for the invariant shipping pattern, is more practical for the DTP. However, it is too tedious to obtain Type II ranges by enumerating all optimal basic solutions and all primal optimal basic solutions while getting the union of each corresponding Type I ranges. Here, we propose two labeling algorithms to determine the Type II ranges of the cost coefficient. Besides, three lemmas are provided for obtaining the upper bound or lower bound of the Type II ranges of the cost coefficient directly under specific conditions of the DTP. A numerical example is given to demonstrate the procedure of the proposed labeling algorithms and computational results have been provided.     

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

Traditionally, minimum cost transshipment problems have been simplified as linear cost problems, which are not practical in real applications. Some advanced local search algorithms have been developed to solve concave cost bipartite network problems. These have been found to be more effective than the traditional linear approximation methods and local search methods. Recently, a genetic algorithm and an ant colony system algorithm were employed to develop two global search algorithms for solving concave cost transshipment problems. These two global search algorithms were found to be more effective than the advanced local search algorithms for solving concave cost transshipment problems. Although the particle swarm optimization algorithm has been used to obtain good results in many applications, to the best of our knowledge, it has not yet been applied in minimum concave cost network flow problems. Thus, in this study, we employ an arc-based particle swarm optimization algorithm, coupled with some genetic algorithm and threshold accepting method techniques, as well as concave cost network heuristics, to develop a hybrid global search algorithm for efficiently solving minimum cost network flow problems with concave arc costs. The proposed algorithm is evaluated by solving several randomly generated network flow problems. The results indicate that the proposed algorithm is more effective than several other recently designed methods, such as local search algorithms, genetic algorithms and ant colony system algorithms, for solving minimum cost network flow problems with concave arc costs.     

Batch Delivery Scheduling on a Single Machine

The problem of partitioning a set of independent and simultaneously available jobs into batches and sequencing them for processing on a single machine is presented. Jobs in the same batch are to be delivered together, upon completion of the last job in the batch. Jobs finished before this time have to wait until delivery. There are a delivery cost depending on the number of batches formed and an earliness cost for jobs finished before delivery. The dynamic programming approach to minimizing the total cost is considered, yielding two pseudopolynomial algorithms when the number of batches has a fixed upper bound. A polynomial algorithm for a special case of the problem is also presented.     

Reducing lost-sales rate in (T, R, L) inventory model with controllable lead time

In order to establish a good image and to enhance customer’s loyalty, many efforts such as upgrading the servicing facilities, maintaining a high quality of products and increasing expenditure on advertisement could be made by a selling shop. Naturally, an extra-added cost must be spent for these efforts and it is expected to have a result to reduce the shortage cost of lost-sales and the total expected annual cost. This paper explores a probabilistic inventory model with optimal lost-sales caused by investment due to two different types of cost functions. We consider that the lead time can be shortened at an extra crashing cost, which depends on the length of the lead time. Moreover, we assume that the lost-sales rate can also be reduced by capital investment. The purpose of this paper is to establish a (T, R, L) inventory model with controllable lead time and to analyze the effects of increasing two different types of investments to reduce the lost-sales rate, in which the review period, lead time and lost-sales rate are treated as decision variables. We first formulate the basic periodic review model mathematically with the capital investment to reduce lost-sales rate. Then two models are discussed, one with normally distributed protection interval demand and another with distribution-free case. For each model, two investment cost functional forms, logarithmic and power, are employed for lost-sales rate reduction. Two computational algorithms with the help of the software Matlab are furnished to determine the optimal solution. In addition, six numerical examples and sensitivity analysis are presented to illustrate the theoretical results and obtain some managerial insights. Finally, the effect of lost-sales rate reduction is investigated. By framing this new model, we observe that a significant amount of savings can be easily achieved to increase the competitive edge in business. The results in the numerical examples indicate that the savings of expected annual total cost are realized through lost-sales reduction.     

Polynomial cases of the economic lot sizing problem with cost discounts

In this paper we study the economic lot sizing problem with cost discounts. In the economic lot sizing problem a facility faces known demands over a discrete finite horizon. At each period, the ordering cost function and the holding cost function are given and they can be different from period to period. There are no constraints on the quantity ordered in each period and backlogging is not allowed. The objective is to decide when and how much to order so as to minimize the total ordering and holding costs over the finite horizon without any shortages. We study two different cost discount functions. The modified all-unit discount cost function alternates increasing and flat sections, starting with a flat section that indicates a minimum charge for small quantities. While in general the economic lot sizing problem with modified all-unit discount cost function is known to be NP-hard, we assume that the cost functions do not vary from period to period and identify a polynomial case. Then we study the incremental discount cost function which is an increasing piecewise linear function with no flat sections. The efficiency of the solution algorithms follows from properties of the optimal solution. We computationally test the polynomial algorithms against the use of CPLEX.     

Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods

This article presents two methods for developing algorithms of computing scalar multiplication in groups of points on an elliptic curve over finite fields. Two new effective algorithms have been presented: one of them is based on a binary Non-Adjacent Form of scalar representation and another one on a binary of scalar representation method. All algorithms were developed based on simple and composite operations with point and also based on affine and Jacobi coordinates systems taking into account the latest achievements in computing cost reduction. Theorems concerning their computational complexity are formulated and proved for these new algorithms. In the end of this article comparative analysis of both new algorithms among themselves and previously known algorithms are represented.     

考虑服务水平的逆向物流网络优化决策

针对电子产品的售后维修服务问题,建立了一个同时考虑成本和服务质量的多目标逆向物流网络优化模型;该问题是多目标的NP-hard问题,应用NSGA-II算法和多目标模拟退火算法(MOSA)两种多目标进化算法,对模型进行求解并对其求解的效果进行比较分析;多组算例测试结果表明,NSGA-II相比MOSA更具优势。     

An approximation-based approach for fuzzy multi-period production planning problem with credibility objective

This paper develops a fuzzy multi-period production planning and sourcing problem with credibility objective, in which a manufacturer has a number of plants or subcontractors. According to the credibility service levels set by customers in advance, the manufacturer has to satisfy different product demands. In the proposed production problem, production cost, inventory cost and product demands are uncertain and characterized by fuzzy variables. The problem is to determine when and how many products are manufactured so as to maximize the credibility of the fuzzy costs not exceeding a given allowable invested capital, and this credibility can be regarded as the investment risk criteria in fuzzy decision systems. In the case when the fuzzy parameters are mutually independent gamma distributions, we can turn the service level constraints into their equivalent deterministic forms. However, in this situation the exact analytical expression for the credibility objective is unavailable, thus conventional optimization algorithms cannot be used to solve our production planning problems. To overcome this obstacle, we adopt an approximation scheme to compute the credibility objective, and deal with the convergence about the computational method. Furthermore, we develop two heuristic solution methods. The first is a combination of the approximation method and a particle swarm optimization (PSO) algorithm, and the second is a hybrid algorithm by integrating the approximation method, a neural network (NN), and the PSO algorithm. Finally, we consider one 6-product source, 6-period production planning problem, and compare the effectiveness of two algorithms via numerical experiments.