Optimization algorithms are often employed in spatial analysis and modeling to provide adaptive mechanisms at both individual and collective levels to enable decision-makers for the search of optimal solutions with respect to single/multiple objectives and constraints imposed by spatial configurations. This research aims to solve large-scale agricultural land use optimization problems by exploiting massive parallel computing resources provided by supercomputers such as those in XSEDE. The optimization of agricultural land use patterns finds an optimal assignment of crops (e.g., food and biofuel crops) on land parcels of a specified study area that maximizes the total yield and satisfies various competing constraints. These constraints often consider spatial factors such as contiguity and ownership, climate and land management factors (e.g., soil, precipitation, light, temperature, and ozone) and their effects on the productivity, suitability, and cost of assigning a crop on a land parcel. We have formulated the land use optimization problem as a classic combinatorial optimization problem - Generalized Assignment Problem (GAP) [2]. GAP is a well-known NP-hard problem [3]. When a landscape includes tens of thousands of land parcels (e.g., Figure 1), finding an exact optimal solution is computationally intractable.