Order batching optimization based on Canopy and k-means algorithm

DOI10.3969/J.ISSN.1003-5060.2017.03.023MaRDI QIDQ4624349zbMATH OpenFDO

Authors Xiaojian Hu, Chaohao Wei

Publication date 22 February 2019

Full work available at URL https://doi.org/10.3969/J.ISSN.1003-5060.2017.03.023

zbMATH Keywords

\(k\)-means algorithmCanopy algorithmorder batchingsorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Order batching heuristic seed algorithm based on compound similarity of orders
• A hybrid clustering method based on zoning route optimization
• Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
• Order sequence optimization for parts-to-picker intelligent robot system
• Optimization of order-picking problems by intelligent optimization algorithm

Cited in

(4)

• Optimization of product category allocation in multiple warehouses to minimize splitting of online supermarket customer orders
• Predicting packaging sizes using machine learning
• A hybrid clustering method based on zoning route optimization
• Order batching heuristic seed algorithm based on compound similarity of orders

This page was built for publication: Order batching optimization based on Canopy and \(k\)-means algorithm

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