The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
From MaRDI portal
Publication:2668601
DOI10.1016/j.cor.2020.105168OpenAlexW3112004685MaRDI QIDQ2668601
Trijntje Cornelissens, Babiche Aerts, Kenneth Sörensen
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105168
Cites Work
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Hybrid metaheuristics for the clustered vehicle routing problem
- Design and control of warehouse order picking: a literature review
- The impact of order batching and picking area zoning on order picking system performance
- Using a TSP heuristic for routing order pickers in warehouses
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
- Variable neighborhood search strategies for the order batching problem
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Optimally solving the joint order batching and picker routing problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Tabu search heuristics for the order batching problem in manual order picking systems
- An efficient transformation of the generalized vehicle routing problem
- An efficient and general approach for the joint order batching and picker routing problem
- Exact solution of the soft-clustered vehicle-routing problem
- On-line order batching and sequencing problem with multiple pickers: a hybrid rule-based algorithm
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing
- New mathematical models of the generalized vehicle routing problem and extensions
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- A comparison of heuristics for the problem of batching orders for warehouse selection
- Efficient orderbatching methods in warehouses
- Routing methods for warehouses with multiple cross aisles
- Exact Algorithms for the Clustered Vehicle Routing Problem
- A decomposition-based method for solving the clustered vehicle routing problem
- Joint order batching and order picking in warehouse operations
- A study on order-batching methods of order-picking in a distribution centre with two cross-aisles
- VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE
This page was built for publication: The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem
