Ordering requests in automated storage and retrieval system by variable neighborhood search method and creating the digital twin infrastructure

Today, thanks to rapidly developing technologies, there are technologies that can minimize costs in every field. One of them is automatic warehouses. It is possible to make the system more efficient by sorting the storage and retrieval requests collected in these warehouses. Within the scope of this study, variable neighborhood search, which is a meta-heuristic method, was used to rank the requests, and an experimental design was made for the neighborhood structure and stopping criterion, which were the main questions of this method, and how each variable affected the results was examined. A simulation program suitable for working in different warehouse structures was designed and the results were examined by running the sorting algorithm at regular intervals. Thus, it has been tried to create a digital twin infrastructure that reflects exactly the same system for future periods and can help the decision maker in line with the results obtained here.