Assuming by "multiple goals" you mean you want to reach any one, just take the minimum of all the heuristics. Assuming your heuristic is consistent, this is still a consistent heuristic.
If instead you're trying to reach all of them, this is essentially the traveling salesman problem, which is NP-Complete.