Managing stochastic demand in an Inventory Routing Problem with transportation procurement

We study an Inventory Routing Problem in which the supplier has a limited production capacity and the stochastic demand of the retailers is satisfied with procurement of transportation services. The aim is to minimize the total expected cost over a planning horizon, given by the sum of the inventory cost at the supplier, the inventory cost at the retailers, the penalty cost for stock-out at the retailers and the transportation cost. First, we show that a policy based just on the average demand can have a total expected cost infinitely worse than the one obtained by taking into account the overall probability distribution of the demand in the decision process. Therefore, we introduce a stochastic dynamic programming formulation of the problem that allows us to find an optimal policy in small size instances. Finally, we design and implement a matheuristic approach, integrating a rollout algorithm and an optimal solution of mixed-integer linear programming models, which is able to solve realistic size problem instances. Computational results allow us to provide managerial insights concerning the management of stochastic demand.     

Scenario aggregation in single-resource production planning models with uncertain demand

In this paper we present an application of the scenario aggregation approach proposed by Rockafellar and Wets to a simple standard multi-product multi-period production planning problem with uncertain demand and setup cost modelled by logical zero-one variables. The uncertainty in demand is expressed by a number of demand scenarios. As compared with more traditional approaches that require distributional assumptions and/or estimates of parameters from historical demand data, the scenario approach offers greater flexibility and makes it possible to take subjective information into account. The scenario aggregation principle and the corresponding progressive hedging algorithm offer a theoretically sound basis for generating consistent solutions for production planning models with uncertain demand. Since the production planning problem studied in this paper is of mixed-integer type the original scenario aggregation approach cannot be applied directly. However, since the integer variables in the production planning model are indirectly coupled to the continuous production decisions an alternative method in which only the production quantities are used to couple the different realizations can be used. This paper is a first attempt to perform this form of coupling. We illustrate the ideas on a small example and use this example to demonstrate how the solution can be evaluated in terms of flexibility measures.     

Assessing the impact of uncertainty and the level of aggregation in case mix planning

In this article, we present a framework for evaluating the impact of uncertainty and the use of different aggregation levels in case mix planning on the quality of strategic decisions regarding the case mix of a hospital. In particular, we analyze the effect of modeling (i) demand, (ii) resource use, and (iii) resource availability as stochastic input parameters on the performance of case mix planning models. In addition, the consequences of taking the weekly structure with inactive days without surgeries into account are assessed (iv). The purpose of this paper is to provide a guideline for the decision-maker planning the case mix on the consideration of stochastic aspects and different aggregation levels. We formulate a mixed integer programming model for case mix planning along with different stochastic and deterministic extensions. The value of the different extensions is analyzed using a factorial design. The resulting stochastic models are solved using sample average approximation. Simulation is used to evaluate the strategies derived by the different models using real-world data from a large German hospital. We find that highly aggregated basic case mix planning models can overestimate the objective value by up to 10% and potentially lead to biased results. Refining the problem decreased the gap between projected case mix planning results and simulated results considerably and led to improved solutions.     

A Profit‐Maximizing Approach to Disposition Decisions for Product Returns*

Motivated by the asset recovery process at IBM, we analyze the optimal disposition decision for product returns in electronic products industries. Returns may be either remanufactured for reselling or dismantled for spare parts. Reselling a remanufactured unit typically yields higher unit margins. However, demand is uncertain. A common policy in many firms is to rank disposition alternatives by unit margins. We propose a profit‐maximization approach that considers demand uncertainty. We develop single period and multiperiod stochastic optimization models for the disposition problem. Analyzing these models, we show that the optimal allocation balances expected marginal profits across the disposition alternatives. A detailed numerical study reveals that our approach to the disposition problem outperforms the current practice of focusing exclusively on high‐margin options, and we identify conditions under which this improvement is the highest. In addition, we show that a simple myopic heuristic in the multiperiod problem performs well.     

