scholarly journals Dynamic programming approach for solving the retail shelf-space allocation problem

2021 ◽  
Vol 192 ◽  
pp. 4320-4329
Author(s):  
Kateryna Czerniachowska ◽  
Krzysztof Lutosławski
Keyword(s):  
Dynamic Programming ◽  
Allocation Problem ◽  
Programming Approach ◽  
Shelf Space ◽  
Dynamic Programming Approach ◽  
Space Allocation ◽  
Shelf Space Allocation

A DYNAMIC PROGRAMMING HEURISTIC FOR RETAIL SHELF SPACE ALLOCATION PROBLEM

2011 ◽  
Vol 28 (02) ◽  
pp. 183-199 ◽  
Author(s):  
HASMUKH K. GAJJAR ◽  
GAJENDRA K. ADIL
Keyword(s):  
Dynamic Programming ◽  
Optimal Solution ◽  
Retail Store ◽  
Allocation Problem ◽  
Shelf Space ◽  
Reasonable Time ◽  
Cpu Time ◽  
Local Search Heuristic ◽  
Space Allocation ◽  
Shelf Space Allocation

Shelf space allocation to products greatly impacts the profitability in a retail store. In this paper, we consider a retail shelf-space allocation problem where retailer wishes to allocate the available spaces of different shelves to a large number of products considering direct space elasticity in the product's demand. There is a great interest to develop efficient heuristics due to NP-hard nature of this problem. We propose a dynamic programming heuristic (DPH) to obtain near optimal solution in a reasonable time to solve this problem. The empirical results found that DPH obtained near optimal solutions for randomly generated instances of problems with size (products, shelves) varying from (100, 30) to (200, 50) within a few seconds of CPU time. The performance of DPH is benchmarked against an existing local search heuristic (LSH). It was found that DPH takes substantially less CPU time and attains a solution close to that obtained by LSH. Thus, DPH has great potential to solve the problem of realistic size within reasonable time. The proposed DPH is also applied to a case of an existing retail store.

Modeling M Warehouse N Manpower-Team Allocation Problem Using Dynamic Programming Approach

2019 ◽  
Vol 10 (4) ◽  
pp. 100-112
Author(s):  
Mohit Goswami
Keyword(s):  
Dynamic Programming ◽  
Performance Measure ◽  
Allocation Problem ◽  
Programming Approach ◽  
Problem Structure ◽  
Detailed Model ◽  
Dynamic Programming Approach ◽  
Workforce Allocation ◽  
Study Results ◽  
Dynamic Programming Problem

In this research, a dynamic programming-based approach is deployed to model and solve the manpower allocation problem for warehouses. The authors specifically evolve the detailed model for M warehouses and N teams (available for allocation to these warehouses). Profitability is considered as a performance measure for the allocation problem. The warehouses and manpower-team are modelled as stages and states respectively within the dynamic programming problem structure. Owing to the rather abstract nature of such allocation problems possessing Markovian properties and having similarities with stage-gate type of a problem, dynamic programming approach is deployed. The study results in recommending key decisions in workforce allocation for organizations such as retailers operating multiple warehouses.

Sign in / Sign up

Export Citation Format

Share Document