A genetic algorithm for the retail shelf space allocation problem with virtual segments
From MaRDI portal
Publication:2150519
DOI10.1007/s12597-021-00551-3OpenAlexW3195714519MaRDI QIDQ2150519
Publication date: 27 June 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-021-00551-3
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution
- Optimizing assortment and pricing of multiple retail categories with cross-selling
- The location and allocation of products and product families on retail shelves
- A piecewise linearization for retail shelf space allocation problem and a local search heuristic
- A model and case study for efficient shelf usage and assortment analysis
- Retail category management. Decision support systems for assortment, shelf space, inventory and price planning.
- A minimal algorithm for the multiple-choice knapsack problem
- Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves
- A piecewise linearization framework for retail shelf space management models
- A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
- Retail shelf space planning problems: a comprehensive review and classification framework
- Shelf space dimensioning and product allocation in retail stores
- A practical approach to the shelf-space allocation and replenishment problem with heterogeneously sized shelves
- Demand Estimation and Assortment Optimization Under Substitution: Methodology and Application
- Placing boxes on shelves: a case study
- An efficient algorithm to allocate shelf space
This page was built for publication: A genetic algorithm for the retail shelf space allocation problem with virtual segments
