Abstract
RCPSP(Resource-constrained Project Scheduling Problem) that has been proved to be a NP-hard problem is a kind of combination optimization problem. With the problem scale becoming larger and larger, the problem will become more difficult to solve. A discussion mechanism based on brain storm optimization (DMBSO) for the RCPSP was presented. According to the characteristics of the RCPSP and the problem of poor accuracy and slow convergence in later period of algorithm. We proposed an adaptive inertial selection strategy based on DMBSO (AD-DMBSO) to solve the RCPSP. The algorithm can control the probability of inter-group and intra-group discussion by adjusting the probability of population grouping strategy, which can strengthen the global search in the early stage, and enhance the local search in the later stage. We test AD-DMBSO algorithm on four sets of problem from PSPLIB. The experimental result showed that the proposed algorithm is superior to the DMBSO and particle swarm optimization (PSO) algorithm in solving the local optimum problem and converging to better optimal values. The excellent performance of the AD-DMBSO algorithm shows its great potential in solving the RCPSP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.