Abstract
In this paper, we present the Large Language Model-based combinatorial optimizer (LMCO) for wireless network optimization and planning tasks, focusing on optimizing the number and the placement of wireless access point placement. The performance and efficiency of LMCO are evaluated and compared with the well-established Ant Colony Optimization (ACO) algorithm. The results indicate that LMCO exhibits superior performance, particularly as the complexity of the problem increases. These findings also underscore the significant potential of LLM-based algorithms in revolutionizing combinatorial optimization across a wide range of applications.
Funding Information
  • Alexander S. Onassis Public Benefit Foundation
  • Foundation for Education and European Culture
  • Royal Society Industry Fellow Scheme (IF-R2-23200104)
  • Royal Society Project (IEC-NSFC-211264)

This publication has 9 references indexed in Scilit: