This paper presents research into a routing problem, which addresses road congestion problems faced by motorists as commuters in a metropolitan sized city. Specifically the routing problem for London has been investigated, and a variant to the well-known TSP (Traveling Salesman Problem) has been applied together with an evolutionary search algorithm. A genetic algorithm has been developed which can provide a near optimum solution to the routing problem in a short period of time. The solution consists of using a lookup table, which imitates real-time traffic conditions in order to optimize the route. Both distance and journey time can be used as cost functions, separately or in a combined fashion.