313
Views
2
CrossRef citations to date
0
Altmetric
Articles

Data-driven storage location method for put system in Chinese flower auction centres

, , &
Pages 1231-1244 | Received 06 May 2019, Accepted 13 Nov 2020, Published online: 16 Dec 2020

References

  • Amaioua, N., C. Audet, A. R. Conn, and S. Le Digabel. 2018. “Efficient Solution of Quadratically Constrained Quadratic Subproblems Within the Mesh Adaptive Direct Search Algorithm.” European Journal of Operational Research 268 (1): 13–24. doi: 10.1016/j.ejor.2017.10.058
  • Chew, E. P., and L. C. Tang. 1999. “Travel Time Analysis for General Item Location Assignment in a Rectangular Warehouse.” European Journal of Operational Research 112 (3): 582–597. doi: 10.1016/S0377-2217(97)00416-5
  • Chiang, D. M. H., C. P. Lin, and M. C. Chen. 2011. “The Adaptive Approach for Storage Assignment by Mining Data of Warehouse Management System for Distribution Centres.” Enterprise Information Systems 5 (2): 219–234. doi: 10.1080/17517575.2010.537784
  • Chiang, D. M. H., C. P. Lin, and M. C. Chen. 2014. “Data Mining-Based Storage Assignment Heuristics for Travel Distance Reduction.” Expert Systems 31 (1): 81–90. doi: 10.1111/exsy.12006
  • Dallari, F., G. Marchet, and M. Melacini. 2009. “Design of Order Picking System.” The International Journal of Advanced Manufacturing Technology 42 (1-2): 1–12. doi: 10.1007/s00170-008-1571-9
  • De Koster, R., T. Le-Duc, and K. J. Roodbergen. 2007. “Design and Control of Warehouse Order Picking: A Literature Review.” European Journal of Operational Research 182 (2): 481–501. doi: 10.1016/j.ejor.2006.07.009
  • De Koster, R., and M. Yu. 2008. “Minimizing Makespan and Throughput Times at Aalsmeer Flower Auction.” Journal of the Operational Research Society 59 (9): 1182–1190. doi: 10.1057/palgrave.jors.2602474
  • Gagliardi, J. P., J. Renaud, and A. Ruiz. 2012. “On Storage Assignment Policies for Unit-Load Automated Storage and Retrieval Systems.” International Journal of Production Research 50 (3): 879–892. doi: 10.1080/00207543.2010.543939
  • Gu, J., M. Goetschalckx, and L. F. McGinnis. 2007. “Research on Warehouse Operation: A Comprehensive Review.” European Journal of Operational Research 177 (1): 1–21. doi: 10.1016/j.ejor.2006.02.025
  • Hosseini, S. S. S., A. Jafarnejad, A. H. Behrooz, and A. H. Gandomi. 2011. “Combined Heat and Power Economic Dispatch by Mesh Adaptive Direct Search Algorithm.” Expert Systems with Applications 38 (6): 6556–6564. doi: 10.1016/j.eswa.2010.11.083
  • Kong, X., G. Q. Huang, H. Luo, and B. P. Yen. 2018. “Physical-Internet-Enabled Auction Logistics in Perishable Supply Chain Trading: State-of-the-Art and Research Opportunities.” Industrial Management and Data Systems 118 (8): 1671–1694. doi: 10.1108/IMDS-10-2017-0486
  • Kong, X. T., R. Y. Zhong, G. Xu, and G. Q. Huang. 2017. “Robot-Enabled Execution System for Perishables Auction Logistics.” Industrial Management and Data Systems 117 (9): 1954–1971. doi: 10.1108/IMDS-03-2016-0114
  • Li, J., M. Moghaddam, and S. Y. Nof. 2016. “Dynamic Storage Assignment with Product Affinity and ABC Classification—A Case Study.” The International Journal of Advanced Manufacturing Technology 84 (9-12): 2179–2194. doi: 10.1007/s00170-015-7806-7
  • Muppani, V. R., and G. K. Adil. 2008. “Efficient Formation of Storage Classes for Warehouse Storage Location Assignment: A Simulated Annealing Approach.” Omega 36 (4): 609–618. doi: 10.1016/j.omega.2007.01.006
  • Pan, C.H, P.H Shih, M.H Wu, and J.H Lin. 2015. “A storage assignment heuristic method based on genetic algorithm for a pick-and-pass warehousing system.” Computers & Industrial Engineering 81: 1–13. doi: 10.1016/j.cie.2014.12.010
  • Pang, K. W., and H. L. Chan. 2017. “Data Mining-Based Algorithm for Storage Location Assignment in a Randomised Warehouse.” International Journal of Production Research 55 (14): 4035–4052. doi: 10.1080/00207543.2016.1244615
  • Petersen, C. G. 1997. “An Evaluation of Order Picking Routeing Policies.” International Journal of Operations & Production Management 17 (11): 1098–1111. doi: 10.1108/01443579710177860
  • Qin, K., F. Y. Chen, and L. Ma. 2015. “Cutting Down the Travel Distance of Put Systems at Kunming International Flower Auction Market.” International Journal of Production Research 53 (12): 3573–3585. doi: 10.1080/00207543.2014.980013
  • Qin, K. D., and B. J. Yang. 2010. “Storage Allocation Methods, Storage Size and Service Level under Uncertainty in Manual Order-Picking Systems.” International Conference on E-Business and E-Government, 3283–3289.
  • Rao, S. S., and G. K. Adil. 2013. “Class-Based Storage with Exact S-Shaped Traversal Routing in Low-Level Picker-to-Part Systems.” International Journal of Production Research 51 (16): 4979–4996. doi: 10.1080/00207543.2013.784419
  • Van Gils, T., K. Ramaekers, A. Caris, and R. B. de Koster. 2018. “Designing Efficient Order Picking Systems by Combining Planning Problems: State-of-the-Art Classification and Review.” European Journal of Operational Research 267 (1): 1–15. doi: 10.1016/j.ejor.2017.09.002
  • Wang, M., R. Q. Zhang, and K. Fan. 2020. “Improving Order-Picking Operation through Efficient Storage Location Assignment: A New Approach.” Computers & Industrial Engineering 139: 106186. Advance online publication. doi:10.1016/j.cie.2019.106186.
  • Yu, Y., and R. B. de Koster. 2009. “Optimal Zone Boundaries for Two-Class-Based Compact Three-Dimensional Automated Storage and Retrieval Systems.” IIE Transactions 41 (3): 194–208. doi: 10.1080/07408170802375778
  • Yu, Y., and R. B. de Koster. 2013. “On the Suboptimality of Full Turnover-Based Storage.” International Journal of Production Research 51 (6): 1635–1647. doi: 10.1080/00207543.2011.654012
  • Zhang, R. Q., M. Wang, and X. Pan. 2019. “New Model of the Storage Location Assignment Problem Considering Demand Correlation Pattern.” Computers and Industrial Engineering 129: 210–219. doi: 10.1016/j.cie.2019.01.027

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.