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 4):
The method according to  claim 1 , wherein, in the step 5, performing local search on MEX k (L)  comprises:\n step 5.1: initializing parameters for local search, including the number of iterations it and the maximum number of iterations imax, where 1\u2264it\u2264imax; and initializing it=1; step 5.2: assuming h=1; step 5.3: randomly selecting any two positions for the h th  individual s kh (L)  in the group MEX k (L)  for exchange to obtain a new individual denoted by s\u2032 h , and calculating a fitness value for the individual s\u2032 h ; step 5.4: randomly selecting any one element of the individual s kh (L) , randomly inserting the element into another position to obtain a new individual denoted by s\u2032 h , and calculating a fitness value for the individual s\u2032 h ; step 5.5: determining whether the fitness value for s\u2032 h  is greater than the fitness value for s\u2032 h , if so, assigning s\u2032 h  to s\u2032 k ; step 5.6: determining whether the fitness value for s\u2032 h  is greater than the fitness value for the individual s kh (L) , if so, assigning s\u2032 h  to the individual s kh (L) ; step 5.7: determining whether h is not greater than N/S; if so, returning to the step 5.3; and step 5.8: determining whether it is not greater than imax; if so, assigning it+1 to it and returning to the step 5.2; or otherwise, ending the local search.

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.1016568490096957
- 35 USC 102 Novelty (BERT): 0.5421015110651223
- Combined Prediction Score: 0.1457013152152383
- Mean Citation Score: 224.767872
- Max Citation Score: 377.5464
- Similarity Product: 226.78110360488893

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