The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres
Abstract
Among distribution centre operations, order picking has been reported to be the most labour-intensive activity. Sophisticated storage assignment policies adopted to reduce the travel distance of order picking have been explored in the literature. Unfortunately, previous research has been devoted to locating entire products from scratch. Instead, this study intends to propose an adaptive approach, a Data Mining-based Storage Assignment approach (DMSA), to find the optimal storage assignment for newly delivered products that need to be put away when there is vacant shelf space in a distribution centre. In the DMSA, a new association index (AIX) is developed to evaluate the fitness between the put away products and the unassigned storage locations by applying association rule mining. With AIX, the storage location assignment problem (SLAP) can be formulated and solved as a binary integer programming. To evaluate the performance of DMSA, a real-world order database of a distribution centre is obtained and used to compare the results from DMSA with a random assignment approach. It turns out that DMSA outperforms random assignment as the number of put away products and the proportion of put away products with high turnover rates increase.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · Proceedings of the 1993 ACM SIGMOD international conference on Management of data · doi:10.1145/170035.170072 · Cited by 14,907
Mining association rules between sets of items in large databases
Agrawal, R., Imieliński, T., & Swami, A. (1993) · ACM SIGMOD Record · doi:10.1145/170036.170072 · Cited by 4,551
Cited by
Social media competitive analysis and text mining: A case study in the pizza industry
He, W., Zha, S., & Li, L. (2013) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2013.01.001 · Cited by 898
Big data analytics in supply chain management: A state-of-the-art literature review
Nguyen, T., ZHOU, L., Spiegler, V., Ieromonachou, P., & Lin, Y. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2017.07.004 · Cited by 565
Integration of Distributed Enterprise Applications: A Survey
He, W., & Xu, L. D. (2014) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2189221 · Cited by 294
Business Intelligence for Enterprise Systems: A Survey
Duan, L., & Xu, L. D. (2012) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2188804 · Cited by 254
Distributed data mining: a survey
Zeng, L., Li, L., Duan, L., Lu, K., Shi, Z., Wang, M., Wu, W., & Luo, P. (2012) · Information Technology and Management · doi:10.1007/s10799-012-0124-y · Cited by 85
Metadata
- Authors
- Chiang, D. M.-H., Lin, C.-P., & Chen, M.-C.
- Venue
- Enterprise Information Systems
- Publisher
- Informa UK Limited
- Published
- 2011-01-20
- Volume
- 5
- Issue
- 2
- Pages
- 219-234
- ISSN
- 1751-7575 (ISSN-L)
- 1751-7583
- OpenAlex
- W2073345995
- Cited by
- 185
- References
- 2
- FWCI
- 53.25
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres. https://app.cochat.ai/papers/10.1080/17517575.2010.537784
- The paper
- Chiang, D. M.-H., Lin, C.-P., & Chen, M.-C. (2011). The adaptive approach for storage assignment by mining data of warehouse management system for distribution centres. Enterprise Information Systems. https://doi.org/10.1080/17517575.2010.537784
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.