Single item stochastic lot sizing problem considering capital flow and business overdraft

06/18/2017
by   Zhen Chen, et al.
0

This paper introduces capital flow to the single item stochastic lot sizing problem. A retailer can leverage business overdraft to deal with unexpected capital shortage, but needs to pay interest if its available balance goes below zero. A stochastic dynamic programming model maximizing expected final capital increment is formulated to solve the problem to optimality. We then investigate the performance of four controlling policies: (R, Q), (R, S), (s, S) and (s, Q, S); for these policies, we adopt simulation-genetic algorithm to obtain approximate values of the controlling parameters. Finally, a simulation-optimization heuristic is also employed to solve this problem. Computational comparisons among these approaches show that policy (s, S) and policy (s, Q, S) provide performance close to that of optimal solutions obtained by stochastic dynamic programming, while simulation-optimization heuristic offers advantages in terms of computational efficiency. Our numerical tests also show that capital availability as well as business overdraft interest rate can substantially affect the retailer's optimal lot sizing decisions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/27/2017

Capital flow constrained lot sizing problem with loss of goodwill and loan

We introduce capital flow constraints, loss of good will and loan to the...
research
09/14/2021

Performance of a Markovian neural network versus dynamic programming on a fishing control problem

Fishing quotas are unpleasant but efficient to control the productivity ...
research
07/04/2019

A global constraint for the capacitated single-item lot-sizing problem

The goal of this paper is to set a constraint programming framework to s...
research
06/14/2021

Learning Intrusion Prevention Policies through Optimal Stopping

We study automated intrusion prevention using reinforcement learning. In...
research
08/27/2019

Research on Autonomous Maneuvering Decision of UCAV based on Approximate Dynamic Programming

Unmanned aircraft systems can perform some more dangerous and difficult ...
research
12/11/2019

UCT-ADP Progressive Bias Algorithm for Solving Gomoku

We combine Adaptive Dynamic Programming (ADP), a reinforcement learning ...
research
05/11/2020

A Game Theoretic Approach for Parking Spot Search with Limited Parking Lot Information

We propose a game theoretic approach to address the problem of searching...

Please sign up or login with your details

Forgot password? Click here to reset