This study addresses the challenge of optimizing sensor placement in a crop field irrigated by canals, with the aim of maximizing the coverage of points of interest using the least number of sensors. This location problem resembles issues of maximum coverage and the well-known knapsack and set cover problems. To overcome this challenge, the use of the Simulated Annealing algorithm is proposed, a local search-based optimization technique. The algorithm was implemented on a rectangular surface of 2000 x 2000 m with 75 points of interest and 30 sensors with a coverage radius of 100 units each. The results showed that the algorithm was able to cover 54 out of the 75 points of interest. Despite the stochastic nature of Simulated Annealing, it was concluded that repeated execution of the algorithm can provide consistently optimal solutions.