Metaheuristic Algorithms for Circle Packing Problem: A Comprehensive Review

The Circle Packing Problem (CPP) is a well-known combinatorial optimization problem with a wide range of applications such as logistics, cable allocation and many more. It is difficult to identify exact solutions for the CPP since it is a NP-hard problem. As a result, metaheuristic algorithms are efficient approach to address this challenging problem. This paper presents an extensive literature review of the role and effectiveness of Metaheuristic algorithms in solving the CPP. The objective of this paper is to examine the potential of metaheuristic algorithms in solving the CPP and application advancements. Moreover, case studies and real-world examples of how metaheuristics have been used to address the CPP. Finally, some suggested possible future areas are also highlighted for the researchers who want to utilize metaheuristic algorithms for solving the CPP and the real world problem which can be modeled as CPP.