An efficient particle swarm optimizer with application to man-day project scheduling problems
Summary: The multimode resource-constrained project scheduling problem (MRCPSP) has been confirmed to be an NP-hard problem. Particle swarm optimization (PSO) has been efficiently applied to the search for near optimal solutions to various NP-hard problems. MRCPSP involves solving two subproblems: mode assignment and activity priority determination. Hence, two PSOs are applied to each subproblem. A constriction PSO is proposed for the activity priority determination while a discrete PSO is employed for mode assignment. A least total resource usage (LTRU) heuristic and minimum slack (MSLK) heuristic ensure better initial solutions. To ensure a diverse initial collection of solutions and thereby enhancing the PSO efficiency, a best heuristic rate (HR) is suggested. Moreover, a new communication topology with random links is also introduced to prevent slow and premature convergence. To verify the performance of the approach, the MRCPSP benchmarks in PSPLIB were evaluated and the results compared to other state-of-the-art algorithms. The results demonstrate that the proposed algorithm outperforms other algorithms for the MRCPSP problems. Finally, a real-world man-day project scheduling problem (MDPSP) -- a MRCPSP problem -- was evaluated and the results demonstrate that MDPSP can be solved successfully.
- Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem
- Particle swarm optimization for resource-constrained project scheduling problem
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- An efficient differential evolution algorithm for multi-mode resource-constrained project scheduling problems
- A modified PSO algorithm for minimizing the total costs of resources in MRCPSP
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
- A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
- scientific article; zbMATH DE number 5372360 (Why is no real title available?)
- Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
- PSPLIB -- a project scheduling problem library
- Scheduling subject to resource constraints: Classification and complexity
- Simulated annealing for multi-mode resource-constrained project scheduling
- Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
- Tabu Search—Part I
- Tabu Search—Part II
- The museum visitor routing problem
- A modified PSO algorithm for minimizing the total costs of resources in MRCPSP
- Probability mechanism based particle swarm optimization algorithm and its application in resource-constrained project scheduling problems
- A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
- Multi-objective dynamic optimization using an improved particle swarm optimization algorithm for construction projects
- Solving multi-mode resource-constrained multi-project scheduling problem with combinatorial auction mechanisms
- Particle swarm optimization for resource-constrained project scheduling problem
- Hybrid particle swarm and differential evolution algorithm for solving multimode resource-constrained project scheduling problem
- Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
This page was built for publication: An efficient particle swarm optimizer with application to man-day project scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718586)
