Pages that link to "Item:Q4674401"

The following pages link to Routing methods for warehouses with multiple cross aisles (Q4674401):

Displaying 50 items.

• A travel time estimation model for a high-level picker-to-part system with class-based storage policies (Q296631) (← links)
• MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (Q319040) (← links)
• An algorithm for dynamic order-picking in warehouse operations (Q320634) (← links)
• A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
• Research on warehouse operation: a comprehensive review (Q856191) (← links)
• Design and control of warehouse order picking: a literature review (Q881508) (← links)
• The impact of order batching and picking area zoning on order picking system performance (Q1026778) (← links)
• Using a TSP heuristic for routing order pickers in warehouses (Q1044093) (← links)
• Variable neighborhood search strategies for the order batching problem (Q1652118) (← links)
• Picker routing in rectangular mixed shelves warehouses (Q1652640) (← links)
• Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems (Q1694923) (← links)
• General variable neighborhood search for the order batching and sequencing problem (Q1695017) (← links)
• A discrete cross aisle design model for order-picking warehouses (Q1713732) (← links)
• Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review (Q1754199) (← links)
• An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses (Q1754220) (← links)
• Throughput analysis for order picking system with multiple pickers and Aisle congestion considerations (Q1762155) (← links)
• Exact algorithms for the order picking problem (Q1782167) (← links)
• GRASP with variable neighborhood descent for the online order batching problem (Q2022211) (← links)
• Optimal in-store fulfillment policies for online orders in an omni-channel retail environment (Q2030356) (← links)
• An extensible multi-block layout warehouse routing optimization model (Q2083945) (← links)
• Inventory routing in a warehouse: the storage replenishment routing problem (Q2140300) (← links)
• New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
• Order batching using an approximation for the distance travelled by pickers (Q2178066) (← links)
• An efficient and general approach for the joint order batching and picker routing problem (Q2183853) (← links)
• Optimization of order-picking problems by intelligent optimization algorithm (Q2193380) (← links)
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing (Q2401327) (← links)
• Travel time estimation and order batching in a 2-block warehouse (Q2432910) (← links)
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
• General variable neighborhood search applied to the picking process in a warehouse (Q2631231) (← links)
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem (Q2668601) (← links)
• A computational software system to design order picking warehouses (Q2668754) (← links)
• Wave order picking under the mixed-shelves storage strategy: a solution method and advantages (Q2669653) (← links)
• A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing (Q2670493) (← links)
• Efficient algorithms for travelling salesman problems arising in warehouse order picking (Q2788859) (← links)
• Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories (Q2835664) (← links)
• A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information (Q3163710) (← links)
• Travel distance estimation and storage zone optimization in a 2-block class-based storage strategy warehouse (Q3369509) (← links)
• Order batching in walk-and-pick order picking systems (Q3533177) (← links)
• Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time (Q3605454) (← links)
• The Study of Depot Position Effect on Travel Distance in Order Picking Problem (Q5026178) (← links)
• (Q5103833) (← links)
• Parallel variable neighborhood search for the min–max order batching problem (Q5278230) (← links)
• A study on order-batching methods of order-picking in a distribution centre with two cross-aisles (Q5485052) (← links)
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE (Q5850790) (← links)
• Approximate Optimal Order Batch Sizes in a Parallel aisle Warehouse (Q5850935) (← links)
• A novel approach for modeling order picking paths (Q6076484) (← links)
• Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses (Q6087542) (← links)
• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store (Q6092600) (← links)
• Exact results for the order picking time distribution under return routing (Q6161911) (← links)