Abstract
0-1 integer programming model of steel making scheduling was presented. Boolean algebra was applied to restrict the search space of particle swarm optimization to 0-1 space. As for the difficulty of constraint problem of 0-1 integer programming, a cooperative particle swarm optimization(CPSO) algorithm was proposed, which embody two particle swarms, one's goal is to minimize the objective function, the other is to meet the constraint condition. Two particle swarms cooperate to solve the 0-1 integer programming problem. The CPSO algorithm has been applied to solve the steel making scheduling problem successfully.
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.
