Simulated Annealing For Storage Location Assignment Problems

Authors

  • Arzu Eren Şenaras Bursa Uludağ Üniversitesi, Bursa, Türkiye
  • Onur Mesut Şenaras Bursa Uludağ Üniversitesi, Bursa, Türkiye
  • Şahin İnanç Bursa Uludağ Üniversitesi, Bursa, Türkiye

DOI:

https://doi.org/10.20491/isarder.2023.1677

Keywords:

Storage Location Assignment Problem, Cost Calculation, Simulation Annealing

Abstract

Purpose – The annealing simulation was implemented for solving storage location assignment problems in MatlabR2017a. Design/methodology/approach – The annealing simulation algorithm is based on the analogy between the simulation of annealing solids and the problem of solving large combinatorial optimization problems. For this reason, the algorithm is known as "Annealing simulation". Findings – In this study, Annealing simulation algorithm is implemented in Matlab R2017a program to solve the warehouse assignment problem. According to the results obtained, 3303.62 meters/hour transport was carried out with the Annealing Simulation Method. Discussion – The results show that the proposed Annealing Simulation (TB) algorithm is quite effective in solving the storage location assignment problem. Thanks to the developed application, different kinds of problems such as assigning a large number of semi-finished products to warehouse addresses in manufacturing systems will be solved quickly.

Published

2023-10-03

How to Cite

Eren Şenaras, A., Şenaras, O. M., & İnanç, Şahin. (2023). Simulated Annealing For Storage Location Assignment Problems. Journal of Business Research - Turk, 15(3), 1753–1760. https://doi.org/10.20491/isarder.2023.1677

Issue

Section

Articles