Quantum computing has attracted considerable interest from researchers due to its remarkable advantages over traditional computing methods. However, over time, its development has faced several implementation and design challenges. One critical issue is meeting the Nearest Neighbour (NN) condition in realizing circuits. This issue can be addressed through the use of SWAP gates. However, this raises another design concern, that is, determining NN architecture with minimized usage of SWAP gates. To explore this challenge, we have developed a heuristic technique for cost-effective, NN-compliant representation of quantum circuits in a 2D layout. During the design phase, we are employing k-means clustering technique along with genetic algorithm to acquire the efficient NN solutions. Thereafter, we have applied A* approach for required SWAP insertions. Our proposed method has been evaluated across a broad spectrum of benchmarks, demonstrating significant enhancements compared to state-of-the-art design methodologies. Additionally, our approach can be scaled to Larger benchmark suite.