Retail category management: State-of-the-art review of quantitative research and software applications in assortment and shelf space management

Retail requires efficient decision support to manage increasing product proliferation and various consumer choice effects with limited shelf space. Our goal is to identify, describe and compare decision support systems for category planning. This research analyzes quantitative models and software applications in assortment and shelf space management and contributes to a more integrated modeling approach. There are difficulties commonly involved in the use of commercial software and the implementation and transfer of scientific models. Scientific decision models either focus on space-dependent demand or substitution effects, whereas software applications use simplistic rules of thumb. We show that retail assortment planning models neglect space-elastic demand and largely also ignore constraints of limited shelf space. Shelf space management streams on the other hand, mostly omit substitution effects between products when products are delisted orout-of-stock, which is the focus of consumer choice models in assortment planning. Also, the problem sizes of the models are often not relevant for realistic category sizes. Addressing these issues, this paper provides a state-of-the-art overview and research framework for integrated assortment and shelf space planning.     

多品种集约生产计划问题的模糊方法

提出具有模糊需求量和模糊能力约束以及资本水平约束的多品种类集约生产计划问题 的模糊优化模型及模糊解方法. 通过对模糊需求量和模糊等式的描述,提出了模糊需求环境下 生产- 库存平衡方程的两种等价的描述方法, 并给出了模糊等式的实用解释. 建立了具有模 糊需求量和模糊能力约束集约生产计划问题的优化模型FMAPP ,并给出了求解模型的参数规 划方法.     

Managing Inventory with Cash Register Information: Sales Recorded but Not Demands

Inventory inaccuracy is common in many businesses. While retailers employ cash registers to enter incoming orders and outgoing sales, inaccuracy arises because they do not record invisible demand such as spoilage, damage, pilferage, or returns. This setting results in incomplete inventory and demand information. An important inventory control problem therefore is to maximize the total expected discounted profit under this setting. Allowing for dependence between demand and invisible demand, we obtain the associated dynamic programming equation with an infinite‐dimensional state space, and reduce it to a simpler form by employing the concept of unnormalized probability. We develop an analytical upper bound on the optimal profit as well as an iterative algorithm for an approximate solution of the problem. We compare profits of the iterative solution and the myopic solution, and then to the upper bound. We see that the iterative solution performs better than the myopic solution, and significantly so in many cases. Furthermore, it gives a profit not far from the upper bound, and is therefore close to optimal. Using our results, we also discuss meeting inventory service levels.     

A two-stage stochastic programming approach to employee scheduling in retail outlets with uncertain demand

This paper describes an employee scheduling system for retail outlets; it is a constraint-based system that exploits forecasts and stochastic techniques to generate schedules meeting the demand for sales personnel. Uncertain scenarios due to fluctuating demand are taken into account to develop a stochastic operational optimization of staffing levels. Mathematically, the problem is stated as a mixed-integer linear programming problem. Simulations with store data belonging to a major Swiss retailer show the effective performance of the proposed approach. The schedule quality is assessed through comparison with a deterministic scheduling package, which has been used at several outlets in Switzerland.     

Strategic supply network planning with vendor selection under consideration of risk and demand uncertainty

We present a stochastic version of a three-layer supply network planning problem that includes the selection of vendors that must be equipped with company-specific tools. The configuration of a supply network must be determined by using demand forecasts for a long planning horizon to meet a given service level. The risk induced by the uncertain demand is explicitly considered by incorporating the conditional value at risk. The objective is to maximize the weighted sum of the expected net present value of discounted cash flows and the conditional value at risk. This would lead to a non-linear model formulation that is approximated by a mixed-integer linear model. This approximation is realized by a piecewise linearization of the expected backlogs and physical inventory as non-linear functions of cumulative production quantities. A two-stage stochastic programming approach is proposed. Our numerical analysis of generic test instances indicates that solving the linearized model formulation yields a robust and stable supply network configuration when demand is uncertain.     

