Özet:

In this study, a new design problem was identified with regard to the settlement of the main corridors in the warehouses. In this problem, the linear straight middle main corridor, which is often used in warehouses, is defined as cutting-edge, for example, the tunnels on the goods gathering corridor. Thus, the problem was revealed where the tunnels will be placed to make the order collection process more efficient, which is one of the most expensive and most influential transactions in warehouses and the time of delivery of orders. In addition, a new algorithm based on polynomial time dynamic programming has been developed to optimally calculate the length of the order collection route in this new design problem. With this algorithm developed, the results were obtained very shortly even for a large number of orders. The performance of the developed algorithm is compared to the Held-Karp branch-border algorithm used in literature to solve the traveler seller problem. Finally, an example problem was solved and the application of the algorithm was explained.

Anahtar Kelimeler: