A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
From MaRDI portal
Publication:2514749
DOI10.1016/j.ejor.2013.06.001zbMath1304.90040OpenAlexW2075076850MaRDI QIDQ2514749
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.001
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items (24)
An integrated model to improve ergonomic and economic performance in order picking by rotating pallets ⋮ MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem ⋮ 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 ⋮ 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 ⋮ Order batching using an approximation for the distance travelled by pickers ⋮ Wave order picking under the mixed-shelves storage strategy: a solution method and advantages ⋮ 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 ⋮ 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 ⋮ 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 ⋮ On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm ⋮ Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
Uses Software
Cites Work
- Unnamed Item
- The attribute based hill climber
- Design and control of warehouse order picking: a literature review
- Using a TSP heuristic for routing order pickers in warehouses
- An inexact algorithm for the sequential ordering problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- Tabu search heuristics for the order batching problem in manual order picking systems
- Integer Programming Formulation of Traveling Salesman Problems
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Convergence of an annealing algorithm
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- THE PRECEDENCE CONSTRAINED TRAVELING SALESMAN PROBLEM
- Efficient orderbatching methods in warehouses
- Routing methods for warehouses with multiple cross aisles
- Simulated Annealing: Searching for an Optimal Temperature Schedule
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
- Routing order pickers in a warehouse with a middle aisle
This page was built for publication: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
