Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
From MaRDI portal
Publication:3674397
DOI10.1287/opre.31.3.507zbMath0523.90060OpenAlexW2017932090MaRDI QIDQ3674397
Arnon Rosenthal, H. Donald Ratliff
Publication date: 1983
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.31.3.507
algorithmcombinatorial optimizationtraveling salesman problemitem retrievalorder-pickingrectangular warehouse
Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Parallel variable neighborhood search for the min–max order batching problem, An integrated model to improve ergonomic and economic performance in order picking by rotating pallets, A correlated storage location assignment problem in a single-block-multi-aisles warehouse considering BOM information, The multiple traveling salesman problem on spiders, Picker routing in the mixed-shelves warehouses of e-commerce retailers, Inventory routing in a warehouse: the storage replenishment routing problem, The Steiner traveling salesman problem with online edge blockages, 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, Special cases of travelling salesman problems and heuristics, New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot, Research on warehouse operation: a comprehensive review, The Steiner traveling salesman problem with online advanced edge blockages, Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane, Variable neighborhood search strategies for the order batching problem, Picker routing in rectangular mixed shelves warehouses, Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing, Picker Routing in AGV-Assisted Order Picking Systems, Query batching optimization in database systems, Hamiltonian properties of Toeplitz graphs, Order batching using an approximation for the distance travelled by pickers, Design and control of warehouse order picking: a literature review, 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, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, Batch picking in narrow-aisle order picking systems with consideration for picker blocking, A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing, A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods, A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem, An efficient and general approach for the joint order batching and picker routing problem, Optimally solving the joint order batching and picker routing problem, A novel approach for modeling order picking paths, Order batching problems: taxonomy and literature review, 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, Cost-neutral reduction of infection risk in picker-to-parts warehousing systems, Energy minimizing order picker forklift routing problem, \(k\)-interchange heuristic as an optimization procedure for material handling applications, Utilizing individual picker skills to improve order batching in a warehouse, Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems, Crane scheduling in railway yards: an analysis of computational complexity, A discrete cross aisle design model for order-picking warehouses, Order batching in walk-and-pick order picking systems, Exact and inexact solution procedures for the order picking in an automated carousal conveyor, The deterministic product location problem under a pick-by-order policy, Genetic algorithm and its performance analysis for scheduling a single crane, Locational analysis, The kissing problem: how to end a gathering when everyone kisses everyone else goodbye, The traveling salesman problem in graphs with some excluded minors, Warehousing in the e-commerce era: a survey, Vehicle Routing Problems and Container Terminal Operations – An Update of Research, The most vital edges with respect to the number of spanning trees in two- terminal series-parallel graphs, A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system, An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses, The warehouse-inventory-transportation problem for supply chains, An exact method for scheduling a yard crane, Algorithms for on-line order batching in an order picking warehouse, GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY, An evaluation of routing policies for order-picking operations in low-level picker-to-part system, Routing order pickers in a warehouse with a middle aisle, Optimizing fishbone aisles for dual‐command operations in a warehouse, GRASP with variable neighborhood descent for the online order batching problem, Exact algorithms for the order picking problem, EFFICIENT ALGORITHMS FOR TRAVELLING SALESMAN PROBLEMS ARISING IN WAREHOUSE ORDER PICKING, Scheduling taxi services for a team of car relocators, The forgotten sons: warehousing systems for brick-and-mortar retail chains, The vehicle routing problem with pickups and deliveries on some special graphs, Unnamed Item, 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 heuristics based on cluster analysis in a low-level picker-to-part warehousing system, A new integer programming formulation of the graphical traveling salesman problem, A new integer programming formulation of the graphical traveling salesman problem, Travel time analysis for general item location assignment in a rectangular warehouse, Joint order batching and order picking in warehouse operations, Randomized heuristics for the family traveling salesperson problem, A study on order-batching methods of order-picking in a distribution centre with two cross-aisles, Special issue on Locational analysis, Location of rectilinear center trajectories, Clustering-based order-picking sequence algorithm for an automated warehouse, Order batching and batch sequencing in an AMR-assisted picker-to-parts system, Modeling Single-Picker Routing Problems in Classical and Modern Warehouses, Warehouse design and control: Framework and literature review, A model for warehouse order picking, The multicommodity traveling salesman problem with priority prizes: a mathematical model and metaheuristics, Using a TSP heuristic for routing order pickers in warehouses, An extensible multi-block layout warehouse routing optimization model, VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE, A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem, The traveling salesman problem on a graph and some related integer polyhedra, Stack-up algorithms for palletizing at delivery industry, A note on the tour problems in two-terminal series-parallel graphs, An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices, New polynomially solvable classes and a new heuristic for the traveling salesman problem and its generalization
