Öznur İşçi Güneri, Burcu Durmuş, Dursun Aydın
Department of Statistics, Muğla Sıtkı Koçman University, Kötekli Campus, 48000, Muğla, Turkey.
Abstract: The aim of the current study is to emphasize the importance of an heuristic solution method for the classical assignment problem (AP). In the literature, many different algorithms including both classical and heuristic algorithms have been developed to solve AP. In this study, we introduce newly R program codes for the classical and heuristic algorithms. Note that Brute Force algorithm, Hungarian algorithm, and Linear Programming (LP) algorithm are konown as classical algorithms, while the Greedy is considered as the heuristic algorithm. For this purpose, we made an application based on 4×4 dimensional sample. In addition, four different methods are obtained for different dimensional problems. The outcomes from the study show that both classical methods and the Greedy method provides the optimal or near optimal results.
Keywords: Assignment Problem, Linear Programming (LP), Brute Force Method, Hungarian Algorithm, Greedy Method.
Pages: 129 – 145 | Full PDF Paper