Exact algorithms for the order picking problem

DOI10.1016/j.cor.2018.07.002zbMath1458.90126arXiv1703.00699OpenAlexW2807185344WikidataQ129538515 ScholiaQ129538515MaRDI QIDQ1782167

Lucie Pansart, Nicolas Catusse, Hadrien Cambazard

Publication date: 18 September 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1703.00699

zbMATH Keywords

TSPinteger programmingdynamic programmingorder pickingSteiner TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (13)

Inventory routing in a warehouse: the storage replenishment routing problem ⋮ New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot ⋮ Picker Routing in AGV-Assisted Order Picking Systems ⋮ Query batching optimization in database systems ⋮ A computational software system to design order picking warehouses ⋮ An efficient and general approach for the joint order batching and picker routing problem ⋮ Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses ⋮ Optimization of order-picking problems by intelligent optimization algorithm ⋮ Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm ⋮ The forgotten sons: warehousing systems for brick-and-mortar retail chains ⋮ Modeling Single-Picker Routing Problems in Classical and Modern Warehouses ⋮ An extensible multi-block layout warehouse routing optimization model ⋮ The Study of Depot Position Effect on Travel Distance in Order Picking Problem

Uses Software

• LKH

Cites Work

• Compact formulations of the Steiner traveling salesman problem and related problems
• A new mathematical programming formulation for the single-picker routing problem
• Minimum Manhattan network is NP-complete
• Using a TSP heuristic for routing order pickers in warehouses
• A cutting plane procedure for the travelling salesman problem on road networks
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
• The minimum Manhattan network problem: Approximations and exact solutions
• Modelling and Solving the Joint Order Batching and Picker Routing Problem in Inventories
• Chained Lin-Kernighan for Large Traveling Salesman Problems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• The traveling salesman problem on a graph and some related integer polyhedra
• A fundamental problem in vehicle routing
• Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
• The effect of warehouse cross aisles on order picking efficiency
• Routing methods for warehouses with multiple cross aisles
• Solution of a Large-Scale Traveling-Salesman Problem
• Joint order batching and order picking in warehouse operations
• Routing order pickers in a warehouse with a middle aisle

This page was built for publication: Exact algorithms for the order picking problem