Revenue Management with End‐of‐Period Discounts in the Presence of Customer Learning

Consider a firm that sells identical products over a series of selling periods (e.g., weekly all‐inclusive vacations at the same resort). To stimulate demand and enhance revenue, in some periods, the firm may choose to offer a part of its available inventory at a discount. As customers learn to expect such discounts, a fraction may wait rather than purchase at a regular price. A problem the firm faces is how to incorporate this waiting and learning into its revenue management decisions. To address this problem we summarize two types of learning behaviors and propose a general model that allows for both stochastic consumer demand and stochastic waiting. For the case with two customer classes, we develop a novel solution approach to the resulting dynamic program. We then examine two simplified models, where either the demand or the waiting behavior are deterministic, and present the solution in a closed form. We extend the model to incorporate three customer classes and discuss the effects of overselling the capacity and bumping customers. Through numerical simulations we study the value of offering end‐of‐period deals optimally and analyze how this value changes under different consumer behavior and demand scenarios.     

不同权力结构下制造商双渠道供应链的博弈分析

在单个拥有线下传统批发及线上直销双渠道的制造商和单个零售商组成的供应链中,基于供应链成员博弈权力的差异,构建制造商占优或零售商占优的两类Stackelberg博弈及双方同等权力的Nash博弈模型,分析了三种博弈权力结构对供应链成员价格,需求和利润的影响。研究发现:当制造商线下传统批发渠道所占市场份额较小时,(1)渠道交叉价格弹性系数为0时和不为0时,三种博弈权力结构对制造商双渠道供应链均衡解的影响具有一定的鲁棒性;(2)三种博弈权力结构下,制造商线上直销渠道价格相同;两类Stackelberg博弈权力结构下,线下传统批发渠道价格相同且大于Nash博弈下的传统渠道价格;制造商批发价格随其博弈主导地位下降逐渐降低;(3)当渠道交叉价格弹性系数为0时,三种博弈权力结构对线上直销渠道需求的影响是无差异的;当渠道间交叉价格弹性系数不为0时,两类Stackelberg博弈权力结构下的线下传统批发渠道需求相同且小于Nash博弈下的传统渠道需求,线上直销渠道需求相同且大于Nash博弈下的线上直销渠道需求;(4)三种博弈策略下,制造商收益及零售商收益随其博弈主导地位下降逐渐降低;Nash博弈下,供应链总...     

Supply chain configuration for diffusion of new products: An integrated optimization approach

We develop an integrated/hybrid optimization model for configuring new products’ supply chains while explicitly considering the impact of demand dynamics during new products’ diffusion. The hybrid model simultaneously determines optimal production/sales plan and supply chain configuration. The production and sales plan provides decisions on the optimal timing to launch a new product, as well as the production and sales quantity in each planning period. The supply chain configuration provides optimal selection of options and safety stock level kept at each supply chain function. Extensive computational experiments on randomly generated testbed problems indicate that the hybrid modeling and solution approach significantly outperforms non-hybrid alternative modeling and solution approaches under various diffusion and supply chain topologies. We provide insights on optimal production/sales plan and supply chain configuration for new products during their diffusion process. Also, managerial implications relevant to effectiveness of the hybrid approach are discussed.     

Branch‐and‐Price Methods for Prescribing Profitable Upgrades of High‐Technology Products with Stochastic Demands*

This paper develops a model that can be used as a decision support aid, helping manufacturers make profitable decisions in upgrading the features of a family of high‐technology products over its life cycle. The model integrates various organizations in the enterprise: product design, marketing, manufacturing, production planning, and supply chain management. Customer demand is assumed random and this uncertainty is addressed using scenario analysis. A branch‐and‐price (B&P) solution approach is devised to optimize the stochastic problem effectively. Sets of random instances are generated to evaluate the effectiveness of our solution approach in comparison with that of commercial software on the basis of run time. Computational results indicate that our approach outperforms commercial software on all of our test problems and is capable of solving practical problems in reasonable run time. We present several examples to demonstrate how managers can use our models to answer “what if” questions.     

