Clustering for Item Delivery Using Rule-K-Means

DOI10.22342/JIMS.26.2.871.185-191zbMATH Open1456.90140OpenAlexW3048295691MaRDI QIDQ5142017FDOQ5142017

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

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

zbMATH Keywords

rulescategorical feature

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods of multivariate analysis
• Cluster Analysis
• Title not available (Why is that?)

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)