Verizon Patent and Licensing Inc.

Jefferson Ray Tan Hidayat

Nathan M Robinson

Mark Robert Dunlop

Faiza Tajammul

William George Looman

Katherine Winnie Kok

Hayden Sean White

Johanna Emily Read

Brendan Ryan Bycroft

Mykhaylo Tyuryutikov

Hughan Jay Ross

A system described herein may provide a technique for selectively adding or forgoing adding shortcut links to a node map using contraction hierarchy techniques based on turn costs. 'Useful' turn pairs for a given path through a shortcut link may include a turn into a first node of the shortcut link and a turn out of a second node of the shortcut link, where no alternative lower cost paths (including such “useful” turn pairs) from the first node to the second node are available. The useful turn pairs for a shortcut link may be used to evaluate super shortcut links that includes the shortcut link with identified useful turn pairs. For example, a search for alternative lower cost paths may need not be performed for paths, associated with the super shortcut link, which do not include a turn from the useful turn pairs of the component shortcut link.

Systems and methods for optimal path determination using contraction hierarchies with turn costs

A device can determine scenario information associated with a plurality of route planning scenarios. The scenario information can include information that describes, for each route planning scenario of the plurality of route planning scenarios, a condition or a configuration based on which a respective route plan is to be generated. The device can calculate, based on a plurality of route plans corresponding to the plurality of route planning scenarios, a set of metrics associated with the plurality of route planning scenarios. The set of metrics can be calculated based on a single user interaction with a user interface. The device can provide information associated with the set of metrics. The providing the information associated with the set of metrics can cause an action, associated with at least one route plan of the plurality of route plans, to be automatically performed.

Comparative metrics for route planning scenarios

A system described herein may provide a technique for the generation of a node map using contraction hierarchy techniques in a manner that accounts for constraints that apply to nodes or links between nodes in the node map. Candidate shortcut links, that represent paths through multiple links in the node map, may be evaluated to determine whether such candidate shortcut links are less restrictive than less costly paths having the same starting and ending nodes as the candidate shortcut links. Candidate shortcut links may be added to the node map in situations where less costly paths are available, but are more restrictive than the shortcut links. At query time, the shortcut links may apply to certain queries having parameters that violate constraints associated with the less costly paths but do not violate any applicable constraints of the shortcut links.

Systems and methods for optimal path determination using contraction hierarchies with link constraints

A route planning platform can identify a plurality of nodes interconnected by a plurality of paths in a road network, can divide the road network into a plurality of partitions, and can generate a respective contraction hierarchy for each partition of the plurality of partitions. The route planning platform can generate, based on the contraction hierarchies of the plurality of partitions, an overlay network and can generate a contraction hierarchy for the overlay network. The route planning platform can obtain information relating to an origination point and a destination point associated with the road network and can identify a first partition associated with the origination point and a second partition associated with the destination point. The route planning platform can determine a route from the origination point to the destination point based on the respective contraction hierarchies of the first partition, the second partition, and the overlay network.

Using partitioned contraction hierarchies to determine a route from an origination point to a destination point

A system described herein may provide a technique for selectively adding or forgoing adding shortcut links to a node map using contraction hierarchy techniques based on turn costs. 'Useful' turn pairs for a given path through a shortcut link may include a turn into a first node of the shortcut link and a turn out of a second node of the shortcut link, where no alternative lower cost paths (including such 'useful' turn pairs) from the first node to the second node are available. The useful turn pairs for a shortcut link may be used to evaluate super shortcut links that includes the shortcut link with identified useful turn pairs. For example, a search for alternative lower cost paths may need not be performed for paths, associated with the super shortcut link, which do not include a turn from the useful turn pairs of the component shortcut link.

A device can receive, from a user device, a request for a simulation of a forecasted change in production of a client organization. The device can obtain scheduling information for a set of historical work orders and a set of existing work orders associated with the client organization. The device can generate a set of simulated work orders using a forecasting technique, information included in the request, and the scheduling information. The device can generate one or more simulated schedules for simulating performance of the set of simulated work orders. The device can determine that one or more capacity values associated with operational resources needed to carry out the set of simulated schedules satisfy one or more threshold capacity values. The device can generate one or more recommendations for improving processes associated with the client organization. The device can provide the one or more recommendations to the user device.

Forecasting simulator

In one embodiment, a system for routing vehicles in a vehicle fleet includes a location assignment module comprising computer hardware and a routing module. The location assignment module can be configured to iteratively: determine whether quotas are met for a plurality of territories based at least on locations assigned to individual territories of the plurality of territories, and in response to determining that the quota is unmet for one or more individual territories, assign one or more additional locations to the one or more individual territories having unmet quotas based at least on a proximity of the one or more additional locations to a different reference location associated with each of the one or more individual territories having unmet quotas. The routing module can be configured to generate routes including the locations assigned to the individual territories for vehicles in a vehicle fleet.

Vehicle fleet routing system

A computerized vehicle control system for fleet routing includes a fleet of vehicles where each vehicle in the fleet of vehicles is configured to travel over streets and including an engine and wheels. Each vehicle further includes an in-vehicle electronic device comprising digital logic circuitry and a port configured to couple with a vehicle computer installed in the vehicle and in communication with a plurality of sensors disposed about the vehicle. The in-vehicle electronic device further comprises a display. The computerized vehicle control system further includes a vehicle management system comprising memory and computer hardware and configured to communicate over a network with each in-vehicle electronic device in the fleet of vehicles.

Computerized vehicle control system for fleet routing

In one embodiment, a system includes a memory device and a hardware processor. The memory can store multiple locations positioned along a network of streets in a geographic region. The hardware processor can assign some of the multiple locations to multiple territories associated with multiple vehicles by iteratively: determining whether an allocation threshold is met for the multiple territories and, in response to determining that the allocation threshold is unmet for at least two of the multiple territories, assigning one of the multiple locations not yet assigned to the multiple territories to one of the at least two of the multiple territories. In addition, the hardware processor can generate multiple routes connecting the multiple locations for the multiple vehicles so that each of the multiple routes connects the locations of the multiple locations assigned to one of the multiple territories.

Growing community of inventors

Christchurch, New Zealand

Jefferson Ray Tan Hidayat