MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
From MaRDI portal
(Redirected from Publication:319040)
Recommendations
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Variable neighborhood search strategies for the order batching problem
- Order batching in walk-and-pick order picking systems
- Tabu search heuristics for the order batching problem in manual order picking systems
- GRASP with variable neighborhood descent for the online order batching problem
Cites work
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
- A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
- Algorithms for on-line order batching in an order picking warehouse
- Batch construction heuristics and storage assignment strategies for walk/ride and pick systems
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Design and control of warehouse order picking: a literature review
- Efficient orderbatching methods in warehouses
- Order batching in walk-and-pick order picking systems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
- Research on warehouse design and performance evaluation: a comprehensive review
- Research on warehouse operation: a comprehensive review
- Rich routing problems arising in supply chain management
- Routing methods for warehouses with multiple cross aisles
- TTT plots: a perl program to create time-to-target plots
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Tabu search heuristics for the order batching problem in manual order picking systems
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
- The savings algorithm for the vehicle routing problem
- VLSN search algorithms for partitioning problems using matching neighbourhoods
- Variable neighborhood search for order batching in a warehouse
Cited in
(15)- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
- scientific article; zbMATH DE number 7686970 (Why is no real title available?)
- Warehousing in the e-commerce era: a survey
- Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem
- A matheuristic approach for the design of multiproduct batch plants with parallel production lines
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Parallel variable neighborhood search for the min-max order batching problem
- GRASP with variable neighborhood descent for the online order batching problem
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- Storage assignment and order batching problem in Kiva mobile fulfilment system
- Order batching problems: taxonomy and literature review
- A multicommodity pickup and delivery problem with time windows and handling time in the omni-channel last-mile delivery
- Variable neighborhood search strategies for the order batching problem
This page was built for publication: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319040)
