Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves

DOI10.1016/j.orl.2014.06.002zbMath1408.90160OpenAlexW2017304836WikidataQ62044784 ScholiaQ62044784MaRDI QIDQ1785252

Leonardo Vanneschi, Mauro Castelli

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.06.002

zbMATH Keywords

heuristicsallocationshelf space

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

A genetic algorithm for the retail shelf space allocation problem with virtual segments, Editorial. Special issue on computational intelligence and nature-inspired algorithms for real-world data analytics and pattern recognition

Cites Work

• Unnamed Item
• A general heuristic for vehicle routing problems
• Variable neighborhood search
• A new model and a hyper-heuristic approach for two-dimensional shelf space allocation
• Variable neighborhood search and local branching
• An efficient algorithm to allocate shelf space