Order batching heuristic seed algorithm based on compound similarity of orders

DOI10.13383/J.CNKI.JSE.2020.06.007MaRDI QIDQ4996275zbMATH OpenFDO

Authors Ke Xiao, Yong Xie, Hongwei Wang, Hailong Gao, Zhengguo Wang

Publication date 1 July 2021

Full work available at URL https://doi.org/10.13383/J.CNKI.JSE.2020.06.007

zbMATH Keywords

due datedistribution centerorder batchingheuristic seed algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Efficient orderbatching methods in warehouses
• Order batching optimization based on Canopy and \(k\)-means algorithm
• A rule-based heuristic algorithm for on-line order batching and scheduling in an order picking warehouse with multiple pickers
• A comparison of heuristics for the problem of batching orders for warehouse selection
• Algorithms for on-line order batching in an order picking warehouse

Cited in

(2)

• Heuristic optimization of sequence of customer orders
• Order batching optimization based on Canopy and \(k\)-means algorithm

This page was built for publication: Order batching heuristic seed algorithm based on compound similarity of orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4996275)