Abstract
In this paper, an improved discrete binary particle swarm optimization (BPSO) for large scale 0-1 integer programming is proposed. Firstly, a large-scale 0-1 integer programming model based on the multi-directional slice volume of the virtual grid element is constructed, and the optimization objective function is constructed to change the problem of solving the equations into the problem of seeking the optimal solution. Secondly, the 0-1 model intelligent solution algorithm based on the improved BPSO algorithm is designed, and the model solution system based on the grid slice volume measurement is designed. Finally, through the analysis of the experimental results, it shows that the improved discrete particle swarm optimization algorithm has a significant improvement on the convergence and calculation efficiency of the fitness function, which shows that the algorithm has a good optimization performance.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
