Iterated local search algorithm by employing improved perturbation mode for solving job-shop scheduling problem
A technology for iterative local search and scheduling problems, applied in computing, manufacturing computing systems, instruments, etc., can solve problems such as escaping from local optimum, falling into local optimum, and unable to help solve problems, and achieve the effect of improving development and stability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0054]In order to make the object, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present invention and not to limit the present invention.
[0055] In order to overcome the shortcomings of the traditional iterative local search in solving the job shop scheduling problem, the present invention designs a new perturbation method and elite pool strategy, and proposes an iterative local search algorithm for solving the job shop scheduling problem with an improved perturbation method . Although the traditional iterative local search can obtain a good solution in a short calculation time, it is easy to fall into the problem of local optimum. Therefore, this algorithm introduces two kinds of neighborhood structure and elite pool strategy, and i
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap