Routing is regarded as the process that transfers packets from a given source to a given destination with minimum cost, so the routing algorithm has the most specific role of acquiring, organizing and distributing information regarding various network states. So, routing is considered as one of the most important issue for various wireless infrastructures-less networks as most of the Quality of Service (QOS) parameters are related to how efficiently and effectively routes are managed. The traditional approach like Dijkstra’s shortest path algorithm was not able to optimize the QOS issues along with finding the shortest/fittest path. So this chapter utilizes heuristic-based genetic approach to solve and optimize routing-related issues. The proposed and simulated algorithm finds the fittest path from source to destination and optimizes various QOS parameters like hop count, delay, throughput, etc. The proposed heuristic-based approach is compared with traditional Dijkstra’s approach through MATLAB simulator for further validation and affirmation of presented methodology.