A model for warehouse order picking

DOI10.1016/S0377-2217(97)00043-XzbMath0957.90002MaRDI QIDQ1291697

Richard L. Daniels, Robert Schantz, Jeffrey L. Rummel

Publication date: 22 March 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

traveling salesman problemwarehouse operations

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items

Picker routing in the mixed-shelves warehouses of e-commerce retailers ⋮ Inventory routing in a warehouse: the storage replenishment routing problem ⋮ An algorithm for dynamic order-picking in warehouse operations ⋮ Research on warehouse operation: a comprehensive review ⋮ Picker routing in rectangular mixed shelves warehouses ⋮ Design and control of warehouse order picking: a literature review ⋮ 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 ⋮ Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses ⋮ Optimization of order-picking problems by intelligent optimization algorithm ⋮ Order batching in walk-and-pick order picking systems ⋮ Unnamed Item ⋮ Warehousing in the e-commerce era: a survey ⋮ A clustering algorithm for item assignment in a synchronized zone order picking system ⋮ Unnamed Item ⋮ A construction for directed in-out subgraphs of optimal size ⋮ Clustering-based order-picking sequence algorithm for an automated warehouse ⋮ Modeling Single-Picker Routing Problems in Classical and Modern Warehouses ⋮ Order picking algorithms for a two-carousel-single-crane automated storage and retrieval system ⋮ Using a TSP heuristic for routing order pickers in warehouses ⋮ An extensible multi-block layout warehouse routing optimization model ⋮ Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances

Cites Work

• Unnamed Item
• Unnamed Item
• A GRASP for a difficult single machine scheduling problem
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• The prize collecting traveling salesman problem
• Approximate Traveling Salesman Algorithms
• A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
• Tabu Search—Part I
• Tabu Search—Part II
• Storage-Retrieval Interleaving in Automatic Warehousing Systems
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem