A robust heuristic method on the clustering-assignment problem model
| Autor: | Hsu-Tung Lee, Shih-Wei Tan, Yi-Fei Chuang |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
021103 operations research General Computer Science Shelf space Heuristic (computer science) Association (object-oriented programming) Rank (computer programming) 0211 other engineering and technologies General Engineering 02 engineering and technology 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Cluster analysis Assignment problem Mathematics |
| Zdroj: | Computers & Industrial Engineering. 98:63-67 |
| ISSN: | 0360-8352 |
| DOI: | 10.1016/j.cie.2016.05.030 |
| Popis: | Multi-item and pick-by-order.Clustering-then-assigning.Between item association. This research presents an effective way to generate the location rank for shelf space assignment. Instead of the time consuming mathematical programming techniques adopted in the CAPM by Chuang, Lee, and Lai (2012). This research provides satisfactory results with at maximum of 6.1% difference through a far more effective way. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect