Improved particle swarm optimization algorithm for solving job-shop scheduling problem
A particle swarm algorithm and job shop technology, applied in the field of solving job shop scheduling problems with algorithms, can solve the problems of unprocessed particle information abnormalities, disturbances, narrowing the search range, etc., to reduce blind search time, reduce interference, and avoid unnecessary The effect of deterministic reasoning
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0039] Because the traditional particle swarm optimization algorithm has fast search speed, high efficiency and simple algorithm, it is suitable for real-time processing. However, it does not handle discrete optimization problems well, and it is easy to fall into local optimum. Therefore, in order to solve these problems, this algorithm first improves the method of randomly generating the initial solution of the traditional PSO: introduces the weighted average method to set the initial solution of the particles; secondly, improves the mean shift algorithm: uses the improved mean shift The algorithm predicts the next state of the initial solution, compares the predicted solution with the current optimal solution, and takes the better solution as the current optimal solution, which solves the abnormal change of particle information that is not considered in the particle swarm optimization algorithm ; Again, the introduction of the tabu search algorithm to further update the part...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


