GRASP with variable neighborhood descent for the online order batching problem
From MaRDI portal
Publication:2022211
Recommendations
- A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
- Algorithms for on-line order batching in an order picking warehouse
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Variable neighborhood search strategies for the order batching problem
- General variable neighborhood search applied to the picking process in a warehouse
Cites work
- A comparison of heuristics for the problem of batching orders for warehouse selection
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
- Algorithms for on-line order batching in an order picking warehouse
- Design and control of warehouse order picking: a literature review
- Efficient orderbatching methods in warehouses
- General variable neighborhood search applied to the picking process in a warehouse
- General variable neighborhood search for the order batching and sequencing problem
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 1488163 (Why is no real title available?)
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Parallel variable neighborhood search for the min-max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Research on warehouse design and performance evaluation: a comprehensive review
- Routing methods for warehouses with multiple cross aisles
- Tabu search heuristics for the order batching problem in manual order picking systems
- Variable neighborhood search
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search strategies for the order batching problem
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: methods and applications
Cited in
(9)- Variable neighborhood search strategies for the order batching problem
- Algorithms for on-line order batching in an order picking warehouse
- Preface to the special issue ``ICVNS 2018
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
- Order batching problems: taxonomy and literature review
- A study on online scheduling problem of integrated order picking and delivery with multizone vehicle routing method for online-to-offline supermarket
This page was built for publication: GRASP with variable neighborhood descent for the online order batching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2022211)
