1,520
Views
44
CrossRef citations to date
0
Altmetric
Original Articles

Storage assignment and order batching problem in Kiva mobile fulfilment system

, ORCID Icon & ORCID Icon
Pages 1941-1962 | Received 30 Jul 2017, Accepted 15 Dec 2017, Published online: 25 Jan 2018

References

  • Berglund, P., and R. Batta. 2012. “Optimal Placement of Warehouse Cross-aisles in a Picker-to-part Warehouse with Class-based Storage.” IIE Transactions 44 (2): 107–120.
  • Cardinal, J., and C. Dumeunier. 2008. “Set Covering Problems with General Objective Functions.” arXiv arXiv:0802.2184.
  • Chiang, 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.
  • Cormier., G. 1992. “A Review of Warehouse Models.” European Journal of Operational Research 58 (1): 3–13.
  • deKoster, 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.
  • Enright, J. J., and P. R. Wurman. 2011. “Optimization and Coordinated Autonomy in Mobile Fulfillment Systems.” In AAAI Conference on Automated Action Planning for Autonomous Mobile Robots, 33–38. Palo Alto, CA: AAAI Press.
  • Frazele, E. A., and G. P. Sharp. 1989. “Correlated Assignment Strategy Can Improve any Order-picking Operation.” Industrial Engineering 21 (4): 33–37.
  • Gademann, N., and S. van de Velde. 2005. “Order Batching to Minimize Total Travel Time in a Parallel-aisle Warehouse.” IIE Transactions 37 (1): 63–75.
  • Grotschel, M., and Y. Wakabayashi. 1989. “A Cutting Plane Algorithm for a Clustering Problem.” Mathematical Programming 45 (13): 59–96.
  • Hansen, P., and N. Mladenovic. 1999. “An Introduction to Variable Neighborhood Search.” In Meta-Heuristics, edited by S. Vo, S. Martello, I. H. Osman, and C. Roucairol, 433–458. Boston: Springer.
  • Heskett., J. L. 1963. “Cube-per-order Index – A Key to Warehouse Stock Location.” Transportation and Distribution Management 3: 27–31.
  • Hwang, H., W. Baek, and M.-K. Lee. 1988. “Clustering Algorithms for Order Picking in an Automated Storage and Retrieval System.” International Journal of Production Research 26 (2): 189–201.
  • Hwang, H., Y. Hui Oh, and C. Nam Cha. 2003. “A Stock Location Rule for a Low Level Picker-to-part System.” Engineering Optimization 35 (3): 285–295.
  • Jane, C. C., and Y. W. Laih. 2005. “A Clustering Algorithm for Item Assignment in a Synchronized Zone Order Picking System.” European Journal of Operational Research 166 (2): 489–496.
  • Kim., K. H. 1993. “A Joint Determination of Storage Locations and Space Requirements for Correlated Items in a Miniload Automated Storage-retrieval System.” International Journal of Production Research 31 (11): 2649–2659.
  • Lee., M. K. 1992. “A Storage Assignment Policy in a Man-on-board Automated Storage/retrieval System.” International Journal of Production Research 30 (10): 2281–2292.
  • Liu., C. M. 1999. “Clustering Techniques for Stock Location and Order-picking in a Distribution.” Computers Operations Research 26 (10–11): 989–1002.
  • Ma, T., and P. Zhao. 2014. “A Review of Algorithms for Order Batching Problem in Distribution Center.” In International Conference on Logistics Engineering, Management and Computer Science, 172–175. Atlantis Press. doi: 10.2991/lemcs-14.2014.40.
  • Malmborg, C. J., and K. Bhaskaran. 1990. “A Revised Proof of Optimality for the Cube-per-order Index Rule for Stored Item Location.” Applied Mathematical Modelling 14 (2): 87–95.
  • Menendez, B., E. G. Pardo, A. Alonso-Ayuso, E. Molina, and A. Duarte. 2016. “Variable Neighborhood Search Strategies for the Order Batching Problem.” Computers Operations Research 78: 500–512.
  • Mulvey, J. M., and H. P. Crowder. 1979. “Clustering Analysis: An Application of Lagrangian Relaxation.” Management Science 25 (4): 329–340.
  • Muter, I., and T. Öncan. 2015. “An Exact Solution Approach for the Order Batching Problem.” IIE Transactions 47 (7): 728–738.
  • Oncan., T. 2013. “A Genetic Algorithm for the Order Batching Problem in Low-level Picker-to-part Warehouse Systems.” Lecture Notes in Engineering Computer Science 2202 (1): 471–476.
  • Oncan., T. 2015. “MILP Formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem.” European Journal of Operational Research 243 (1): 142–155.
  • Parikh, P. J., and R. D. Meller. 2008. “Selecting Between Batch and Zone Order Picking Strategies in a Distribution Center.” Transportation Research, Part E: Logistics Transportation Review 44 (5): 696–719.
  • PerezRodriguez, R., A. Hernandez-Aguirre, and S. Jons. 2015. “A Continuous Estimation of Distribution Algorithm for the Online Order-batching Problem.” International Journal of Advanced Manufacturing Technology 79 (1): 569–588.
  • Wilson., H. G. 1977. “Order Quantity, Product Popularity, and the Location of Stock in a Warehouse.” IIE Transactions 9 (3): 230–237.
  • Wurman, P. R., R. D'Andrea, and M. Mountz. 2008. “Coordinating Hundreds of Cooperative, Autonomous Vehicles in Warehouses.” In National Conference on Innovative Applications of Artificial Intelligence, Vol 2, 1752–1759. Palo Alto, CA: AAAI Press.
  • Xiao., J., and L. Zheng. 2010. “A Correlated Storage Location Assignment Problem in a Single-block-multi-aisles Warehouse Considering BOM Information.” International Journal of Production Research 48 (5): 1321–1338.
  • Yang, P., L. Miao, Z. Xue, and B. Ye. 2015. “Variable Neighborhood Search Heuristic for Storage Location Assignment and Storage/retrieval Scheduling Under Shared Storage in Multi-shuttle Automated Storage/retrieval Systems.” Transportation Research, Part E: Logistics Transportation Review 79: 164–177.

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.