Order allocation, rack allocation and rack sequencing for pickers in a mobile rack environment
TL;DR: It is proved that, subject to certain conditions being satisfied, a feasible rack sequence for all orders can be produced by focusing on just a subset of the orders to be dealt with by the picker.
About: This article is published in Computers & Operations Research.The article was published on 2020-09-01 and is currently open access. It has received 35 citations till now.
Citations
More filters
TL;DR: In this paper , the value creation of utilizing the Industrial Internet of Things (IIoT)-driven resource synchronization and sharing-based robotic mobile fulfillment system (RMFS) to enhance the overall operational effectiveness and efficiencies during information transfer and synchronization of resources is addressed.
24 citations
TL;DR: By providing a TO-BE analysis of RPA and cloud-based CPS framework, a data-driven approach is proposed for zone clustering and storage location assignment classification in RMFS to gain better operational efficiency.
22 citations
TL;DR: This paper proposes an adaptive large neighborhood search method, which builds on a newly developed data-driven heuristic that exploits the structure of the problem and simulated annealing and can save up to 62% in rack movements compared to the company’s current practice.
17 citations
TL;DR: This study proposes a location assignment strategy for goods clustering and rack turnover, which utilizes reservation tables, sets AGV operation rules to resolve AGV running conflicts, and improves the A-star(A*) algorithm based on the node load to find the shortest path by which the AGV handling the racks can complete the order picking.
Abstract: The robotic mobile fulfillment system (RMFS) is a new automatic warehousing system, a type of green technology, and an emerging trend in the logistics industry. In this study, we take an RMFS as the research object and combine the connected issues of storage location assignment and path planning into one optimization problem from the perspective of collaborative optimization. A sustainable mathematical model for the collaborative optimization of storage location assignment and path planning (COSLAPP) is established, which considers the relationship between the location assignment of goods and rack storage and path planning in an RMFS. On this basis, we propose a location assignment strategy for goods clustering and rack turnover, which utilizes reservation tables, sets AGV operation rules to resolve AGV running conflicts, and improves the A-star(A*) algorithm based on the node load to find the shortest path by which the AGV handling the racks can complete the order picking. Ultimately, simulation studies were performed to ascertain the effectiveness of COSLAPP in the RMFS; the results show that the new approach can significantly improve order picking efficiency, reduce energy consumption, and lessen the operating costs of the warehouse of a distribution center.
14 citations
TL;DR: In e-commerce fulfilment centers, storage assignment is critical to ensure short response times as discussed by the authors, and many online retailers have moved to product dispersion in combination with product distribution.
Abstract: In e-commerce fulfilment centres, storage assignment is critical to ensure short response times. To achieve this, many online retailers have moved to product dispersion in combination with product ...
13 citations
Cites background from "Order allocation, rack allocation a..."
...Valle and Beasley (2021) and Xie et al. (2021) model assignment decisions on orders to pick stations and pods to pick stations in RMF systems....
[...]
References
More filters
01 Jan 1979
42,654 citations
Book•
01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Abstract: This is the second edition of a quarterly column the purpose of which is to provide a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book ‘‘Computers and Intractability: A Guide to the Theory of NP-Completeness,’’ W. H. Freeman & Co., San Francisco, 1979 (hereinafter referred to as ‘‘[G&J]’’; previous columns will be referred to by their dates). A background equivalent to that provided by [G&J] is assumed. Readers having results they would like mentioned (NP-hardness, PSPACE-hardness, polynomial-time-solvability, etc.), or open problems they would like publicized, should send them to David S. Johnson, Room 2C355, Bell Laboratories, Murray Hill, NJ 07974, including details, or at least sketches, of any new proofs (full papers are preferred). In the case of unpublished results, please state explicitly that you would like the results mentioned in the column. Comments and corrections are also welcome. For more details on the nature of the column and the form of desired submissions, see the December 1981 issue of this journal.
40,020 citations
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Abstract: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held. These experiences made me aware that seemingly simple discrete optimization problems could hold the seeds of combinatorial explosions. The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible. Jack Edmonds’ papers and a few key discussions with him drew my attention to the crucial distinction between polynomial-time and superpolynomial-time solvability. I was also influenced by Jack’s emphasis on min-max theorems as a tool for fast verification of optimal solutions, which foreshadowed Steve Cook’s definition of the complexity class NP. Another influence was George Dantzig’s suggestion that integer programming could serve as a universal format for combinatorial optimization problems.
8,644 citations
01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Abstract: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held. These experiences made me aware that seemingly simple discrete optimization problems could hold the seeds of combinatorial explosions. The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible. Jack Edmonds’ papers and a few key discussions with him drew my attention to the crucial distinction between polynomial-time and superpolynomial-time solvability. I was also influenced by Jack’s emphasis on min-max theorems as a tool for fast verification of optimal solutions, which foreshadowed Steve Cook’s definition of the complexity class NP. Another influence was George Dantzig’s suggestion that integer programming could serve as a universal format for combinatorial optimization problems.
7,714 citations
"Order allocation, rack allocation a..." refers methods in this paper
...We can prove this theorem by reference to the minimum set cover problem, whose decision version is one of Karp’s 21 NP-complete problems [Garey and Johnson, 1979, Karp, 1972]....
[...]
TL;DR: In this paper, a literature overview on typical decision problems in design and control of manual order-picking processes is given, focusing on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning.
1,603 citations