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 7):
A system for collaborative scheduling of production and transportation based on shuffled frog leaping and path relinking algorithms, comprising:\n a calculation module for performing: step 1: by using the processing time for jobs and the time for transportation between each machine and clients as inputs, initializing parameters in shuffled frog leaping and path relinking algorithms, including the total number of individuals in a population N, the number of groups divided from the population S, the number of iterations L and the maximum number of iterations L max , where 1\u2264L\u2264L max ; and initializing L=1; step 2: generating an initial population P={P 1 (L) , . . . , P i (L) , . . . , P N (L) } according to the inputs and obtaining an initial position P i (L) ={P n (L) , P 12 (L) , . . . , P id (L) , . . . , P i(n+m\u22121) (L) } of the i th  individual in the L th  generation based on the initial population, where P i (L)  is an array of integers between 1 and n+m\u22121, P id (L)  represents a position of the i th  individual in the L th  generation in a search space with the d th  dimension for indicating a corresponding job, where 1\u2264d\u2264n+m\u22121, 1\u2264i\u2264N, wherein n represents the number of jobs, and m represents the number of machines; step 3: calculating fitness values F(L)={F 1 (L) , . . . , F i (L) , . . . , F N (L) } for N individuals in the L th  generation, where 1\u2264i\u2264N and F i (L)  represents a fitness value for the i th  individual in the L th  generation; step 4: dividing N individuals in the L th  generation into S groups, with a set of S groups denoted by MEX(L)={MEX 1 (L) , MEX 2 (L) , . . . MEX k (L) , . . . MEX s (L) }, where MEX k (L) ={s k1 (L) , . . . , s kh (L) , . . . , s k(N/S) (L) } represents the k th  group in all groups in the L th  generation, where 1\u2264k\u2264S and 1\u2264h\u2264N/S; and setting k=1, wherein s kh (L)  represents the h th  individual in the k th  group; step 5: performing a local search operator on the h th  individual s kh (L)  in the group MEX k (L)  and updating the group MEX k (L) ; step 6: repeating the step 5 until the local search operator is performed on all individuals in the group MEX k (L) ; step 7: randomly selecting two individuals from the group MEX k (L)  to perform a global search operator and updating the group MEX k (L) ; step 8: assigning k+1 to k and determining whether k\u2264S is satisfied currently; if so, performing the step 6; or otherwise, performing the step 9; step 9: gathering groups updated in the step 7 to obtain an updated population P; step 10: randomly selecting two individuals from P to perform a greedy path relinking operator and updating P; and step 11: assigning L+1 to L and determining whether L\u2264L max  is satisfied currently; if so, performing the step 3; or otherwise, representing the completion of L max  iterations; and an output module for outputting the iteration result as a scheme of assigning jobs to each machine and a scheduling result of processing sequences on each machine.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.0904434581357907
- 35 USC 102 Novelty (BERT): 0.540824473253527
- Combined Prediction Score: 0.1354815596475643
- Mean Citation Score: 224.767872
- Max Citation Score: 377.5464
- Similarity Product: 314.0653004443645

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