A Linear-Size Model for the Single Picker Routing Problem with Scattered Storage

No abstract is available for this paper.

• Publication year

  2025

• Venue

  European Journal of Operational Research

• Publication date

  2025-11-01

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1016/j.ejor.2025.11.002
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies

  2024cited by this paper
• Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations

  2024cited by this paper
• The picker routing problem in mixed-shelves, multi-block warehouses

  2024cited by this paper
• A note about a transition of Ratliff and Rosenthal's order picking algorithm for rectangular warehouses

  2024cited by this paper
• Exact Solution of the Single-Picker Routing Problem with Scattered Storage

  2024cited by this paper
• A note on the linearity of Ratliff and Rosenthal's algorithm for optimal picker routing

  2022cited by this paper
• An extensible multi-block layout warehouse routing optimization model

  2022cited by this paper
• Order picker routing in warehouses: A systematic literature review

  2020cited by this paper
• Warehousing in the e-commerce era: A survey

  2019cited by this paper
• Picker routing in the mixed-shelves warehouses of e-commerce retailers

  2019cited by this paper
• Modeling Single Picker Routing Problems in Classical and Modern Warehouses

  2019cited by this paper
• Picker routing in rectangular mixed shelves warehouses

  2018cited by this paper
• Exact algorithms for the order picking problem

  2017cited by this paper
• Order picking under random and turnover-based storage policies in fishbone aisle warehouses

  2014cited by this paper
• A Reference Point Approach for the Resource Constrained Shortest Path Problems

  2013cited by this paper
• Optimal unit-load warehouse designs for single-command operations

  2012cited by this paper
• The Generalized Traveling Salesman and Orienteering Problems

  2007cited by this paper
• Resource Constraints

  2004cited by this paper
• Routing methods for warehouses with multiple cross aisles

  2001cited by this paper
• Routing order pickers in a warehouse with a middle aisle

  2001cited by this paper
• An effective implementation of the Lin-Kernighan traveling salesman heuristic

  2000cited by this paper
• A model for warehouse order picking

  1998cited by this paper
• A branch and bound algorithm for the traveling purchaser problem

  1997cited by this paper
• An evaluation of order picking routeing policies

  1997cited by this paper
• DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE

  1993cited by this paper
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem

  1983cited by this paper
• Integer Programming Formulation of Traveling Salesman Problems

  1960cited by this paper

• One fits all: a flexible branch-and-cut algorithm for picker routing in scattered storage warehouses

  2026cites this paper