EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

An Improved K-means Clustering Algorithm Based on EIQ Analysis for Order Batching of Shuttle-Based Storage/Retrieval Systems

Chuanjun CHEN, Hongqiang FAN, Junjie LIU, Shun LI

Promet - Traffic&Transportation · 28.04.2026 · 38 (4) · 940-956

DOI: 10.7307/ptt.v38i4.1222 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Promet - Traffic&Transportation, online erschienen am 28.04.2026. Verfasst von Chuanjun CHEN und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Shuttle-based storage/retrieval systems (SBS/RS) require efficient order batching to optimise split-case picking. Original K-means clustering, which groups orders based on overlapping SKUs to minimise bin presentations, struggles with high-dimensional, sparse pharmaceutical data due to computational inefficiency, unsuitable distance metrics and unstable initialisation. We propose an enhanced K-means algorithm based on EIQ analysis. High-frequency SKUs are selected using IK frequency filtering, while Pearson correlation is applied to remove redundant features and reduce dimensionality. Cluster centre initialisation is improved using a roulette-based strategy, and cosine distance replaces Euclidean distance to better capture SKU similarity. Case studies using real data from Company A show that the proposed method outperforms both first-come-first-serve (FCFS) and standard K-means in reducing bin presentations and enhancing processing stability. The algorithm remains robust regardless of SKU popularity shifts. Sensitivity analysis confirms strong performance within appropriate thresholds for feature selection (n: 20–25) and correlation filtering (Pearson correlation: 0.8–0.9). Furthermore, as the number of item-lines per order increases, the improved algorithm yields greater efficiency gains. This algorithm can also be well applied to other industries.

Zitieren

APA

CHEN, C., FAN, H., LIU, J., & LI, S. (2026). An Improved K-means Clustering Algorithm Based on EIQ Analysis for Order Batching of Shuttle-Based Storage/Retrieval Systems. Promet - Traffic&Transportation, 38(4), 940-956. https://doi.org/10.7307/ptt.v38i4.1222

Vancouver

CHEN C, FAN H, LIU J, LI S. An Improved K-means Clustering Algorithm Based on EIQ Analysis for Order Batching of Shuttle-Based Storage/Retrieval Systems. Promet - Traffic&Transportation. 2026;38(4):940-956. doi:10.7307/ptt.v38i4.1222

BibTeX
@article{CHEN2026,
  author = {CHEN, Chuanjun and FAN, Hongqiang and LIU, Junjie and LI, Shun},
  title = {An Improved K-means Clustering Algorithm Based on EIQ Analysis for Order Batching of Shuttle-Based Storage/Retrieval Systems},
  journal = {Promet - Traffic&Transportation},
  year = {2026},
  volume = {38},
  number = {4},
  pages = {940--956},
  doi = {10.7307/ptt.v38i4.1222}
}
Kostenlos starten →