General variable neighborhood search for the order batching and sequencing problem
From MaRDI portal
(Redirected from Publication:1695017)
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
Cites work
- Algorithms for on-line order batching in an order picking warehouse
- Efficient orderbatching methods in warehouses
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- scientific article; zbMATH DE number 1488163 (Why is no real title available?)
- Minimizing Total Tardiness on One Machine is NP-Hard
- 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
- Routing methods for warehouses with multiple cross aisles
- Stochastic local search. Foundations and applications.
- Tabu search heuristics for the order batching problem in manual order picking systems
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- Variable neighborhood search
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search strategies for the order batching problem
- Variable neighbourhood search: Methods and applications
Cited in
(22)- Variable neighborhood search strategies for the order batching problem
- A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem
- Warehousing in the e-commerce era: a survey
- General variable neighborhood search for the data mule scheduling problem
- GRASP with variable neighborhood descent for the online order batching problem
- A variable neighborhood search approach to solve the order batching problem with heterogeneous pick devices
- Order batching using an approximation for the distance travelled by pickers
- General variable neighborhood search applied to the picking process in a warehouse
- Spatial and temporal optimization for smart warehouses with fast turnover
- Wave order picking under the mixed-shelves storage strategy: a solution method and advantages
- Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
- scientific article; zbMATH DE number 2084732 (Why is no real title available?)
- Parallel variable neighborhood search for the min-max order batching problem
- Variable neighborhood search for order batching in a warehouse
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work
- Hybrid variable neighborhood search for automated warehouse scheduling
- Order batching problems: taxonomy and literature review
- 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
- Managing cutoff-based shipment promises for order fulfilment processes in warehousing
- Optimizing blocking and starving delays in sequential zone order picking systems through time-decomposed workload balancing
- Solving the multi-block order batching problem with branch-price-and-cut
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)
