An efficient particle swarm optimizer with application to man-day project scheduling problems
type: Item
instance of: scholarly article
title: An efficient particle swarm optimizer with application to man-day project scheduling problems
zbMATH Open document ID: 1407.90147
DOI: 10.1155/2014/519414
author: Ruey-Maw Chen
author: Frode Eika Sandnes
published in: Mathematical Problems in Engineering
publication date: 2019-02-08T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7016649
describes a project that uses: PSPLIB
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2014/519414
OpenAlex ID: W2099338763
Wikidata QID: Q59068167
cites work: Scheduling subject to resource constraints: Classification and complexity
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: The museum visitor routing problem
cites work: Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid
cites work: A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling
cites work: A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
cites work: PSPLIB -- a project scheduling problem library
cites work: A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem
cites work: Q3540787
cites work: Simulated annealing for multi-mode resource-constrained project scheduling
cites work: Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms
cites work: Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
description: scientific article; zbMATH DE number 7016649