Search

Turkey's Aegean region is a very suitable region for fruit production in terms of climatic conditions and soil characteristics. Fruit and vegetable production in the Aegean region has an important position in terms of Turkey's agricultural economy. The fruit growing sector has a very important place in Turkey's agricultural economy. The aim of the study is to prevent unbalanced fruit production in the Aegean region and to ensure more efficient fruit growing. In the study, it was aimed to assign a balanced production of fruits grown under different conditions in provinces with different characteristics in the Aegean region. For the assignment problem, the conditions of the cities in the Aegean region and the growing conditions of the fruits are considered together. These conditions are altitude, temperature, soil quality, climate, humidity, labor and irrigation. Conditions for fruit production were analyzed with the AHP method and factor weights were calculated. ARAS and Fuzzy Logic methods were used to solve the assignment problem of fruits. These methods enable to reach the result by digitizing the non-computable features of a particular situation. Aydın, Manisa, Denizli and Afyonkarahisar provinces have been proposed, respectively, for the production of figs, grapes, thyme and cherries, which have high industrial value and export income. The study has shown that unbalanced production can be prevented by assigning fruits and vegetables in this way in every region of the country. As a result, the country's agricultural lands will be used effectively and the contribution of agriculture to the national economy will increase. [ABSTRACT FROM AUTHOR]

The Hungarian algorithm is one of the most well-known methods in computer science literature. By this method, in each step the cost matrix is systematically reduced to a new matrix in order to obtain an optimal solution for the assignment problem. The subroutine of the algorithm includes determining the minimum number of lines needed to cover all zeros in the reduced cost matrix and modifying the matrix according to the number of lines. In this paper, firstly the methods in literature including the covering all zeros with a minimum number of lines are examined, then a new method is proposed and computational experiments are discussed. [ABSTRACT FROM AUTHOR]

The Hungarian algorithm is one of the most well-known methods in computer science literature. By this method, in each step the cost matrix is systematically reduced to a new matrix in order to obtain an optimal solution for the assignment problem. The subroutine of the algorithm includes determining the minimum number of lines needed to cover all zeros in the reduced cost matrix and modifying the matrix according to the number of lines. In this paper, firstly the methods in literature including the covering all zeros with a minimum number of lines are examined, then a new method is proposed and computational experiments are discussed. [ABSTRACT FROM AUTHOR]