A Genetic Algorithm for Site-Specific Management Zone Delineation

Shranjeno v:
Bibliografske podrobnosti
izdano v:Mathematics vol. 13, no. 7 (2025), p. 1064
Glavni avtor: Huguet, Francisco
Drugi avtorji: Plà-Aragonés, Lluís M, Albornoz, Víctor M, Pohl, Mauricio
Izdano:
MDPI AG
Teme:
Online dostop:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Oznake: Označite
Brez oznak, prvi označite!

MARC

LEADER 00000nab a2200000uu 4500
001 3188871928
003 UK-CbPIL
022 |a 2227-7390 
024 7 |a 10.3390/math13071064  |2 doi 
035 |a 3188871928 
045 2 |b d20250101  |b d20251231 
084 |a 231533  |2 nlm 
100 1 |a Huguet, Francisco  |u Department de Matemàtica, Universitat de Lleida, c/ Jaume II, 73, 25003 Lleida, Spain; <email>fhuguet@uca.edu.sv</email>; Department of Electronics and Informatics, Universidad Centroamericana UCA, Bulevar Los Próceres, Antiguo Cuscatlán, La Libertad 01-168, El Salvador; <email>mapohl@uca.edu.sv</email> 
245 1 |a A Genetic Algorithm for Site-Specific Management Zone Delineation 
260 |b MDPI AG  |c 2025 
513 |a Journal Article 
520 3 |a This paper presents a genetic algorithm-based methodology to address the Site-Specific Management Zone (SSMZ) delineation problem. A SSMZ is a subregion of a field that is homogeneous with respect to a soil or crop property, enabling farmers to apply customized management strategies for optimizing resource use. The algorithm generates optimized field partitions using rectangular zones, applicable to both regular and irregularly shaped fields. To the best of our knowledge, the Genetic Algorithm for Zone Delineation (GAZD) is the first approach to handle the rectangular SSMZ delineation problem in irregular-shaped lands without introducing non-real data. The algorithm’s performance is compared with an exact solution based on integer linear programming. Experimental tests conducted on real-field and generated irregular-shaped instances show that while the GAZD requires longer execution times than the exact approach, it proves to be functional and robust in solving the SSMZ problem. Furthermore, the GAZD offers a set of “good enough” solutions that can be evaluated for feasibility and practical convenience, making it a valuable tool for decision-making processes. Moreover, strategies such as implementation in a compiled language and parallel processing can be used to improve the execution time performance of the algorithm. 
653 |a Mathematical programming 
653 |a Property values 
653 |a Delineation 
653 |a Parallel processing 
653 |a Farmers 
653 |a Linear programming 
653 |a Agricultural production 
653 |a Evolution 
653 |a Genetic algorithms 
653 |a Integer programming 
653 |a Mutation 
653 |a Optimization 
653 |a Exact solutions 
700 1 |a Plà-Aragonés, Lluís M  |u Department de Matemàtica, Universitat de Lleida, c/ Jaume II, 73, 25003 Lleida, Spain; <email>fhuguet@uca.edu.sv</email>; Agrotecnio Center, Universitat de Lleida, 25198 Lleida, Spain 
700 1 |a Albornoz, Víctor M  |u Departamento de Industrias, Campus Santiago Vitacura, Universidad Técnica Federico Santa María, Av. Santa María 6400, Santiago 7650568, Chile; <email>victor.albornoz@usm.cl</email> 
700 1 |a Pohl, Mauricio  |u Department of Electronics and Informatics, Universidad Centroamericana UCA, Bulevar Los Próceres, Antiguo Cuscatlán, La Libertad 01-168, El Salvador; <email>mapohl@uca.edu.sv</email> 
773 0 |t Mathematics  |g vol. 13, no. 7 (2025), p. 1064 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3188871928/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text + Graphics  |u https://www.proquest.com/docview/3188871928/fulltextwithgraphics/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3188871928/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch