Clustering for Item Delivery Using Rule-K-Means

DOI10.22342/JIMS.26.2.871.185-191MaRDI QIDQ5142017zbMATH OpenOpenAlexFDO

Authors Mokhammad Ridwan Yudhanegara, S. W. Indratno, Rr. Kurnia Novita Sari

Publication date 29 December 2020

Published in Journal of the Indonesian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.22342/jims.26.2.871.185-191

zbMATH Keywords

rulescategorical feature

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Clustering techniques for stock location and order-picking in a distribution center
• A clustering algorithm for item assignment in a synchronized zone order picking system
• Clustering retail stores for inventory transshipment
• Clustering model and algorithm for production inventory and distribution problem
• A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
• Using clustering analysis in a capacitated location-routing problem
• Efficient Clustering for Orders
• The \(k\)-means range algorithm for personalized data clustering in e-commerce
• A \(K\)-means clustering algorithm based distance concentration
• Clustering-based order-picking sequence algorithm for an automated warehouse

Cites work

• scientific article; zbMATH DE number 6503503 (Why is no real title available?)
• scientific article; zbMATH DE number 3469876 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• Cluster Analysis
• Methods of multivariate analysis

Cited in

(1)

• Application of \(K\)-means theory based on data

This page was built for publication: Clustering for Item Delivery Using Rule-K-Means

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