Explain how to optimize the A* search algorithm for a real-time pathfinding application in a dynamic, weighted graph where edge weights change stochastically. Discuss the mathematical implications of using different heuristic functions, specifically focusing on admissibility and consistency. Propose a method for rebalancing the search tree to minimize computational overhead without sacrificing optimality.