GRASP with variable neighborhood descent for the online order batching problem
From MaRDI portal
Publication:2022211
DOI10.1007/s10898-020-00910-2zbMath1465.90045OpenAlexW3026000362MaRDI QIDQ2022211
Antonio Alonso-Ayuso, Eduardo G. Pardo, Sergio Gil-Borrás, Abraham Duarte
Publication date: 28 April 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00910-2
Applications of mathematical programming (90C90) Integer programming (90C10) Minimax problems in mathematical programming (90C47)
Related Items
Wave order picking under the mixed-shelves storage strategy: a solution method and advantages, Order batching problems: taxonomy and literature review, Preface to the special issue ``ICVNS 2018
Cites Work
- Unnamed Item
- MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem
- Design and control of warehouse order picking: a literature review
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Variable neighbourhood search: methods and applications
- Research on warehouse design and performance evaluation: a comprehensive review
- Variable neighborhood search
- Variable neighborhood search strategies for the order batching problem
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Order picking with multiple pickers and due dates -- simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems
- General variable neighborhood search for the order batching and sequencing problem
- Algorithms for on-line order batching in an order picking warehouse
- Greedy randomized adaptive search procedures
- Tabu search heuristics for the order batching problem in manual order picking systems
- 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
- General variable neighborhood search applied to the picking process in a warehouse
- 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
- Parallel variable neighborhood search for the min–max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- 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
- Variable neighborhood search: Principles and applications
