Massively Parallel Lagrangian Relaxation Algorithm for Solving Large-Scale Spatial Optimization Problems Using GPGPU

Sábháilte in:
Sonraí bibleagrafaíochta
Foilsithe in:ISPRS International Journal of Geo-Information vol. 14, no. 11 (2025), p. 419-441
Príomhchruthaitheoir: Lei, Ting L
Rannpháirtithe: Wang, Rongrong, Lei Zhen
Foilsithe / Cruthaithe:
MDPI AG
Ábhair:
Rochtain ar líne:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Clibeanna: Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!

MARC

LEADER 00000nab a2200000uu 4500
001 3275524189
003 UK-CbPIL
022 |a 2220-9964 
024 7 |a 10.3390/ijgi14110419  |2 doi 
035 |a 3275524189 
045 2 |b d20250101  |b d20251231 
084 |a 231472  |2 nlm 
100 1 |a Lei, Ting L  |u Department of Geography & Atmospheric Science, University of Kansas, Lawrence, KS 66045, USA; lei@ku.edu 
245 1 |a Massively Parallel Lagrangian Relaxation Algorithm for Solving Large-Scale Spatial Optimization Problems Using GPGPU 
260 |b MDPI AG  |c 2025 
513 |a Journal Article 
520 3 |a Lagrangian Relaxation (LR) is an effective method for solving spatial optimization problems in geospatial analysis and GIS. Among others, it has been used to solve the classic p-median problem that served as a unified local model in GIS since the 1990s. Despite its efficiency, the LR algorithm has seen limited usage in practice and is not as widely used as off-the-shelf solvers such as OPL/CPLEX or GPLK. This is primarily because of the high cost of development, which includes (i) the cost of developing a full gradient descent algorithm for each optimization model with various tricks and modifications to improve the speed, (ii) the computational cost can be high for large problem instances, (iii) the need to test and choose from different relaxation schemes, and (iv) the need to derive and compute the gradients in a programming language. In this study, we aim to solve the first three issues by utilizing the computational power of GPGPU and existing facilities of modern deep learning (DL) frameworks such as PyTorch. Based on an analysis of the commonalities and differences between DL and general optimization, we adapt DL libraries for solving LR problems. As a result, we can choose from the many gradient descent strategies (known as “optimizers”) in DL libraries rather than reinventing them from scratch. Experiments show that implementing LR in DL libraries is not only feasible but also convenient. Gradient vectors are automatically tracked and computed. Furthermore, the computational power of GPGPU is automatically used to parallelize the optimization algorithm (a long-term difficulty in operations research). Experiments with the classic p-median problem show that we can solve much larger problem instances (of more than 15,000 nodes) optimally or nearly optimally using the GPU-based LR algorithm. Such capabilities allow for a more fine-grained analysis in GIS. Comparisons with the OPL solver and CPU version of the algorithm show that the GPU version achieves speedups of 104 and 12.5, respectively. The GPU utilization rate on an RTX 4090 GPU reaches 90%. We then conclude with a summary of the findings and remarks regarding future work. 
653 |a Deep learning 
653 |a Spatial analysis 
653 |a Algorithms 
653 |a Operations research 
653 |a Optimization 
653 |a Solvers 
653 |a Computer applications 
653 |a Heuristic 
653 |a Optimization models 
653 |a Mathematical programming 
653 |a Libraries 
653 |a Graphics processing units 
653 |a Programming languages 
653 |a Neural networks 
653 |a Computing costs 
653 |a Geographic information systems 
653 |a Vectors 
653 |a Geographical information systems 
700 1 |a Wang, Rongrong  |u Department of Computational Mathematics, Science, and Engineering (CMSE), Michigan State University, East Lansing, MI 48824, USA; wangron6@msu.edu 
700 1 |a Lei Zhen  |u College of Automation, Wuhan University of Technology, Wuhan 430070, China 
773 0 |t ISPRS International Journal of Geo-Information  |g vol. 14, no. 11 (2025), p. 419-441 
786 0 |d ProQuest  |t Advanced Technologies & Aerospace Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3275524189/abstract/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text + Graphics  |u https://www.proquest.com/docview/3275524189/fulltextwithgraphics/embedded/6A8EOT78XXH2IG52?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3275524189/fulltextPDF/embedded/6A8EOT78XXH2IG52?source=fedsrch