@article{article_1487334, title={Solving Static Weapon-Target Assignment Problem using Multi-Start Late Acceptance Hill Climbing}, journal={Current Trends in Computing}, volume={2}, pages={23–35}, year={2024}, author={Alparslan, Selin and Sonuç, Emrullah}, keywords={Combitonarial Optimization, Late Acceptance Hill Climbing, Weapon-Target Assignment Problem}, abstract={The Weapon-Target Assignment (WTA) problem is a complex optimization challenge in defense strategy, where weapons must be assigned to targets to minimize the expected value of surviving targets. This study addresses the static WTA (SWTA) problem, where assignments are made once and remain unchanged. Given the NP-complete nature of the SWTA problem, exact solution methods are often impractical due to computational complexity. This paper proposes a novel approach that combines multi-start and Late Acceptance Hill Climbing (LAHC) strategies to improve solution quality. Experimental results on various problem instances show that the Multi-Start Late Acceptance Hill Climbing (MLAHC) algorithm consistently achieves higher quality solutions with improved stability compared to the traditional LAHC algorithm, especially for larger problem instances. This approach represents a significant advance in the optimization of military resource allocation.}, number={1}, publisher={Karabuk University}