Given a dynamic graph representing a city traffic network where edge weights change in real-time, analyze the limitations of the standard A* algorithm. Propose a modified algorithm or heuristic approach that improves performance for repeated queries in this dynamic environment. Discuss the time and space complexity of your proposed solution compared to A* and Dijkstra's algorithm. Include pseudo-code for your optimization logic.