A Benders decomposition approach to product location in carousel storage systems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-019-03274-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Mokhtar S. Bazaraa & Hanif D. Sherali, 1980. "Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 27(1), pages 29-41, March.
- Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
- Guenov, Marin & Raeside, Robert, 1992. "Zone shapes in class based storage and multicommand order picking when storage/retrieval machines are used," European Journal of Operational Research, Elsevier, vol. 58(1), pages 37-47, April.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.
- Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.
- Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
- de Koster, Rene & Le-Duc, Tho & Roodbergen, Kees Jan, 2007. "Design and control of warehouse order picking: A literature review," European Journal of Operational Research, Elsevier, vol. 182(2), pages 481-501, October.
- Russ J. Vander Wiel & Nikolaos V. Sahinidis, 1996. "An exact solution approach for the time‐dependent traveling‐salesman problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 797-820, September.
- Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
- Enrique Domínguez & Alfredo Marín, 2020. "Discrete ordered median problem with induced order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 793-813, October.
- Rouwenhorst, B. & Reuter, B. & Stockrahm, V. & van Houtum, G. J. & Mantel, R. J. & Zijm, W. H. M., 2000. "Warehouse design and control: Framework and literature review," European Journal of Operational Research, Elsevier, vol. 122(3), pages 515-533, May.
- T. G. Pradeepmon & Vinay V. Panicker & R. Sridharan, 2021. "A variable neighbourhood search enhanced estimation of distribution algorithm for quadratic assignment problems," OPSEARCH, Springer;Operational Research Society of India, vol. 58(1), pages 203-233, March.
- Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L., 1998. "One-dimensional machine location problems in a multi-product flowline with equidistant locations," European Journal of Operational Research, Elsevier, vol. 105(3), pages 401-426, March.
- Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.
- Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
- Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
- Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
- Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
- Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü, 2021. "The Rank-One Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 979-996, July.
- Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
- Ketan Date & Rakesh Nagi, 2019. "Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 771-789, October.
- Ebery, Jamie, 2001. "Solving large single allocation p-hub problems with two or three hubs," European Journal of Operational Research, Elsevier, vol. 128(2), pages 447-458, January.
- Ball, Michael O. & Kaku, Bharat K. & Vakhutinsky, Andrew, 1998. "Network-based formulations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 241-249, January.
More about this item
Keywords
Benders decomposition; Carousel systems; Storage location; Quadratic assignment problem;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:284:y:2020:i:2:d:10.1007_s10479-019-03274-3. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.