Abstract: A system and method for altering a portion of a pre-calculated route by allowing a user to graphically indicate the portion of the route to alter is disclosed. The user indicates the portion to be altered by navigating a pointer to a point along a graphical representation of the route and selecting the point. The point identifies which portion of the route is to be altered. The user may then alter the route by dragging and dropping the selected portion to a new destination. In essence, the user redirects the route to the new destination by dragging the selected portion of the route to the new destination.

Abstract: A computer-implementable method for ordering destinations to be visited in a computationally-efficient manner and which achieves an acceptable level of optimization of the order for those destinations is disclosed. The computer-implementable method orders destinations to be visited by identifying the position in an existing order of destinations where the insertion of a new destination will result in the shortest increase to the straight-line length of the route. More specifically, a single, continuous line connects each of the destinations to be visited. The continuous line is composed of multiple “links.” Each link is a straight line connecting two destinations. The total length of the continuous line is the sum of the lengths of each link. The order of the destinations defines the order in which the continuous line visits each destination.