A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses-Reference-Cited by-同舟云学术

A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses

Published:2020-09 Issue: Volume:147 Page:106645
ISSN:0360-8352
Container-title:Computers & Industrial Engineering
language:en
Short-container-title:Computers & Industrial Engineering

Author:

Kübler Patrick,Glock Christoph H.,Bauernhansl Thomas

Publisher

Elsevier BV

Subject

General Engineering,General Computer Science

Reference84 articles.

1. Robust storage assignment in unit-load warehouses;Ang;Management Science,2012

2. Order Batching in warehouses by minimizing total tardiness: A hybrid approach of weighted association rule mining and genetic algorithms;Azadnia;The Scientific World Journal,2013

3. A survey on optimization metaheuristics;Boussaïd;Information Sciences,2013

4. Warehousing in the e-commerce era: A survey;Boysen;European Journal of Operational Research.,2018

5. An efficient and general approach for the joint order batching and picker routing problem;Briant;European Journal of Operational Research,2020

Cited by 32 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep reinforcement learning driven cost minimization for batch order scheduling in robotic mobile fulfillment systems;Expert Systems with Applications;2024-12

2. Synchronous Parallel Heuristics for Solving the Joint Order Batching and Picker Routing Problem;2024 IEEE Congress on Evolutionary Computation (CEC);2024-06-30

3. An integrated model for the production planning and the allocation of locations to items in a warehouse;Annals of Operations Research;2024-06-10

4. A hybrid approach integrating genetic algorithm and machine learning to solve the order picking batch assignment problem considering learning and fatigue of pickers;Computers & Industrial Engineering;2024-05

5. Storage Assignment Using Nested Metropolis Sampling and Approximations of Order Batching Travel Costs;SN Computer Science;2024-04-23