236 research outputs found

    Revenue Management and Demand Fulfillment: Matching Applications, Models, and Software

    Get PDF
    Recent years have seen great successes of revenue management, notably in the airline, hotel, and car rental business. Currently, an increasing number of industries, including manufacturers and retailers, are exploring ways to adopt similar concepts. Software companies are taking an active role in promoting the broadening range of applications. Also technological advances, including smart shelves and radio frequency identification (RFID), are removing many of the barriers to extended revenue management. The rapid developments in Supply Chain Planning and Revenue Management software solutions, scientific models, and industry applications have created a complex picture, which appears not yet to be well understood. It is not evident which scientific models fit which industry applications and which aspects are still missing. The relation between available software solutions and applications as well as scientific models appears equally unclear. The goal of this paper is to help overcome this confusion. To this end, we structure and review three dimensions, namely applications, models, and software. Subsequently, we relate these dimensions to each other and highlight commonalities and discrepancies. This comparison also provides a basis for identifying future research needs.Manufacturing;Revenue Management;Software;Advanced Planning Systems;Demand Fulfillment

    Revenue Management and Demand Fulfillment: Matching Applications, Models, and Software

    Get PDF
    Recent years have seen great successes of revenue management, notably in the airline, hotel, and car rental business. Currently, an increasing number of industries, including manufacturers and retailers, are exploring ways to adopt similar concepts. Software companies are taking an active role in promoting the broadening range of applications. Also technological advances, including smart shelves and radio frequency identification (RFID), are removing many of the barriers to extended revenue management. The rapid developments in Supply Chain Planning and Revenue Management software solutions, scientific models, and industry applications have created a complex picture, which appears not yet to be well understood. It is not evident which scientific models fit which industry applications and which aspects are still missing. The relation between available software solutions and applications as well as scientific models appears equally unclear. The goal of this paper is to help overcome this confusion. To this end, we structure and review three dimensions, namely applications, models, and software. Subsequently, we relate these dimensions to each other and highlight commonalities and discrepancies. This comparison also provides a basis for identifying future research needs

    Solving Practical Dynamic Pricing Problems with Limited Demand Information

    Get PDF
    Dynamic pricing problems have received considerable attention in the operations management literature in the last two decades. Most of the work has focused on structural results and managerial insights using stylized models without considering business rules and issues commonly encountered in practice. While these models do provide general, high-level guidelines for managers in practice, they may not be able to generate satisfactory solutions to practical problems in which business norms and constraints have to be incorporated. In addition, most of the existing models assume full knowledge about the underlying demand distribution. However, demand information can be very limited for many products in practice, particularly, for products with short life-cycles (e.g., fashion products). In this dissertation, we focus on dynamic pricing models that involve selling a fixed amount of initial inventory over a fixed time horizon without inventory replenishment. This class of dynamic pricing models have a wide application in a variety of industries. Within this class, we study two specific dynamic pricing problems with commonly-encountered business rules and issues where there is limited demand information. Our objective is to develop satisfactory solution approaches for solving practically sized problems and derive managerial insights. This dissertation consists of three parts. We first present a survey of existing pricing models that involve one or multiple sellers selling one or multiple products, each with a given initial inventory, over a fixed time horizon without inventory replenishment. This particular class of dynamic pricing problems have received substantial attention in the operations management literature in recent years. We classify existing models into several different classes, present a detailed review on the problems in each class, and identify possible directions for future research. We then study a markdown pricing problem that involves a single product and multiple stores. Joint inventory allocation and pricing decisions have to be made over time subject to a set of business rules. We discretize the demand distribution and employ a scenario tree to model demand correlation across time periods and among the stores. The problem is formulated as a MIP and a Lagrangian relaxation approach is proposed to solve it. Extensive numerical experiments demonstrate that the solution approach is capable of generating close-to-optimal solutions in a short computational time. Finally, we study a general dynamic pricing problem for a single store that involves two substitutable products. We consider both the price-driven substitution and inventory-driven substitution of the two products, and investigate their impacts on the optimal pricing decisions. We assume that little demand information is known and propose a robust optimization model to formulate the problem. We develop a dynamic programming solution approach. Due to the complexity of the DP formulation, a fully polynomial time approximation scheme is developed that guarantees a proven near optimal solution in a manageable computational time for practically sized problems. A variety of managerial insights are discussed

    Stochastic Optimization Models for Perishable Products

    Get PDF
    For many years, researchers have focused on developing optimization models to design and manage supply chains. These models have helped companies in different industries to minimize costs, maximize performance while balancing their social and environmental impacts. There is an increasing interest in developing models which optimize supply chain decisions of perishable products. This is mainly because many of the products we use today are perishable, managing their inventory is challenging due to their short shelf life, and out-dated products become waste. Therefore, these supply chain decisions impact profitability and sustainability of companies and the quality of the environment. Perishable products wastage is inevitable when demand is not known beforehand. A number of models in the literature use simulation and probabilistic models to capture supply chain uncertainties. However, when demand distribution cannot be described using standard distributions, probabilistic models are not effective. In this case, using stochastic optimization methods is preferred over obtaining approximate inventory management policies through simulation. This dissertation proposes models to help businesses and non-prot organizations make inventory replenishment, pricing and transportation decisions that improve the performance of their system. These models focus on perishable products which either deteriorate over time or have a fixed shelf life. The demand and/or supply for these products and/or, the remaining shelf life are stochastic. Stochastic optimization models, including a two-stage stochastic mixed integer linear program, a two-stage stochastic mixed integer non linear program, and a chance constraint program are proposed to capture uncertainties. The objective is to minimize the total replenishment costs which impact prots and service rate. These models are motivated by applications in the vaccine distribution supply chain, and other supply chains used to distribute perishable products. This dissertation also focuses on developing solution algorithms to solve the proposed optimization models. The computational complexity of these models motivated the development of extensions to standard models used to solve stochastic optimization problems. These algorithms use sample average approximation (SAA) to represent uncertainty. The algorithms proposed are extensions of the stochastic Benders decomposition algorithm, the L-shaped method (LS). These extensions use Gomory mixed integer cuts, mixed-integer rounding cuts, and piecewise linear relaxation of bilinear terms. These extensions lead to the development of linear approximations of the models developed. Computational results reveal that the solution approach presented here outperforms the standard LS method. Finally, this dissertation develops case studies using real-life data from the Demographic Health Surveys in Niger and Bangladesh to build predictive models to meet requirements for various childhood immunization vaccines. The results of this study provide support tools for policymakers to design vaccine distribution networks

    Dynamic supply chain decisions based on networked sensor data:An application in the chilled food retail chain

    Get PDF
    With large volume of product flows and complex supply chain processes, more data than ever before is being generated and collected in supply chains through various tracking and sensory technologies. The purpose of this study is to show a potential scenario of using a prototype tracking tool that facilitate the utilisation of sensor data, which is often unstructured and enormous in nature, to support supply chain decisions. The research investigates the potential benefits of the chilled food chain management innovation through sensor data driven pricing decisions. Data generated and recorded through the sensor network are used to predict the remaining shelf-life of perishable foods. Numerical analysis is conducted to examine the benefit of proposed approach under various operational situations and product features. The research findings demonstrate a way of modelling pricing and potential of performance improvement in chilled food chains to provide a vision of smooth transfer and implementation of the sensor data driven supply chain management. The research finding would encourage firms in the food industry to explore innovation opportunities from big data and develop proper data driven strategies to improve their competitiveness

    Decision models for fast-fashion supply and stocking problems in internet fulfillment warehouses

    Get PDF
    Internet technology is being widely used to transform all aspects of the modern supply chain. Specifically, accelerated product flows and wide spread information sharing across the supply chain have generated new sets of decision problems. This research addresses two such problems. The first focuses on fast fashion supply chains in which inventory and price are managed in real time to maximize retail cycle revenue. The second is concerned with explosive storage policies in Internet Fulfillment Warehouses (IFW). Fashion products are characterized by short product life cycles and market success uncertainty. An unsuccessful product will often require multiple price discounts to clear the inventory. The first topic proposes a switching solution for fast-fashion retailers who have preordered an initial or block inventory, and plan to use channel switching as opposed to multiple discounting steps. The FFS Multi-Channel Switching (MCS) problem then is to monitor real-time demand and store inventory, such that at the optimal period the remaining store inventory is sold at clearance, and the warehouse inventory is switched to the outlet channel. The objective is to maximize the total revenue. With a linear projection of the moving average demand trend, an estimation of the remaining cycle revenue at any time in the cycle is shown to be a concave function of the switching time. Using a set of conditions the objective is further simplified into cases. The Linear Moving Average Trend (LMAT) heuristic then prescribes whether a channel switch should be made in the next period. The LMAT is compared with the optimal policy and the No-Switch and Beta-Switch rules. The LMAT performs very well and the majority of test problems provide a solution within 0.4% of the optimal. This confirms that LMAT can readily and effectively be applied to real time decision making in a FFS. An IFW is a facility built and operated exclusively for online retail, and a key differentiator is the explosive storage policy. Breaking the single stocking location tradition, in an IFW small batches of the same stock keeping unit (SKU) are dispersed across the warehouse. Order fulfillment time performance is then closely related to the storage location decision, that is, for every incoming bulk, what is the specific storage location for each batch. Faster fulfillment is possible when SKUs are clustered such that narrow band picklists can be efficiently generated. Stock location decisions are therefore a function of the demand arrival behavior and correlations with other SKUs. Faster fulfillment is possible when SKUs are clustered such that narrow band picklists can be efficiently generated. Stock location decisions are therefore a function of the demand behavior and correlations with other SKUs. A Joint Item Correlation and Density Oriented (JICDO) Stocking Algorithm is developed and tested. JICDO is formulated to increase the probability that M pick able order items are stocked in a δ band of storage locations. It scans the current inventory dispersion to identify location bands with low SKU density and combines the storage affinity with correlated items. In small problem testing against a MIP formulation and large scale testing in a simulator the JICDO performance is confirmed

    Minimizing food waste in grocery store operations: literature review and research agenda

    Get PDF
    Research on grocery waste in food retailing has recently attracted particular interest. Investigations in this area are relevant to address the problems of wasted resources and ethical concerns, as well as economic aspects from the retailer’s perspective. Reasons for food waste in retail are already well-studied empirically, and based on this, proposals for reduction are discussed. However, comprehensive approaches for preventing food waste in store operations using analytics and modeling methods are scarce. No work has yet systematized related research in this domain. As a result, there is neither any up-to-date literature review nor any agenda for future research. We contribute with the first structured literature review of analytics and modeling methods dealing with food waste prevention in retail store operations. This work identifies cross-cutting store-related planning areas to mitigate food waste, namely (1) assortment and shelf space planning, (2) replenishment policies, and (3) dynamic pricing policies. We introduce a common classification scheme of literature with regard to the depth of food waste integration and the characteristics of these planning problems. This builds our foundation to review analytics and modeling approaches. Current literature considers food waste mainly as a side effect in costing and often ignores product age dependent demand by customers. Furthermore, approaches are not integrated across planning areas. Future lines of research point to the most promising open questions in this field

    Implementation of the Newsvendor Model with Clearance Pricing: How to (and How Not to) Estimate a Salvage Value

    Get PDF
    The newsvendor model is designed to decide how much of a product to order when the product is to be sold over a short selling season with stochastic demand and there are no additional opportunities to replenish inventory. There are many practical situations that reasonably conform to those assumptions, but the traditional newsvendor model also assumes a fixed salvage value: all inventory left over at the end of the season is sold off at a fixed per-unit price. The fixed salvage value assumption is questionable when a clearance price is rationally chosen in response to the events observed during the selling season: a deep discount should be taken if there is plenty of inventory remaining at the end of the season, whereas a shallow discount is appropriate for a product with higher than expected demand. This paper solves for the optimal order quantity in the newsvendor model, assuming rational clearance pricing. We then study the performance of the traditional newsvendor model. The key to effective implementation of the traditional newsvendor model is choosing an appropriate fixed salvage value. (We show that an optimal order quantity cannot be generally achieved by merely enhancing the traditional newsvendor model to include a nonlinear salvage value function.) We demonstrate that several intuitive methods for estimating the salvage value can lead to an excessively large order quantity and a substantial profit loss. Even though the traditional model can result in poor performance, the model seems as if it is working correctly: the order quantity chosen is optimal given the salvage value inputted to the model, and the observed salvage value given the chosen order quantity equals the inputted one. We discuss how to estimate a salvage value that leads the traditional newsvendor model to the optimal or near-optimal order quantity. Our results highlight the importance of understanding how a model can interact with its own inputs: when inputs to a model are influenced by the decisions of the model, care is needed to appreciate how that interaction influences the decisions recommended by the model and how the model’s inputs should be estimated
    • …
    corecore