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 2):
The method according to  claim 1 , wherein, in the step 3, calculating a fitness value F i (L)  for the i th  individual P i (L) ={P n (L) , P 12 (L) , . . . , P id (L) , . . . , P i(n+m\u22121) (L) } in the L th  generation comprises:\n step 3.1: setting u=1, d=1, C max= 0, where C max  is the maximum makespan time, and d represents the d th  position of solution vectors; step 3.2: determining whether P id (L)  is not greater than n; if so, assigning a job J P id (L)  to a machine m u ; or otherwise, performing the step 3.4, where m u  represents the uth machine; step 3.3: determining whether d\u2264n+m\u22121 is satisfied; if so, assigning d+1 to d and performing the step 3.2; or otherwise, outputting the fitness value F i ( L ) = 1 C max for the i th  individual in the L th  generation and ending the process of calculating the fitness value;\n step 3.4: placing the first unassigned job in a list of jobs assigned to the machine m u  in a batch capable of containing the first unassigned job; if the remaining space of all batches cannot contain the first unassigned job currently, generating a new batch with a capacity of C and placing the first unassigned job in the new batch, wherein the remaining space is a difference between the capacity C and the sum of the size of all jobs placed in the corresponding batch; and repeating this step until all jobs in a set of jobs are assigned to corresponding batches; \n step 3.5: sequencing batches obtained in the step 3.4 in a non-descending order of the arrival time for batches and sequencing batches with the same arrival time in a non-descending order of the processing time for jobs; processing according to the arrangement order of batches, denoting the maximum time required for transporting a job in all jobs on the machine m u  to a specific client by T u  and denoting the maximum completion time for all jobs on the machine M u  by C u ; determining whether C u +T u  is greater than C max , if so, assigning C u +T u  to C max , where the arrival time for a batch is the maximum arrival time for jobs in the batch and the processing time for the batch is the maximum processing time for jobs in the batch; and \n step 3.6: assigning u+1 to u and performing the step 3.2.

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.1013439003522921
- 35 USC 102 Novelty (BERT): 0.5424330341999588
- Combined Prediction Score: 0.1454528137370588
- Mean Citation Score: 224.767872
- Max Citation Score: 377.5464
- Similarity Product: 255.57923950352668

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