Abstract
Particle swarm optimization (PSO) algorithm was originally developed and extensively used for solving multivariable and highly nonlinear continuous problems. To apply PSO to a discrete integer-coded problem such as the multimode resource constrained project scheduling problems (MRCPSP), there should have a special mechanism that can convert the real valued solutions to the integer-coded solutions without crucial impact on the exploitative abilities of the algorithm. In this paper, we focus on this problem and develop an efficient PSO algorithm to solve the MRCPSP. Computational results by using a standard set of benchmark instances demonstrate the effectiveness and competitiveness of our algorithm.
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.
