General variable neighborhood search for the order batching and sequencing problem
From MaRDI portal
Publication:1695017
DOI10.1016/J.EJOR.2017.05.001zbMATH Open1380.90053OpenAlexW2610897102MaRDI QIDQ1695017FDOQ1695017
Authors: Borja Menéndez, Manuel Bustillo, Eduardo G. Pardo, Abraham Duarte 
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.05.001
Recommendations
- General variable neighborhood search applied to the picking process in a warehouse
- Variable neighborhood search strategies for the order batching problem
- Parallel variable neighborhood search for the min-max order batching problem
- Variable neighborhood search for order batching in a warehouse
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- Variable neighbourhood search: Methods and applications
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Variable neighborhood search
- Minimizing Total Tardiness on One Machine is NP-Hard
- Stochastic local search. Foundations and applications.
- Routing methods for warehouses with multiple cross aisles
- Algorithms for on-line order batching in an order picking warehouse
- Tabu search heuristics for the order batching problem in manual order picking systems
- Efficient orderbatching methods in warehouses
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search strategies for the order batching problem
- Title not available (Why is that?)
- Multi-objective variable neighborhood search: an application to combinatorial optimization problems
- Parallel variable neighborhood search for the min-max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
Cited In (20)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- The pollution traveling salesman problem with refueling
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- Warehousing in the e-commerce era: a survey
- Managing cutoff-based shipment promises for order fulfilment processes in warehousing
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Parallel variable neighborhood search for the min-max order batching problem
- GRASP with variable neighborhood descent for the online order batching problem
- Spatial and temporal optimization for smart warehouses with fast turnover
- General variable neighborhood search for the data mule scheduling problem
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
- Order batching problems: taxonomy and literature review
- Title not available (Why is that?)
- General variable neighborhood search applied to the picking process in a warehouse
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search strategies for the order batching problem
- Hybrid variable neighborhood search for automated warehouse scheduling
- Order batching using an approximation for the distance travelled by pickers
This page was built for publication: General variable neighborhood search for the order batching and sequencing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695017)
