2009
DOI: 10.1007/978-3-642-04617-9_24
|View full text |Cite
|
Sign up to set email alerts
|

A Comparison of Neighbourhood Topologies for Staff Scheduling with Particle Swarm Optimisation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 8 publications
0
6
0
Order By: Relevance
“…A pictorial diction of the robot's states represented as particles in an optimization process can be seen in figure 2. PSO is implemented in many ways with varying levels of bioinspiration reflected in terms of the neighborhood topology that is used for convergence [28]. Each particle maintains it current best position ‫‬ ௦௧ and global best ݃ ௦௧ position.…”
Section: Optimization Proceduresmentioning
confidence: 99%
“…A pictorial diction of the robot's states represented as particles in an optimization process can be seen in figure 2. PSO is implemented in many ways with varying levels of bioinspiration reflected in terms of the neighborhood topology that is used for convergence [28]. Each particle maintains it current best position ‫‬ ௦௧ and global best ݃ ௦௧ position.…”
Section: Optimization Proceduresmentioning
confidence: 99%
“…2-b). As nurse 4 was violating constraint C3, entries (4,1) and (4,3) are set at 0. Finally, the greedy procedure attempts, successfully in this case, to repair the solution setting entries (3, 1) and (1, 3) at 4 ( Fig.…”
Section: Movesmentioning
confidence: 99%
“…Work on the transformation of the working mechanism of PSO to the permutation problem domain, where the representations are highly constrained, has been relatively limited. 2,3,4 This limitation is mainly caused due to the lack of a principled generalization of PSO to guide its adaptation to discrete combinatorial problems such as scheduling problems. In this paper, we design a PSO algorithm for a real world scheduling problem with discrete domains without losing the underlying principles of the original PSO.…”
Section: Introductionmentioning
confidence: 99%
“…The lbest approach is one of the earlier attempts, which usually improves the diversity; however, it is slower than the gbest approach [21] and requires more parameters and setting of a suitable neighborhood topology. Even in [15], gbest approach is found to be superior than several lbest topologies and therefore is preferred in this context.…”
Section: The Basic Pso Techniquementioning
confidence: 99%