Routing methods for warehouses with multiple cross aisles

DOI10.1080/00207540110028128MaRDI QIDQ4674401zbMATH OpenOpenAlexFDO

Authors Kees Jan Roodbergen, René de Koster

Publication date 11 May 2005

Published in International Journal of Production Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207540110028128

zbMATH Keywords

branch-and-bound algorithmheuristicsrouting and layout issues

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Routing order pickers in a warehouse with a middle aisle
• The effect of warehouse cross aisles on order picking efficiency
• A discrete cross aisle design model for order-picking warehouses
• scientific article; zbMATH DE number 1189262
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points

Cited in

(66)

• The impact of order batching and picking area zoning on order picking system performance
• Using a TSP heuristic for routing order pickers in warehouses
• \(k\)-interchange heuristic as an optimization procedure for material handling applications
• Variable neighborhood search strategies for the order batching problem
• Picker routing in rectangular mixed shelves warehouses
• Optimally solving the joint order batching and picker routing problem
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• General variable neighborhood search for the order batching and sequencing problem
• A discrete cross aisle design model for order-picking warehouses
• 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
• Throughput analysis for order picking system with multiple pickers and Aisle congestion considerations
• Exact algorithms for the order picking problem
• GRASP with variable neighborhood descent for the online order batching problem
• Optimal in-store fulfillment policies for online orders in an omni-channel retail environment
• An extensible multi-block layout warehouse routing optimization model
• Inventory routing in a warehouse: the storage replenishment routing problem
• New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
• Order batching using an approximation for the distance travelled by pickers
• An efficient and general approach for the joint order batching and picker routing problem
• Optimization of order-picking problems by intelligent optimization algorithm
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
• Travel time estimation and order batching in a 2-block warehouse
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• General variable neighborhood search applied to the picking process in a warehouse
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
• A computational software system to design order picking warehouses
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
• A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing
• Efficient algorithms for travelling salesman problems arising in warehouse order picking
• Modelling and solving the joint order batching and picker routing problem in inventories
• A travel time estimation model for a high-level picker-to-part system with class-based storage policies
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
• A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• An algorithm for dynamic order-picking in warehouse operations
• A new mathematical programming formulation for the single-picker routing problem
• Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse
• Order batching in walk-and-pick order picking systems
• Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
• scientific article; zbMATH DE number 1189262 (Why is no real title available?)
• The effect of warehouse cross aisles on order picking efficiency
• The Study of Depot Position Effect on Travel Distance in Order Picking Problem
• Analytical and simulation determination of order picking time in a low storage warehouse for shared storage systems
• Optimizing fishbone aisles for dual-command operations in a warehouse
• Parallel variable neighborhood search for the min-max order batching problem
• A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
• Variable neighborhood search for order batching in a warehouse
• Approximate optimal order batch sizes in a parallel aisle warehouse
• Routing order pickers in a warehouse with a middle aisle
• A novel approach for modeling order picking paths
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
• Exact results for the order picking time distribution under return routing
• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
• An exact analysis and comparison of manual picker routing heuristics
• Integrated scattered storage and picker routing in picker-to-parts warehouses
• A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses
• A survey on the traveling salesman problem and its variants in a warehousing context
• Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing
• 50 years of warehousing research -- an operations research perspective
• Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations
• Solving the multi-block order batching problem with branch-price-and-cut
• A linear-size model for the single picker routing problem with scattered storage
• Research on warehouse operation: a comprehensive review
• Design and control of warehouse order picking: a literature review

This page was built for publication: Routing methods for warehouses with multiple cross aisles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4674401)