Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
From MaRDI portal
Publication:3674397
Cited in
(only showing first 100 items - show all)- 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
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- 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
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- Vehicle Routing Problems and Container Terminal Operations – An Update of Research
- Genetic algorithm and its performance analysis for scheduling a single crane
- The multiple traveling salesman problem on spiders
- The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
- The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
- Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
- Locating charging stations and routing drones for efficient automated stocktaking
- Order batching in walk-and-pick order picking systems
- The traveling salesman problem in graphs with some excluded minors
- Warehousing in the e-commerce era: a survey
- Location of rectilinear center trajectories
- Joint order batching and order picking in warehouse operations
- An integrated model to improve ergonomic and economic performance in order picking by rotating pallets
- An evaluation of routing policies for order-picking operations in low-level picker-to-part system
- A new policy for scattered storage assignment to minimize picking travel distances
- Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses
- Special issue on Locational analysis
- Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
- Inventory routing in a warehouse: the storage replenishment routing problem
- The vehicle routing problem with pickups and deliveries on some special graphs
- Picker routing in the mixed-shelves warehouses of e-commerce retailers
- Picker routing in rectangular mixed shelves warehouses
- Design and control of warehouse order picking: a literature review
- Stack-up algorithms for palletizing at delivery industry
- The warehouse-inventory-transportation problem for supply chains
- Clustering-based order-picking sequence algorithm for an automated warehouse
- Novel planning problems in E-commerce warehousing
- Scheduling taxi services for a team of car relocators
- The forgotten sons: warehousing systems for brick-and-mortar retail chains
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- Picker routing in AGV-assisted order picking systems
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- The Steiner traveling salesman problem with online edge blockages
- Research on warehouse operation: a comprehensive 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
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- The Steiner traveling salesman problem with online advanced edge blockages
- Warehouse design and control: Framework and literature review
- 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
- The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
- An algorithm for dynamic order-picking in warehouse operations
- A new mathematical programming formulation for the single-picker routing problem
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot
- Exact algorithms for the order picking problem
- The deterministic product location problem under a pick-by-order policy
- Parallel variable neighborhood search for the min-max order batching problem
- Hamiltonian properties of Toeplitz graphs
- GRASP with variable neighborhood descent for the online order batching problem
- Query batching optimization in database systems
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- Randomized heuristics for the family traveling salesperson problem
- A discrete cross aisle design model for order-picking warehouses
- A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing
- A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information
- Travel time analysis for general item location assignment in a rectangular warehouse
- Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses
- Order batching problems: taxonomy and literature review
- Optimizing fishbone aisles for dual-command operations in a warehouse
- An exact method for scheduling a yard crane
- Energy minimizing order picker forklift routing problem
- Using a TSP heuristic for routing order pickers in warehouses
- A novel approach for modeling order picking paths
- Exact and inexact solution procedures for the order picking in an automated carousal conveyor
- Special cases of travelling salesman problems and heuristics
- Locational analysis
- Analytical and simulation determination of order picking time in a low storage warehouse for shared storage systems
- The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
- A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system
- A model for warehouse order picking
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
- \(k\)-interchange heuristic as an optimization procedure for material handling applications
- Algorithms for on-line order batching in an order picking warehouse
- The traveling salesman problem on a graph and some related integer polyhedra
- Efficient algorithms for travelling salesman problems arising in warehouse order picking
- Variable neighborhood search for order batching in a warehouse
- The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs
- Batch picking in narrow-aisle order picking systems with consideration for picker blocking
- A note on the tour problems in two-terminal series-parallel graphs
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- Utilizing individual picker skills to improve order batching in a warehouse
- Cost-neutral reduction of infection risk in picker-to-parts warehousing systems
- An exact analysis and comparison of manual picker routing heuristics
- A computational software system to design order picking warehouses
- Variable neighborhood search strategies for the order batching problem
- Order batching and batch sequencing in an AMR-assisted picker-to-parts system
- A variable neighborhood search algorithm for cost-balanced travelling salesman problem
This page was built for publication: Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3674397)