Wireless Mesh Networks (WMNs) are a new type of wireless network that has been growing in popularity. These networks consist of routers and clients. The routers are called mesh routers (MRs) and the clients are called mesh clients. WMNs have several advantages over traditional wireless networks, such as more reliable coverage and faster speeds. Many different types of algorithms can be used to determine the best placement for these routers, with some algorithms being better than others depending on the environment or situation. One algorithm is called a Genetic Algorithm (GA), which uses genetic programming to find an optimal solution for router placement. GA is used to find the best placement of the router so that it can provide the most coverage possible for a specific area GA or evolutionary algorithms are based on a biological theory known as Darwin”s theory. In evolutionary algorithms, it is since the information of the problem becomes chromosomes, and then the problem is solved by special problem-solving techniques in the evolutionary algorithm. The suggested method was implemented utilizing the C++ programming environment and the NS2 software suite. Using a benchmark of produced instances, the experimental outcomes have been analyzed. Variable sets of produced instances ranging in size from small to big have been explored. Consequently, several properties of WMNs, including the topological placement of mesh clients, have been recorded.