Routing methods for warehouses with multiple cross aisles

DOI10.1080/00207540110028128zbMATH Open1060.90519OpenAlexW2075041695MaRDI QIDQ4674401FDOQ4674401

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

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

zbMATH Keywords

branch-and-bound algorithmheuristicsrouting and layout issues

Mathematics Subject Classification ID

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

Cited In (55)

• 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
• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
• An exact analysis and comparison of manual picker routing heuristics
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
• Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
• Order batching in walk-and-pick order picking systems
• Parallel variable neighborhood search for the min–max order batching problem
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
• Optimal in-store fulfillment policies for online orders in an omni-channel retail environment
• An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
• Title not available (Why is that?)
• Inventory routing in a warehouse: the storage replenishment routing problem
• A travel time estimation model for a high-level picker-to-part system with class-based storage policies
• Picker routing in rectangular mixed shelves warehouses
• Design and control of warehouse order picking: a literature review
• Routing order pickers in a warehouse with a middle aisle
• A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
• Research on warehouse operation: a comprehensive review
• Optimally solving the joint order batching and picker routing problem
• General variable neighborhood search for the order batching and sequencing problem
• New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
• An algorithm for dynamic order-picking in warehouse operations
• A new mathematical programming formulation for the single-picker routing problem
• Exact algorithms for the order picking problem
• The Study of Depot Position Effect on Travel Distance in Order Picking Problem
• GRASP with variable neighborhood descent for the online order batching problem
• The impact of order batching and picking area zoning on order picking system performance
• 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
• A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing
• Optimization of order-picking problems by intelligent optimization algorithm
• A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
• Throughput analysis for order picking system with multiple pickers and Aisle congestion considerations
• Optimizing fishbone aisles for dual-command operations in a warehouse
• A novel approach for modeling order picking paths
• Using a TSP heuristic for routing order pickers in warehouses
• General variable neighborhood search applied to the picking process in a warehouse
• \(k\)-interchange heuristic as an optimization procedure for material handling applications
• Variable neighborhood search for order batching in a warehouse
• Efficient algorithms for travelling salesman problems arising in warehouse order picking
• Travel time estimation and order batching in a 2-block warehouse
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• A computational software system to design order picking warehouses
• Variable neighborhood search strategies for the order batching problem
• Approximate optimal order batch sizes in a parallel aisle warehouse
• An extensible multi-block layout warehouse routing optimization model
• 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
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
• Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing

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)