ویراساینس.
سند علمی

An Approximate Dynamic Programming Approach for a Product Distribution Problem

چکیده

This paper proposes an approximate dynamic programming-based method for optimizing the distribution operations of a company manufacturing a certain product in numerous plants and distributing it to different regional markets for sale. The production at each plant and in each time period follows a nonstationary stochastic process. The product can be stored at the plants or shipped to a regional market to serve the random demand. The proposed solution method formulates the problem as a dynamic program and uses approximations of the value function. We develop a tractable procedure to compute the marginal worth of a unit of inventory at a production plant. This quantity is used to update the value function approximations in an iterative improvement scheme. We numerically show that our method yields high quality solutions.

اسناد مشابه

  • An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems

    سند علمی۲۰۰۲Management ScienceDimitris Bertsimas, Ramazan Demir

    We present an Approximate Dynamic Programming (ADP) approach for the multidimensional knapsack problem (MKP). We approximate the value function (a) using parametric and nonparametric methods and (b) using a base-heuristic. We propose a new heuristic which adaptively rounds the so

  • An Approximate Dynamic Programming Approach to Urban Freight Distribution with Batch Arrivals

    سند علمی۲۰۱۵ICCLWouter van Heeswijk, Martijn Mes, J. M. J. Schutten

    We study an extension of the delivery dispatching problem (DDP) with time windows, applied on LTL orders arriving at an urban consolidation center. Order properties (e.g., destination, size, dispatch window) may be highly varying, and directly distributing an incoming order batch

  • SPE 141677 Use of Approximate Dynamic Programming for Production Optimization

    سند علمی۲۰۱۰Zheng Wen, Louis J. Durlofsky, Benjamin Van Roy, Khalid Aziz

    In production optimization, we seek to determine the well settings (bottomhole pressures, flow rates) that maximize an objective function such as net present value. In this paper we introduce and apply a new approximate dynamic programming (ADP) algorithm for this optimization pr

  • An approximate dynamic programming approach for the empty container allocation problem

    سند علمی۲۰۱۵Shao-Wei Lam, Loo-Hay Lee, Loon-Ching Tang

    The objective of this study is to demonstrate the successful application of an approximate dynamic programming approach in deriving effective operational strategies for the relocation of empty containers in the containerized sea-cargo industry. A dynamic stochastic model for a si

  • An approximate dynamic programming approach to convex quadratic knapsack problems

    سند علمی۲۰۰۶Computers & ORZhongsheng Hua, Bin Zhang, Liang Liang

    Quadratic knapsack problem (QKP) has a central role in integer and combinatorial optimization, while efficient algorithms to general QKPs are currently very limited. We present an approximate dynamic programming (ADP) approach for solving convex QKPs where variables may take any

  • An approximate dynamic programming approach for the vehicle routing problem with stochastic demands

    سند علمی۲۰۰۹European Journal of Operational ResearchClara Novoa, Robert H. Storer

    This paper examines approximate dynamic programming algorithms for the single-vehicle routing problem with stochastic demands from a dynamic or reoptimization perspective. The methods extend the rollout algorithm by implementing different base sequences (i.e. a priori solutions),