A Benders decomposition approach to product location in carousel storage systems

DOI10.1007/s10479-019-03274-3OpenAlexW2948098302MaRDI QIDQ2288989

Nader Azad, Elkafi Hassini, Raymond G. Vickson

Publication date: 20 January 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03274-3

zbMATH Keywords

quadratic assignment problemBenders decompositionstorage locationcarousel systems

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Note on combinatorial optimization with max-linear objective functions
• A two-carousel storage location problem
• Storage space allocation to maximize inter-replenishment times
• Generalized Benders decomposition
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• Optimal storage locations in a carousel storage and retrieval system
• Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
• Essentials of Stochastic Processes
• One-Dimensional Carousel Storage Problems: Applications, Review and Generalizations

This page was built for publication: A Benders decomposition approach to product location in carousel storage systems