A novel methodology for optimal land allocation for agricultural crops using Social Spider Algorithm
 Published
 Accepted
 Received
 Academic Editor
 Danlin Yu
 Subject Areas
 Agricultural Science, Computational Science, Spatial and Geographic Information Science
 Keywords
 Crop planning, Optimal Land Allocation, Multiobjective optimization, Bioinspired Algorithms, Social Spider Algorithm (SSA)
 Copyright
 © 2019 Thilagavathi and Amudha
 Licence
 This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ) and either DOI or URL of the article must be cited.
 Cite this article
 2019. A novel methodology for optimal land allocation for agricultural crops using Social Spider Algorithm. PeerJ 7:e7559 https://doi.org/10.7717/peerj.7559
Abstract
In the current agricultural scenario, availability of suitable land for cultivation is less and profitable allocation of the land for cultivating crops seems to be a cumbersome task. Crop planning optimization is a major research field in agriculture, in which land optimization is a significant challenge, which falls under the category of combinatorial optimization problems. The main objective of the present research is to maximize the net income from agriculture through optimal land allocation. Bioinspired algorithms are quite popular in solving combinatorial optimization problems. Social Spider Algorithm (SSA), a new bioinspired algorithm, is used to solve land optimization problem in this research based on the simulation of cooperative behaviour of social spiders. The agricultural area chosen for case study is the Coimbatore region, located in Tamilnadu state, India and the relevant data for the crops are collected from Tamilnadu Agricultural University Coimbatore, India. The optimal planting area, crop productivity for various land holdings and the water requirements are computed by SSA and the results have shown better directions for agricultural planning to improve the profit with constrained land area and water limitations.
Introduction
Agriculture is the main source of revenue in India. As per the World Bank data, around 60.6% of India’s land area is used for agriculture (https://data.worldbank.org/), but the importance of agriculture is not realized by most of the population. Moreover, very few people have opted for agriculture as their occupation and most of the agricultural lands are converted into residential lands or utilized for industrial purpose (Dussal, 2012). Hence, the agricultural sector faces many challenges to meet the global food requirements. Crop planning optimization is one among the major challenges, which needs to be addressed. The current agricultural system practices monocropping with more fertilizers, hybrid seeds and pesticides. In agriculture, optimization can be performed on irrigation, crop planning, land, soil, labour, transportation, climate, weed, fertilizer and pesticides. Various objectives and constraints can be considered for every type of optimization (Adekanmbi, 2014).
Present research focuses on agricultural land optimization which is the need of the hour in agricultural sector. Land optimization faces challenges such as allocating land among multiple crops based on the season (Kharif (June–October) and Rabi (October–April)), soil type, irrigation water, crop growing duration, climate, land availability and many other factors. Crops can also be categorised as agricultural crops, plantation crops, horticulture crops, forage crops and manure crops. Agricultural crops are considered for optimization in this work (Raghava Rani & Dr Tirupathi Rao, 2012).
Currently, farmers are cultivating crops, applying fertilizer and irrigating the land randomly based on their assumptions. The available land is also not properly utilized for cultivating suitable crops. Most of the Indian farmers are following the traditional methods for crop planning. Farmers face heavy economic loss due to the lack of awareness in utilizing the available land and water resources. To avoid all such issues, flexible and suitable cropping patterns and irrigation methods can be taken up by the farmers, which will have a positive impact towards their economy. This research work is focussed on suggesting the suitable crops for cultivation, based on the on the available land area and water resources. It is also focussed on improving the profit to the farmers by optimally allocating the available land without leaving much of unused land, along with minimum water requirements (Thilagavathi, Amudha & Sivakumar, 2017).
The main objective of this research is to maximize the total profit and minimize the water demand by using Social Spider Algorithm. The problem should meet some constraints such as total cropping area and minimum land allocation for crops (Wankhade & Lunge, 2012).
Methods
Study area
The study area considered for the current research is Coimbatore district, which is located in the western agro climatic zone. It lies between 11°01′06.00″N latitude and 76°58′2900″E longitude [TN18COIMBATORE 31.03.2011]. The district is divided into 9 taluks, 19 blocks and 481 villages. The main rivers flowing through Coimbatore district are Bhavani, Noyyal, Amaravathi, Aliyar, Nirar, Solaar and Uppar Thirumurthi. The total area of Coimbatore district is 7,470 square kilometres, among which 3,319 square kilometres are used as cultivable areas. The major crops are millets, jowar, paddy, cowpea, bengal gram, horse gram, green gram, coconut, groundnut, sugarcane, and cotton and the main soil types are red calcareous soil, red noncalcareous soil, black soil, alluvial and colluvial soil.
Material and Methods
The primary objective of the present research is to maximize the total profit (TP) from agriculture through optimal allocation of the available agricultural land for planting suitable crops. This research identifies the feasible combinations of crops that could be grown in the specified land area and assigns the available land optimally for these crops, thereby improving the production.
Objective 1: Profit maximization
The objective function to maximize the total profit is given in Eq. (1). (1)$\text{Max TP}=\sum _{i=1}^{n}{A}_{i}\left[{I}_{i}Ex{p}_{i}\right]$ where TP is the total profit that could be obtained from optimal allocation of land for crops, n is the total number of crops, i is the crop which varies from 1 to n, A_{i} is the optimal area allocated to ith crop (square metres), I_{i} is the income from ith crop, Exp_{i} stands for expenses incurred for crop i.
I_{i} is calculated by using the price and production of the selected crop i, price_{i} and productivity_{i}, as given in Eq. (2). The production value of the crop, pro_{i} is calculated as given in Eq. (3), where the productivity values of the crops, productivity_{i} are collected from the website [www.coimbatore.nic.in/pdf/SHB003.pdf ]. (2)$I}_{i}={\text{Price}}_{i}\phantom{\rule{1em}{0ex}}\times \phantom{\rule{1em}{0ex}}{\text{Productivity}}_{i$ Exp_{i} includes expense on seeds, expense on manure, expense on fertilize, expense on irrigation and expense on labour as given in Eq. (3). (3)$Ex{p}_{i}=C{S}_{i}+C{M}_{i}+C{F}_{i}+C{I}_{i}+CH{L}_{i}$ where CS_{i} is the expense on seeds for ith crop, CM_{i} is the expense on manure for ith crop, CF_{i} is the expense on fertilizer for ith crop, CI_{i} is the expense on irrigation water for ith crop and CHL_{i} is the expense on labour and machinery for ith crop.
To achieve maximum profit, improved production from the crops and optimal allocation of land for the crops are highly essential. Crop production is obtained from Eq. (4). (4)${\text{Max Production}}_{i}={A}_{i}\phantom{\rule{1em}{0ex}}\times \phantom{\rule{1em}{0ex}}{\text{productivity}}_{i}.$
Objective 2: Water requirement minimization
The secondary objective of this research is to minimize the usage of water to be used for irrigating the allocated crops due to the insufficient availability of water in the study area. (5)$\text{Minimize TWR}=\sum _{i=1}^{n}\left(CW{R}_{i}\times {A}_{i}\right)$ where TWR is the total water requirement (cubic metres) and CWR_{i} is the crop water requirements for crop i. The constraint used is the total cropping area, which should be in the range of 2 to 4 hectares as given in Eq. (6).
Constraint 1: Total cropping area
(6)$max.area\ge \left(TCA=\sum _{i=1}^{n}{A}_{i}\right)\ge min.area$ where TCA is the total cropping area, max. area is the maximum available cropping area and min. area is minimum available cropping area. Two categories of land holdings taken in this research work are 20,000 m^{2}–40,000 m^{2}, which is called smallmedium land holding category and 40,000 m^{2}–1,00,000 m^{2}, which is called medium land holding category.
Constraint 2: Cropping area for each crop
Cropping area for each crop is constrained as given in Eqs. (7) and (8). Eq. (7) is used for smallmedium land holding category and Eq. (8) is used for medium land holding category. (7)$A}_{i}\ge {\text{2,000 m}}^{2$ (8)${A}_{i}\ge \text{4,000}\phantom{\rule{1em}{0ex}}{\mathrm{m}}^{2}.$
Social Spider Algorithm (SSA) for crop planning optimization
SSA is a population based algorithm proposed by Cuevas et al. (2013) to solve global optimization problems. It is based on the reproduction and cooperative behaviour of social spiders. SSA possesses certain unique characteristics, which makes it quite different and competent than many other existing bioinspired algorithms. The algorithm employs two types of spiders as search agents, male spiders and female spiders. Each individual performs different types of operations based on their type that simulate the social behavior of the spiders within the colony. Three types of vibration operators used in SSA allow improved particle distribution in the search space, thereby enhancing the algorithm’s ability to find the global optima. Based on the vibration values, the male cooperative behavior and female cooperative behavior are determined in SSA, which in turn applies different mechanisms for exploration and exploitation during the evolution process. Another unique quality of this algorithm is the choice of new spiders for the next generation. While most of the algorithms use only the fitness of the offspring to calculate their chance to be moved to the next generation, SSA calculates and applies an influence probability in addition to the fitness, in order to assess the suitability of the individual to become a member of the new generation.
The major components of social spider colony are social members (spiders) and communal web (spider web). The communal web is considered as search Space (S). The position assigned to each spider on the web is based on its weight and fitness value (Cuevas et al., 2013). The total colony members are divided into two categories: 70% of female spiders and 30% of male spiders. The male spiders are subdivided into two classes; dominant and nondominant males based on the fitness of the spiders. The mating operation allows the information exchange among colony members, performed by dominant male and females. The spiders generate vibrations for mating operation based on the other spider’s weight and distance between each other. The dominant male spiders mate with one or more female spiders to produce offspring (new spider). The weight of the spider is considered as the fitness of the solution. The population contains the female (f_{i}) and male (m_{i}) spiders. The number of female spiders is randomly selected within the range of 65%–90% and the number of male spiders is calculated from female spiders based on Eqs. (9) and (10). (9)${N}_{fs}=\text{floor}\left[\left(0.9\text{rand}\left(0,1\right)\ast 0.25\right)\ast P\right]$ (10)$N}_{ms}=P{N}_{fs$ where N_{fs} means number of female spiders, N_{ms} represents the number of male spiders, P stands for entire population and floor represents the real number to an integer number. The weight (w_{i}) of each spider is calculated based on (11). The fitness value obtained by the spider at position s_{i} and the values b_{s} and w_{s} are calculated based on Eqs. (12) and (13) for maximization problems. (11)${W}_{i}=\frac{J\left({s}_{i}\right){w}_{s}}{{b}_{s}{w}_{s}}.$
The b_{s} is maximum fitness value and w_{s} is minimum fitness value obtained from the fitness values of all the spiders. (12)${b}_{s}=\underset{k\in 1,2,\dots ,N}{max}J\left({s}_{k}\right)$ (13)${w}_{s}=\underset{k\in 1,2,\dots ,N}{min}J\left({s}_{k}\right).$
Similarly, vibration of each spider is calculated based on the weight (w_{i}) and distance (d_{i,j}) between the individual i and member j as given in Eq. (14). (14)$V{b}_{i,j}={w}_{j}.{e}^{{d}_{i,j}^{2}}$ where d_{i,j} is the Euclidian distance between the spiders i and j, which is calculated by using Eq. (15). (15)${d}_{i,j}=\sqrt{{\left({x}_{i}{x}_{j}\right)}^{2}+{\left({y}_{i}{y}_{j}\right)}^{2}}.$
Vibrations are categorized into three types based on the relationship between the pair of individuals. These three types of vibrations are calculated to perform the cooperative behaviours of male and female spiders.

Vibrations Vc_{i}—the information transmitted from individual i to member c(s_{c}), which is the nearest member to individual i based on Eq. (16). (16)$V{c}_{i}={w}_{c}.{e}^{{d}_{i,c}^{2}}$

Vibrations Vb_{i}—the information is transmitted between the individual i and the best member b(s_{b}) by using Eq. (17). (17)$V{b}_{i}={w}_{b}.{e}^{{d}_{i,b}^{2}}$

Vibrations Vf_{i}—the information is transmitted between the individual i and the nearest female s(s_{f}) as given in Eq. (18). (18)$V{f}_{i}={w}_{f}.{e}^{{d}_{i,f}^{2}}$
The vibrations Vb_{i} and Vc_{i} are used to calculate the female cooperative behaviours while Vf_{i} is used to calculate the male cooperative behaviours. Strong vibrations are produced by the nearest spiders or big spiders. (19)${f}_{i}^{k+1}=\left\{\begin{array}{c}\left\{{f}_{i}^{k}+\alpha .v{c}_{i}.\left({s}_{c}{f}_{i}^{k}\right)+\beta .\right.v{b}_{i}.\left({s}_{b}{f}_{i}^{k}\right)+\delta .\left(rand\frac{1}{2}\right)\phantom{\rule{10.00002pt}{0ex}}\hfill \\ \text{with probability PF}\phantom{\rule{10.00002pt}{0ex}}\hfill \\ \left\{{f}_{i}^{k}\alpha .v{c}_{i}.\left({s}_{c}{f}_{i}^{k}\right)\beta .\right.v{b}_{i}.\left({s}_{b}{f}_{i}^{k}\right)+\delta .\left(rand\frac{1}{2}\right)\phantom{\rule{10.00002pt}{0ex}}\hfill \\ \text{with probability}\phantom{\rule{1em}{0ex}}1PF\phantom{\rule{10.00002pt}{0ex}}\hfill \end{array}\right.$ (20)${m}_{i}^{k+1}=\left\{\begin{array}{c}{m}_{i}^{k}+\alpha .v{f}_{i}.\left({s}_{f}{m}_{i}^{k}\right)+\delta .\left(rand\frac{1}{2}\right)if\phantom{\rule{1em}{0ex}}{w}_{{N}_{f}+i}>{w}_{{N}_{f}+m}\phantom{\rule{10.00002pt}{0ex}}\hfill \\ {m}_{i}^{k}+\alpha .\left(\frac{\sum _{h=1}^{{N}_{m}}{m}_{h}^{k}.{w}_{{N}_{f}+h}}{\sum _{h=1}^{{N}_{m}}{w}_{{N}_{f}+h}}{m}_{i}^{k}\right)if\phantom{\rule{1em}{0ex}}{w}_{{N}_{f}+i}\le {w}_{{N}_{f}+m}\phantom{\rule{10.00002pt}{0ex}}\hfill \end{array}\right.$ where, α, β, δ represents random numbers between [0, 1], k stands for iteration number and s_{c} & s_{b} means the nearest member to i that holds the highest weight and the best individual of the entire population.
Equation (19) is used to calculate the female cooperative behaviours while Eq. (20) is utilized to calculate the male cooperative behaviours based on the threshold value. The spider movement, i.e., attraction or repulsion, is based on the random phenomena, which is represented as r_{m}, and it is generated within the range of [0, 1]. The r_{m} value is compared with the threshold value, and if the value is less than r_{m}, then the attraction movement will be produced, else the repulsion movement will be produced. (21)$r=\frac{\sum _{j=1}^{n}\left({P}_{j}^{high}{P}_{j}^{low}\right)}{2.n}$ where r is a range to select the female spiders for mating operation, which is calculated by using Eq. (21). The dominant male spiders are arranged in set m_{g} andthe selected female spiders are arranged in set E^{g}. The sets m_{g} and E^{g} (m_{g}U E^{g}) are combined to get the reproduction. If the set E^{g} is empty, then there will not be any mating operation. (22)$P{s}_{i}=\frac{{w}_{i}}{\sum _{j\in {T}^{k}}{w}_{j}}.$
The influence probability Psi is calculated by using the weight of each spider as given in Eq. (22). After calculating the probability, the roulette wheel method is applied to select the s_{new}. The weight of the new spider s_{new} is calculated and compared with the weight of population member. If the weight of s_{new} isbetter than the weight of any member in the population, then the member will be replaced by s_{new}. Figure 1 depicts the search space of spiders denoted by S.
The present research applies SSA for crop planning optimization. The number of crops is considered as the population size i.e., the number of spiders. Ten agricultural crops are selected for implementation in this work. Total population is split into males and females by using Eqs. (9) and (10). The value of ${p}_{j}^{\mathrm{low}}$ and ${p}_{j}^{\mathrm{high}}$ are equated for the minimum area and maximum area of cropping land considered. The social spiders are responsible for allocating optimal land for each crop and based on the land allocation, the total profit from agriculture and TWR (objective functions) are calculated. Data for the cost of seed, cost of irrigation, cost of manure, cost of fertilizer, cost of labour and machinery are obtained from the Centre for Agriculture and Rural Development Studies (CARDS), Tamilnadu Agricultural University, Coimbatore.
The weight and fitness of each spider are calculated from the objective function given in Eq. (11). The best and worst values of objective function are used for the weight calculation of each spider. Distance between each spider is calculated by utilizing Eq. (15). The values taken for the distance calculation are the weight and the total land allocation done by each spider. Similarly, vibration is calculated based on the distance between spiders. Three types of spiders chosen for the calculation of vibration are the spider with minimum distance (Vbc_{i}), spider with highest weight (Vbb_{i}) and nearest female spider (Vbf_{i}). Based on the vibrations, female cooperative operators and male cooperative operators are applied. The median male spider is found based on the weight to calculate the dominant and nondominant male spiders. The spiders, whose weights are above the median male spider, are called the dominant males and those below the median are nondominant males.
Cooperative operations are used to select the best female spiders and dominant male spiders to mating operation. The range value of dominant male spider is calculated to choose female spiders among female cooperative spiders to mating operation. Mating operation forms a new spider (brood) denoted as s_{new}. Each member of the new spider population suggests an optimal land allocation for multiple crops. Based on the suggestions, the objective function values are derived and the corresponding fitness and weight of the population members are calculated. The weight of the new members is compared with the weight of all the members in the population. If the new member is better than the worst member in the population, then the worst member will be replaced by the new member. This process will be continued till the optimum solution is obtained which suggests improvement in total profit and reduction in total water requirement based on the optimal land allocation done by the social spiders. Figure 2 shows the flow chart of SSA for crop planning optimization.
Results
The implementation of this research work is carried out using C# .Net in Microsoft Visual Studio 2010 and MATLAB R2014b. The results obtained for profit maximization and total water requirement minimization are tabulated in this section. Table 1 list out the crop categories used in this research work. The crops selected are regularly cultivated in Coimbatore region.
S. No  All crops  Cash crops 

1  Paddy  Sugarcane 
2  Cholam  Cotton 
3  Maize  Groundnut 
4  Sugarcane  Gingelly 
5  Cotton  Sunflower 
6  Groundnut  – 
7  Gingelly  – 
8  Red gram  – 
9  Black gram  – 
10  Green gram  – 
Table 2 shows the various types of agricultural land holding based on the area of cultivation. In this research, small land holding of 10,000 m^{2}–20,000 m^{2}, smallmedium land holding of 20,000 m^{2}–40,000 m^{2}, medium land holding of 40,000 m^{2}–1,00,000 m^{2} and large land holding of greater than 1,00,000 m^{2} areas are considered.
Land category  Area of cultivation (in hectare)  Area of cultivation (in m^{2}) 

Marginal  <1  <10,000 
Small  1–2  10,000–20,000 
Smallmedium  2–4  20,000–40,000 
Medium  4–10  40,000–1,00,000 
Large  >10  >1,00,000 
This research is focussed on allocation of optimal land for the two categories of crops, as given in Table 1. Also, the possibilities of attaining maximum profit with minimum water usage are worked out by framing eight test cases, as given in Table 3.
Test case  Land category  Crop category 

Test case 1  Small  All Crops 
Test case 2  Cash Crops  
Test case 3  Smallmedium  All Crops 
Test case 4  Cash Crops  
Test case 5  Medium  All Crops 
Test case 6  Cash Crops  
Test case 7  Large  All Crops 
Test case 8  Cash Crops 
Table 4 shows the optimal land allocation done by SSA in 100 runs for the test cases 1 to 8 with the corresponding profit and water requirements.
Test cases  Objective function  Land in m^{2}  Profit in Rs.  TWR in mm^{3} 

Test case 1  Profit Maximization  19,850  2,033,016  348,889 
TWR Minimization  19,900  1,867,616  128,472  
Test case 2  Profit Maximization  19,740  2,963,316  150,200 
TWR Minimization  19,640  2,708,188  104,264  
Test case 3  Profit Maximization  39,810  3,273,473  559,598 
TWR Minimization  39,950  2,980,334  303,497  
Test case 4  Profit Maximization  39,870  5,222,689  335,244 
TWR Minimization  39,410  5,176,876  329,079  
Test case 5  Profit Maximization  99,350  8,775,563  140,110 
TWR Minimization  99,650  8,358,018  126,557  
Test case 6  Profit Maximization  98,110  14,429,256  792,379 
TWR Minimization  99,200  12,148,478  408,812  
Test case 7  Profit Maximization  199,930  17,161,073  2,861,606 
TWR Minimization  194,580  16,858,293  2,564,068  
Test case 8  Profit Maximization  199,200  24,272,651  1,353,925 
TWR Minimization  198,890  23,814,477  1,270,661 
Table 5 shows the maximum, minimum, mean, standard deviation and 95% CI (Confidence Interval) of the results obtained by 100 runs of SSA for land allocation, profit and crop water requirement for the eight test cases.
Land allocation in m^{2}  Profit in Rs.  TWR in mm^{3}  

Test case 1  Maximum  19,990  2,033,016  348,889 
Minimum  19,300  1,693,298  128,472  
Mean  19,738  1,861,730  266,494  
Std. Dev  253  99,453  65,124  
95% CI  49  19,492  12,764  
Test case 2  Maximum  19,910  2,963,316  104,264 
Minimum  19,230  2,708,188  142,349  
Mean  19,618  2,832,074  160,413  
Std. Dev  223  95,162  20,569  
95% CI  43  18,651  4,031  
Test case 3  Maximum  39,950  3,273,473  589,958 
Minimum  37,850  2,980,334  303,497  
Mean  39,074  3,115,553  510,561  
Std. Dev  836  98,421  81,229  
95% CI  163  19,290  15,920  
Test case 4  Maximum  39,990  5,222,689  337,071 
Minimum  39220  5,031,658  329,079  
Mean  39682  5,157,520  332,686  
Std. Dev  304  58,244  3,192  
95% CI  59  11,415  625  
Test case 5  Maximum  99,960  8,775,563  1,401,108 
Minimum  98340  8,353,325  1,265,573  
Mean  99373  8,554,588  1,340,123  
Std. Dev  566  154,113  47,349  
95% CI  110  30,205  9,280  
Test case 6  Maximum  99,910  14,429,256  884,947 
Minimum  97,760  12,148,478  408,812  
Mean  99,088  13,595,435  720,347  
Std. Dev  734  768,441  138,683  
95% CI  143  150,611  27,181  
Test case 7  Maximum  199,930  17,161,073  2,564,068 
Minimum  194580  16,204,427  2,891,482  
Mean  197435  16,822,334  2,764,595  
Std. Dev  1863  270,128  107,563  
95% CI  365  52,944  21,081  
Test case 8  Maximum  199,980  24,272,651  1,455,944 
Minimum  197,840  20,619,028  1,270,661  
Mean  198,909  2,2610,001  1,367,149  
Std. Dev  773  1,180,062  59,599  
95% CI  151  231,287  11,681 
Figures 3 to 10 show the performance of SSA in profit maximization and water requirement minimization with respect to various test cases framed.
Discussion
Profit maximization and water requirement minimization are the two objectives considered in this research work, which are found to contradict each other in most of the results obtained through crop land allocation. Due to the inadequacy of underground water, soil moisture, and less rain fall, there is always a need to supply more water to the agricultural fields to ensure the healthy growth of the crops. This leads to increase in water requirement which poses a heavy challenge to the farmers. Hence this work has paid major attention in water requirement minimization by carefully choosing the crops for cultivation in various land categories in such a way that the farmers are benefited with reasonable profit from their crop lands and also be able to manage with the available water resources. Since the problem considered in this research is multiobjective in nature, arriving at Pareto optimal solutions is a challenging task. When the profit obtained from crop land allocation is maximized, water requirement is also found to increase.
Table 4 details upon the optimal land allocation, optimal profit and optimal total water requirement suggested by SSA, that leads to profit maximization as well as water requirement minimization with respect to each of the eight test cases applied in this work. It could be well observed from these results that maximum profit always require maximum water for cultivation. Similarly, it could also be observed that if the objective of total water requirement minimization is achieved, profit is also minimized. There is always a tradeoff in such multiobjective optimization problems. Hence, the SSA algorithm is executed for 100 runs in order to frame a paretofront and to identify the Pareto optimal solutions, which will satisfy both the objectives to the maximum possible extent without affecting each other (Antonio et al., 2011).
These results also highlight the competence of SSA algorithm in producing better profit on an average for all the test cases. Results of test case 1 show that there is 9% of reduction in profit if the water requirement is minimized by 64%. And, the results of test case 2 show that there is 9% of reduction in profit if the water requirement is minimized by 31%. Test cases 1 and 2 deal with small land holdings and for this scenario, optimal land allocation in test case 1 can be recommended, as it achieves good profit with minimal use of water. Results of test case 3 show that there is 9% of reduction in profit if the water requirement is minimized by 45%, and in test case 4, there is 1% of reduction in profit if the water requirement is minimized by 2%. Test cases 3 and 4 deal with small to medium land holdings and for this scenario, optimal land allocation in test case 3 can be recommended, as it achieves better profit with minimal use of water. Results of test case 5 show that there is 5% of reduction in profit if the water requirement is minimized by 10% and in test case 6, there is 15% of reduction in profit if the water requirement is minimized by 50%. Test cases 5 and 6 deals with medium land holdings and for this scenario, optimal land allocation in test case 6 can be recommended, as it achieves good profit with minimal use of water. Results of test case 7 show that there is 2% reduction in profit if the water requirement is minimized by 11%. And, the results of test case 8 show that there is 2% reduction in profit if the water requirement is minimized by 7%. Test cases 7 and 8 deals with large land holdings and in this scenario, optimal land allocation in test case 7 can be suggested where profit is increased without much affecting the water requirement.
The performance of SSA over 100 runs are analysed for each of the test cases and the maximum, minimum, mean, standard deviation and 95% CI values for land allocation, profit and total water requirement are presented in Table 5. The average standard deviation in optimal profit ranges from minimum 1% to a maximum of 5% and the average standard deviation of optimal water requirement vary from 1% to 20% with respect to all the test cases considered. The 95% CI values state that the results obtained by SSA algorithm can be 95% ascertained. Lesser CI values also indicate the reliability of SSA and the choice of algorithm parameter values. The solutions obtained by SSA are found to be in a consistent search space, which is quite visible by the minimum difference in the standard deviation. The crop planning optimization problem has constantly changing dimensions with respect to the search space, which makes the algorithm to perform challenging exploration and exploitation. It is found that the algorithm has consistently produced optimal results despite the difficulties faced in the identification of feasible solutions. The Pareto optimal solutions obtained by SSA algorithm are visualized from Figs. 3 to 10. The results proved the capability of SSA in obtaining best optimal solutions for crop land allocation in a multiobjective environment.
As stated earlier, the farmland is classified as small, medium, small to medium and large as per the available land area for cultivation. The choice of crops to be grown in the farmland is also suggested by SSA in this work. For small land holdings, all crops category is found to be effective in maximizing the utilization of the available agricultural land, thereby reducing the wastage of land. On the other hand, all crops category grown in small to medium land holdings are effective in maximizing the profit with minimum utilization of water. Cash crops grown in medium land holdings are found to be effective in maximizing the profit with minimum water usage and optimal use of the available agricultural land. Both cash crops and all crops categories grown in large land holdings are found to be equally effective in maximizing the profit with optimum consumption of water and land. It could also be observed that SSA could produce best results in case of small land holdings to medium land holdings, whereas large land holdings pose a challenge in terms of both profit maximization and total water requirement minimization.
Conclusion and scope for further research
In the present research, an attempt is made to find the optimal land allocation for planting multiple crops in the available land area with water constraints. The optimal land allocation is performed with two objectives, profit maximization and water minimization. Social Spider Algorithm, a new and robust bioinspired algorithm is applied for optimization and the crops cultivated in the Coimbatore region of Tamilnadu state in India are taken for the case study. Eight test cases are framed based on land availability and crop category. As the land allocation problem is considered as multiobjective problem, the results are analysed for Pareto optimal solutions which dominate both in terms of optimal profit and optimal water requirement for cropping. Rule curves are generated to depict the profit and water requirement with respect to the optimal land allocation for all the test cases analysed in this work. Promising results are obtained which proves the ability of SSA in the optimization of crop planning. Almost 98% of the available land is allocated by the algorithm for cropping, which also shows the effectiveness of the algorithm in minimizing wastage of crop land. Results of this research can be used for cropping recommendations to the farmers with varying land holdings and inadequate water availability. Further optimization techniques in crop planning such as optimization of soil, labour, transportation, climate, weed, fertilizer and pesticides are planned to be considered for future research.