1. A method for computing routing on a road network, comprising: pre-processing routing data for one or more environmental profiles integrated into a hierarchy of roads in a database; computing short cuts for the one or more environmental profiles; merging the short cuts for the one or more environmental profiles into the database; identifying one or more portions of a road network as being more preferable than normal based on real-time data; expressing the one or more portions of the road network as a sequence of locations comprising a uniquely identifiable path; dynamically adding links describing the sequence of locations to the hierarchy of roads in the database; and performing cluster-routing to approximate routing travel costs based on real-time traffic data.