In this paper, we present a simultaneous planning of Base Stations (BSs) and Relay Stations (RSs) with link flow for a broadband wireless network. Infrastructure costs (BS cost, RS cost and their operational costs) of a wireless network is a key factor for network service providers while planning a network. The objective of this problem is to determine a set of BSs and RSs that can serve all users and fulfill their demands at the lowest cost. This problem settings is equally important for planning networks from scratch or enhancements in existing networks. This combinatorial optimization problem is NP-hard in nature. Evolutionary Algorithms (EAs) are intelligent tools that can provide high quality solution to this type of problems. Usually, efficiency of EAs depends on the problem. The aim is to find effective EAs with minimum resources such as low computational complexity, processing time and number of fitness functions evaluations. We formulate this problem as a non-linear discrete optimization and introduce four recent EAs that are motivated by natural intelligent behaviors. The objective function of this planning problem is computationally costly, and there exist a tradeoff between resources and quality of solution. These algorithms include Biogeography-based Optimization (BBO) that is inspired by the natural migration phenomenon of species between different islands, Artificial Bee Colony (ABC) based on the intelligent behavior of honey bee swarms, Quantum-inspired Evolutionary Algorithm (QEA) from the idea of quantum computing, and Immune Quantum Evolutionary Algorithm (IQEA) motivated by both the immune theory and quantum computing. Simulation results demonstrate insights of EAs' and present tradeoff between resources and quality of solutions.