PATENT CLAIM ANALYSIS

Application Number: 16006694
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-12
Patent Classification: ["705", "007180"]

Abstract:
A method and system for collaborative scheduling of production and transportation based on shuffled frog leaping and path relinking algorithms. The method includes the following steps: 1. setting algorithm parameters; 2. generating an initial population; 3. calculating fitness values; 4. grouping the population; 5. performing local search on all groups and updating individuals in groups; 6. performing global search on all groups and updating individuals in groups; 7. gathering all groups to obtain a new population; 8. performing a greedy path relinking algorithm on elegant solutions in the population to obtain an updated population; and, 9. determining termination conditions of algorithms; if so, ending; or otherwise, returning to the step 3.

Claim (Index 3):
The method according to  claim 1 , wherein, in the step 4, grouping the population P comprises:\n step 4.1: sequencing individuals in the population P={P 1 , P 2 , . . . , P N } in a non-ascending order of fitness values and assuming Temp=N, where Temp is the total number of ungrouped individuals currently; step 4.2: assuming l=1; step 4.3: calculating the percentage Prob={Prob 1 , . . . , Prob x , . . . , Prob Temp } of a fitness value for each ungrouped individual to the sum of fitness values for ungrouped individuals in turn, where Prob x  represents the percentage of a fitness value for the x th  ungrouped individual to the sum of fitness values for ungrouped individuals and 1\u2264x\u2264Temp. step 4.4: assuming t=1 and \u2211 x = 1 0 \ue89e Prob x = 0 , and generating a random number Rand within [0,1];\n step 4.5: determining whether \n \u2211 x = 1 t \ue89e Prob x \u2264 Rand < \u2211 x = 1 t \ue89e Prob x is satisfied; if so, assigning an individual s t  to the group MEX k (L) ; or otherwise, assuming t=t+1 and repeating the step 4.5; and\n step 4.6: determining whether Temp is equal to 1; if so, ending the grouping; or otherwise, assigning Temp\u22121 to Temp and determining whether l is equal to S; if so, performing the step 4.2; or otherwise, assigning l+1 to l and performing the step 4.3.

Metadata:
- Claim Count in Document: 13.0
- Percentile: 94.0
- Lexical Diversity: 1.67105
- Patent Class: 705.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['15958932', '14650747', '12851498', '09893108', '14434755']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.1013408559521613
- 35 USC 102 Novelty (BERT): 0.5424362673624262
- Combined Prediction Score: 0.1454503970931878
- Mean Citation Score: 224.767872
- Max Citation Score: 377.5464
- Similarity Product: 255.8589357419014

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

Dataset: test