MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem

DOI10.1016/j.ejor.2014.11.025zbMath1346.90165OpenAlexW2027520034MaRDI QIDQ319040

Temel Öncan

Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2014.11.025

zbMATH Keywords

local searchmixed integer linear programmingwarehouse managementorder batching problem

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (14)

Parallel variable neighborhood search for the min–max order batching problem ⋮ A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem ⋮ A matheuristic approach for the design of multiproduct batch plants with parallel production lines ⋮ Storage assignment and order batching problem in Kiva mobile fulfilment system ⋮ Variable neighborhood search strategies for the order batching problem ⋮ A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices ⋮ The joint order batching and picker routing problem: modelled and solved as a clustered vehicle routing problem ⋮ A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem ⋮ Order batching problems: taxonomy and literature review ⋮ Unnamed Item ⋮ Warehousing in the e-commerce era: a survey ⋮ Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse ⋮ Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review ⋮ GRASP with variable neighborhood descent for the online order batching problem

Uses Software

• PERL
• TTTPLOTS

Cites Work

• Unnamed Item
• Research on warehouse operation: a comprehensive review
• Design and control of warehouse order picking: a literature review
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm
• Research on warehouse design and performance evaluation: a comprehensive review
• The savings algorithm for the vehicle routing problem
• Algorithms for on-line order batching in an order picking warehouse
• Batch picking in narrow-aisle order picking systems with consideration for picker blocking
• Tabu search heuristics for the order batching problem in manual order picking systems
• Rich routing problems arising in supply chain management
• TTT plots: a perl program to create time-to-target plots
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Batch Construction Heuristics and Storage Assignment Strategies for Walk/Ride and Pick Systems
• Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
• VLSN search algorithms for partitioning problems using matching neighbourhoods
• Order batching in walk-and-pick order picking systems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
• Efficient orderbatching methods in warehouses
• Routing methods for warehouses with multiple cross aisles
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
• VARIABLE NEIGHBORHOOD SEARCH FOR ORDER BATCHING IN A WAREHOUSE

This page was built for publication: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem