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 6):
The method according to  claim 1 , wherein, the step 10 comprises:\n step 10.1: randomly dividing the whole population P into two groups and assuming r=1; step 10.2: denoting an individual with the greatest fitness value in the first group by s c (L)  and denoting an individual with the greatest fitness value in the second group by s d (L) ; using s c (L)  as an initial solution of the path relinking algorithm and using s d (L)  as an oriented solution of the path relinking algorithm; and assigning s c (L)  to s(r), where s(r) and s c (L)  have a same constitution; step 10.3: assuming D={v|s cd (L) \u2260s dd 1 , d=1,2, . . . , n}, where v represents that values for s c (L)  and s d (L)  in the v th  dimension are different and D represents a set of v; step 10.4: determining whether D is a null set; if so, performing the step 10.8; step 10.5: for all v\u2208D, replacing a value for the v th  position of s(r) with a value for the v th  position of s d (L)  to generate a new individual and place the new individual in a set CS(r), where CS(r) is a set of new solutions generated by the r th  path relinking; step 10.6: calculating fitness values for all individuals in the set CS(r), selecting an individual with the greatest fitness value to assign to s(r), and deleting v corresponding to the individual with the greatest fitness value from the set D; step 10.7: assigning r+1 to r, placing individuals is the set CS(r) into the set CS, and performing the step 10.4, where CS is a set of all new solutions generated by the current algorithm; and step 10.8: determining whether an individual with the greatest fitness value in the set CS is better than the initial solution s c (L) ; if so, assigning the individual with the greatest fitness value in the set CS to the initial solution s c (L) ; or otherwise, randomly selecting an individual from the set CS to assign to s c (L) .

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.1017756548620093
- 35 USC 102 Novelty (BERT): 0.5419759297710125
- Combined Prediction Score: 0.1457956823529096
- Mean Citation Score: 224.767872
- Max Citation Score: 377.5464
- Similarity Product: 215.8714200689793

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