不同货架空间分配顺序下农产品供应链优化问题研究

货架是超市和生鲜便利店的重要资源，不仅具有储存和展示农产品的功能，同时货架空间大小对农产品的销量具有重要影响。针对产品需求受货架空间与零售价格共同影响的两级农产品供应链，在考虑供应商主导和零售商主导的情况下，分别对零售商在销售季节来临前和来临后分配货架空间四种分散式农产品供应链的最优决策与利润进行了分析，并与一体化供应链的最优决策进行了比较。研究发现，不论是在供应商主导还是在零售商主导的农产品供应链中，零售商在销售季节来临前分配货架空间，相比在销售季节来临后分配货架空间，农产品的批发价格与零售价格更高，分配的货架空间更小，供应商和零售商均获得更少的利润，相应的农产品供应链整体利润更少。因此，零售商在销售季节来临后分配货架空间对农产品供应链更有利。相比一体化供应链，分散式供应链的零售价格更高，分配的货架空间更小，供应链整体利润小于一体化供应链的最优利润，本文给出了基于利润共享与成本共担的合同对分散式供应链进行协调。最后，通过数值算例研究了参数变化对最优决策和供应链利润的影响。     

基于货架空间成本共担的不同权力供应链均衡分析

针对产品需求受货架空间与零售价格共同影响的两级供应链,通过比较供应商主导、零售商主导和权力均等三种不同权力结构供应链均衡结果,分析了供应商与零售商共同承担货架空间成本对供应链定价、货架空间分配和利润的影响。研究结果表明:供应商与零售商共同承担货架空间成本会减少供应商主导供应链的整体利润,但会使零售商主导和权力均等供应链通过分配更多的货架空间增加产品销量,在一定范围内使得供应链整体利润得到提高。由于三种不同权力结构供应链均未达到整体最优,提出了基于货架成本共担的收入共享合同,并给出了供应商和零售商均能接受的分配方案。     

Allocation of Returned Products among Different Recovery Options through an Opportunity Cost–Based Dynamic Approach*

In a make‐to‐order product recovery environment, we consider the allocation decision for returned products decision under stochastic demand of a firm with three options: refurbishing to resell, parts harvesting, and recycling. We formulate the problem as a multiperiod Markov decision process (MDP) and present a linear programming (LP) approximation that provides an upper bound on the optimal objective function value of the MDP model. We then present two solution approaches to the MDP using the LP solution: a static approach that uses the LP solution directly and a dynamic approach that adopts a revenue management perspective and employs bid‐price controls technique where the LP is resolved after each demand arrival. We calculate the bid prices based on the shadow price interpretation of the dual variables for the inventory constraints and accept a demand if the marginal value is higher than the bid price. Since the need for solving the LP at each demand arrival requires a very efficient solution procedure, we present a transportation problem formulation of the LP via variable redefinitions and develop a one‐pass optimal solution procedure for it. We carry out an extensive numerical analysis to compare the two approaches and find that the dynamic approach provides better performance in all of the tested scenarios. Furthermore, the solutions obtained are within 2% of the upper bound on the optimal objective function value of the MDP model.     

Coordinated Contract Decisions in a Make‐to‐Order Manufacturing Supply Chain: A Stochastic Programming Approach

