Three-dimensional encasement novel genetic algorithm model under multi-constrain condition
A genetic algorithm and dimension packing technology, applied in the direction of gene model, etc., can solve the problems of restricting the development of the container transportation industry, less handling of packing problems, and lower transportation costs
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0025] figure 1 The algorithm flow chart is used for this algorithm model. In order to further illustrate the content, effects and innovations of the present invention, the technical details will be further elaborated below.
[0026] For the bin packing problem, the chromosome structure used in this genetic algorithm model is: DNA={G 1 ,G 2 ,G 3 ,…,G M ,} ,in G i Indicates the first i Each cargo, including the input information of size, weight, center of gravity, and maximum load. M is the chromosome length, it is easy to know, M The larger it is, the slower the algorithm executes. In order to speed up the processing speed of the genetic algorithm, this model adopts preprocessing measures, that is, stacking and combining small goods into large goods. In order to ensure that the combined algorithm can quickly converge to the optimal value, the combined conditions are as follows:
[0027] 1. Each combined cargo is composed of no more than Г small cargo stacks (in...
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, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com