PATENT CLAIM ANALYSIS

Application Number: 16127350
Application Type: Utility
Filing Date: 2018-09
Publication Date: 2019-03
Patent Classification: ["705", "007130"]

Abstract:
The present invention discloses a coordinated production and transportation scheduling method and system based on an improved tabu search algorithm, and a storage medium. The method includes batching jobs, initializing algorithm parameters, generating an initial solution, generating a neighborhood solution set, performing mutation, crossover and selection on individuals, determining a candidate solution set; calculating a fitness value of an individual, updating the candidate solution set; updating a tabu list, and determining whether an algorithm termination condition is satisfied; if yes, outputting the global optimal solution; otherwise, returning to the step 4. The present invention is mainly aimed at the coordinated production and transportation batch scheduling problem with multiple manufacturers. The whole profit of an enterprise in the production and transportation phases can be maximized, and high quality services can be provided for customers of the enterprise with improved core competitiveness of the enterprise.

Claim (Index 4):
The method according to  claim 1 , wherein outputting the fitness value of an individual in the step S13 comprises:\n step S131, traversing all elements in individual X={x 1 , . . . , x d , . . . , x l }, and defining variable d=1, with variable B k  representing a set of job batches assigned to the kth machine, and variable |B k | representing the number of job batches in the set B k ; step S132, determining whether 1\u2264x d \u2264m is satisfied; if no, performing step S133; otherwise, performing step S134; step S133, generating a random integer denoted as random in the range of an interval [1, m], and assigning random to x d ; step S134, determining whether x d =k is true, wherein k \u2208 {1, . . . , m}, and if yes, placing b d  into B k ; step S135, assigning d+1 to d, and determining whether d\u2264l is true; if yes, returning to the step S132; otherwise, performing step S136; step S136, defining variable k=1; step S137, defining variables j=1 and C k =0, wherein C k  represents the completion time of the kth machine; step S138, assigning C b kj =C b kj\u22121 +P b kj /v k  to C k , wherein P b kj  represents the processing time of the jth batch on the kth machine; step S139, assigning j+1 to j, and determining whether j\u2264|B k | is true; if yes, returning to the step S138; otherwise, assigning C k +r k +T k  to C k ; step S1310, assigning k+1 to k, and determining whether k\u2264|B k | is true; if yes, returning to the step S137; otherwise, obtaining a set of makespans of all machines denoted as C*{C 1 , . . . , C k , . . . , C m }; and step S1311, picking out the maximum element from the makespan set C* obtained in the step 1310, and assigning the element to C max , i.e., C max =max{C 1 , . . . , C k , . . . , C m }, wherein variable C max  represents the fitness value of the individual X.

Metadata:
- Claim Count in Document: 17.0
- Percentile: 97.0
- Lexical Diversity: 1.85227
- Patent Class: 705.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['16127337', '15958932', '12558879', '11866484', '11254501']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.121079565595404
- 35 USC 102 Novelty (BERT): 0.5269986201643438
- Combined Prediction Score: 0.1616714710522979
- Mean Citation Score: 228.83944599999995
- Max Citation Score: 338.37384
- Similarity Product: 208.1990639228439

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

Dataset: test