A problem reduction strategy is introduced to reduce computational times by recognizing that the critical routes are not usually circuitous.
The search for the critical routes for an origin-destination (O-D) pair is confined to a limited geographical region around it.