One of the important objectives of supply chain S&OP (Sales and Operations Planning) is the profitable alignment of customer demand with supply chain capabilities through the coordinated planning of sales, production, distribution, and procurement. In the make‐to‐order manufacturing context considered in this paper, sales plans cover both contract and spot sales, and procurement plans require the selection of supplier contracts. S&OP decisions also involve the allocation of capacity to support sales plans. This article studies the coordinated contract selection and capacity allocation problem, in a three‐tier manufacturing supply chain, with the objective to maximize the manufacturer's profitability. Using a modeling approach based on stochastic programming with recourse, we show how these S&OP decisions can be made taking into account economic, market, supply, and system uncertainties. The research is based on a real business case in the Oriented Strand Board (OSB) industry. The computational results show that the proposed approach provides realistic and robust solutions. For the case considered, the planning method elaborated yields significant performance improvements over the solutions obtained from the mixed integer programming model previously suggested for S&OP.     

Piecewise linear approximations for the static–dynamic uncertainty strategy in stochastic lot-sizing

In this paper, we develop a unified mixed integer linear modelling approach to compute near-optimal policy parameters for the non-stationary stochastic lot sizing problem under static–dynamic uncertainty strategy. The proposed approach applies to settings in which unmet demand is backordered or lost; and it can accommodate variants of the problem for which the quality of service is captured by means of backorder penalty costs, non-stockout probabilities, or fill rate constraints. This approach has a number of advantages with respect to existing methods in the literature: it enables seamless modelling of different variants of the stochastic lot sizing problem, some of which have been previously tackled via ad hoc solution methods and some others that have not yet been addressed in the literature; and it produces an accurate estimation of the expected total cost, expressed in terms of upper and lower bounds based on piecewise linearisation of the first order loss function. We illustrate the effectiveness and flexibility of the proposed approach by means of a computational study.     

Eco-friendly container transshipment route scheduling problem with repacking operations

Currently, a huge amount of cargo is transported via containers by liner shipping companies. Under stochastic demand, repacking operations and carbon reduction, which may lead to an increase in effectiveness and environmental improvement, have been rarely considered in previous literature. In this paper, we investigate a container transshipment route scheduling problem with repacking operations under stochastic demand and environmental protection. The problem is a combinatorial optimization problem. Lacking historical data, a chance-constrained programming model is proposed to minimize the total operating and environment-related costs. We choose two distribution-free approaches, i.e., approximation based in Markov’s Inequality and Mixed Integer Second-Order Conic Program to approximate the chance constraints. As the loses induced by unfulfilled demand are not taken into account in the above model, a scenario-based model is developed considering the loses. Risk-neutral model may provide solutions that perform poorly while considering uncertainty. To incorporate decision makers’ perspectives, therefore, we also propose a risk-averse model adopting a risk aversion measure called Conditional Value-at-Risk to meet different preferences. Finally, we conduct computational experiments based on real data to compare the performances of the modeling methods and illustrate the impacts by testing different risk levels and confidence levels.

     

Profit implications of estimation methods for the allocation of marketing resources

We deal with the question whether estimating heterogeneous multiplicative sales response models without carry over effects by either ordinary least squares or Gibbs sampling makes a difference if resources (like advertising budgets, sales budgets, sales force sizes, sales calls) have to be allocated to sales units (like sales districts, customer groups, individual costumers or prospects) in a profit maximizing way and only short time series are available. To this end we generate artificial series on sales and allocations by stochastic simulation. These series are used to estimate multiplicative models whose coefficients are either specific to individual sales units or follow a hierarchical Bayesian framework. Ordinary least squares and Gibbs sampling serve as appropriate estimation methods. Performance of the two estimation methods is measured by recovery of optimal profits which are computed on the basis of the known true parameter values. We start to determine optimal allocations based on the plug-in method which uses average coefficients to determine expected profits. Gibbs sampling always leads to profits nearer to the true optima. This advantage of Gibbs sampling is especially pronounced for combinations with high average elasticity, high variation of elasticity and high number of sales units. On the other hand, differences between Gibbs sampling and OLS become smaller the more observations are available. Optimization with expected profits taking parameter uncertainty (i.e., the distribution of parameters) into account leads to higher profits than the plug-in method, but relative increases turn out to be rather small.