Modelling and solving the joint order batching and picker routing problem in inventories

DOI10.1007/978-3-319-45587-7_8MaRDI QIDQ2835664zbMATH OpenOpenAlexFDO

Authors Alexandre Salles da Cunha, Cristiano Arbex Valle, J. E. Beasley

Publication date 30 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-45587-7_8

zbMATH Keywords

integer programminginventory managementpicker routingorder batching

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)

Recommendations

• Optimally solving the joint order batching and picker routing problem
• 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
• Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem

Cites work

• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A cutting plane procedure for the travelling salesman problem on road networks
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• A fundamental problem in vehicle routing
• A new approach to the maximum-flow problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An order-picking operations system for managing the batching activities in a warehouse
• Compact formulations of the Steiner traveling salesman problem and related problems
• Design and control of warehouse order picking: a literature review
• Efficient orderbatching methods in warehouses
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• Routing methods for warehouses with multiple cross aisles
• Routing order pickers in a warehouse with a middle aisle
• Tabu search heuristics for the order batching problem in manual order picking systems
• The traveling salesman problem on a graph and some related integer polyhedra
• Using a TSP heuristic for routing order pickers in warehouses
• Variable neighborhood search for order batching in a warehouse

Cited in

(11)

• The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm
• The picking and packing problem in buy-online-pick-up-in-store retailing
• Optimally solving the joint order batching and picker routing problem
• Exact algorithms for the order picking problem
• Order batching problems: taxonomy and literature review
• A novel approach for modeling order picking paths
• The study of joint order batching and picker routing problem with food and nonfood category constraint in online‐to‐offline grocery store
• Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
• 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

Describes a project that uses

Uses Software

• MySQL
• CPLEX

This page was built for publication: Modelling and solving the joint order batching and picker routing problem in inventories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835664)