A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
From MaRDI portal
(Redirected from Publication:2514749)
Recommendations
- A comparison of heuristics for the problem of batching orders for warehouse selection
- Sequencing single machine multiple-class customer order jobs using heuristics and improved simulated annealing algorithms
- Variable neighborhood search for order batching in a warehouse
- Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems
- Approximate optimal order batch sizes in a parallel aisle warehouse
- Algorithms for on-line order batching in an order picking warehouse
- Modified simulated annealing algorithms for the flow shop sequencing problem
- A two-phase algorithm for rolling batch planning based on simulated annealing
- Simulated annealing for optimization of a two-stage inventory system with transshipments
Cites work
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An inexact algorithm for the sequential ordering problem
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Convergence of an annealing algorithm
- Design and control of warehouse order picking: a literature review
- Efficient orderbatching methods in warehouses
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Integer Programming Formulation of Traveling Salesman Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Routing methods for warehouses with multiple cross aisles
- Routing order pickers in a warehouse with a middle aisle
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- Tabu search heuristics for the order batching problem in manual order picking systems
- The attribute based hill climber
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- Using a TSP heuristic for routing order pickers in warehouses
- Variable neighborhood search for order batching in a warehouse
Cited in
(26)- An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Optimally solving the joint order batching and picker routing problem
- Utilizing individual picker skills to improve order batching in a warehouse
- 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 route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Order batching in an automated warehouse with several vertical lift modules: optimization and experiments with real data
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- A hybrid algorithm for the vehicle routing problem with AND/OR precedence constraints and time windows
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
- Order batching using an approximation for the distance travelled by pickers
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Spatial and temporal optimization for smart warehouses with fast turnover
- Robust optimal control for a batch nonlinear enzyme-catalytic switched time-delayed process with noisy output measurements
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- Modelling and solving the joint order batching and picker routing problem in inventories
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Order batching problems: taxonomy and literature review
- The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
- Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
- Optimizing blocking and starving delays in sequential zone order picking systems through time-decomposed workload balancing
- A survey on the traveling salesman problem and its variants in a warehousing context
This page was built for publication: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514749)
