Metaheuristics for assortment problems with multiple quality levels

DOI10.1016/J.COR.2010.01.011MaRDI QIDQ976046zbMATHOpenAlexFDO

Authors Mark H. McElreath, Maria E. Mayorga, Mary E. Kurz

Publication date 11 June 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2010.01.011

zbMATH Keywords

metaheuristicsassortment planning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A dynamic programming approach to solving the assortment planning problem with multiple quality levels
• Near-optimal algorithms for the assortment planning problem under dynamic substitution and stochastic demand
• The Discrete Two-Dimensional Assortment Problem
• Assortment planning for vertically differentiated products under a consider-then-choose model
• Assortment planning for multiple chain stores

Cites work

• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• Assortment planning and inventory decisions under a locational choice model
• Future paths for integer programming and links to artificial intelligence
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Optimization by simulated annealing

Cited in

(6)

• Application of Monkey Search Meta-heuristic to Solving Instances of the Multidimensional Assignment Problem
• Regionalized assortment planning for multiple chain stores
• Assortment and inventory decisions with multiple quality levels
• A dynamic programming approach to solving the assortment planning problem with multiple quality levels
• Private labels and retail assortment planning: a differential evolution approach
• Assortment optimization: a systematic literature review

This page was built for publication: Metaheuristics for assortment problems with multiple quality levels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976046)