Optimal Location Assignment for Data-Driven Warehouse Towards Digital Supply Chain Twin


ÖZÇEVİK M., ÖZÇEVİK Y., Bozkaya E., Bilen T.

2023 IEEE 28th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, CAMAD 2023, Edinburgh, İngiltere, 6 - 08 Kasım 2023, ss.117-122, (Tam Metin Bildiri) identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/camad59638.2023.10478382
  • Basıldığı Şehir: Edinburgh
  • Basıldığı Ülke: İngiltere
  • Sayfa Sayıları: ss.117-122
  • Anahtar Kelimeler: Block Location Problem, Digital Twin, Industry 4.0, Genetic Algorithms, E-commerce, Supply Chain
  • Manisa Celal Bayar Üniversitesi Adresli: Evet

Özet

Warehouses, as one of the critical components of supply chain management in Industry 4.0, play an important role in e-commerce operational efficiency. A crucial prerequisite for managing warehouses is to decide the locations of products (blocks) that can maximize overall space utilization, called a Block Location Problem (BLP). BLP basically determines the product locations to achieve maximum space utilization. One of the most innovative approaches to solving BLP is the use of drones as a block transportation strategy. Existing works have been mainly focused on 2D grid models while 3D flight movement is ignored. Thus, in this paper, we develop a novel data-driven warehouse model for digital supply chain twins. For this purpose, a warehouse digital twin (WDT) architecture is defined by creating a virtual replica of a warehouse that contains the features and interactions of its real-world counterpart. Then, we formalize the BLP in a 3D grid model to decide the location of blocks in a warehouse and to provide efficient space utilization by minimizing the energy consumption of drone cargo equipment. Finally, we propose a genetic algorithm-based solution to solve the storage location assignment. Performance evaluation results demonstrate that our proposed algorithm achieves more block utilization and less energy consumption when compared to the greedy solution.