PATENT CLAIM ANALYSIS

Application Number: 16242937
Application Type: Utility
Filing Date: 2019-01
Publication Date: 2019-07
Patent Classification: ["701", "422000"]

Abstract:
The technology disclosed relates to a method for demand-response scheduling that resolves the most undesirable issues intrinsic to the paradigm of the prior art, namely constructing schedules by “Trip by Trip Insertion” onto service vehicles called routes. These issues are classified into Customer Service, On-time Performance, and Efficiency categories. The first step of the 2-step process is to globally build packets to patterns in a library that provide good Customer Service, On-time Performance protection, and Positive Ridesharing Efficiency. The packets are “Mini-Manifests” that meet all constraints, and once formed, are locked from modification by any subsequent scheduling action. The second step is to globally build routes by chaining packets together, controlled by configurable heuristic strategy. The routes that are built directly resolve the undesirable issues.

Claim (Index 6):
A computer system for route programming, comprising:\n a memory configured to store program instructions; a processor that is configured to execute the program instructions to:\n receive data for a number of vehicles that can service trip requests; \n receive data for a number of trip requests each having trip parameters associated therewith; \n divide the number of trip requests into clusters of individual trip requests that could possibly be linked together to form a route; \n analyze each of the trip requests in a cluster to determine if two or more trip requests in the cluster can be joined in a manner that:\n meets the trip parameters of the two or more trip requests; and \n can be serviced by a vehicle; \n \n wherein the two or more joined trip requests define a mini-route that is not changed by subsequent processing of trip requests in other clusters; and \n combine the trip requests of a number of mini-routes to create larger routes.

Metadata:
- Claim Count in Document: 11.0
- Percentile: 99.0
- Lexical Diversity: 1.68235
- Patent Class: 701.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['11563418', '15474757', '15457300', '14601167', '13074906']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.4145958028545797
- 35 USC 102 Novelty (BERT): 0.4757086630283468
- Combined Prediction Score: 0.4207070888719564
- Mean Citation Score: 137.107238
- Max Citation Score: 143.60034
- Similarity Product: 95.69936866029738

Labels:
- Claim Label 101: 0
- Claim Label 102: 0
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 0

Dataset: test