A Two-Stage Optimization Approach Using Rounding-Off Particle Swarm Optimization for the Crowdsourced Resource Scheduling Problem

An application of the scheduling problem for projects with multiskill resource limits is the Crowdsourcing Resource Scheduling Problem (CRSP). Since the crowdsourcing issue with resource scheduling also involves resource constraints and skill matching problems, it is consistent with the core principles of Muti-skill Resource Constrained project Scheduling Problem (MS-RCPSP). Therefore, a two-stage optimization method (TS-RND-PSO) based on rounding-off particle swarm optimization (RND-PSO) was proposed to model the CRSP model by using MS-RCPSP framework. To begin, the task sequence vector is utilized to encode the solution, and a decoding technique incorporating resource limitations and talent matching is presented to provide a realistic scheduling scheme. Then, the twostage dynamic inertia weight adjustment strategy is adopted to expand the search area and enhance the widespread search ability by optimizing the high inertia weight in the early stage, to avoid falling into the local optimal. In the second stage, the inertia weight is gradually reduced, and the search area is aggregated to the local area near the optimal solution to increase the algorithm’s comprehension accuracy and convergence efficiency. Results from experiments indicate that when compared to conventional techniques, the proposed algorithm has significant advantages in scheduling accuracy and convergence speed.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/aiim64537.2024.10934433
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Two-Stage Optimization Approach Using Rounding-Off Particle Swarm Optimization for the Crowdsourced Resource Scheduling Problem

Wei Huang, Yuxi Luan
Scheduling and Optimization Algorithms
article

A Two-Stage Optimization Approach Using Rounding-Off Particle Swarm Optimization for the Crowdsourced Resource Scheduling Problem

Wei Huang, Yuxi Luan
article en

Abstract

An application of the scheduling problem for projects with multiskill resource limits is the Crowdsourcing Resource Scheduling Problem (CRSP). Since the crowdsourcing issue with resource scheduling also involves resource constraints and skill matching problems, it is consistent with the core principles of Muti-skill Resource Constrained project Scheduling Problem (MS-RCPSP). Therefore, a two-stage optimization method (TS-RND-PSO) based on rounding-off particle swarm optimization (RND-PSO) was proposed to model the CRSP model by using MS-RCPSP framework. To begin, the task sequence vector is utilized to encode the solution, and a decoding technique incorporating resource limitations and talent matching is presented to provide a realistic scheduling scheme. Then, the twostage dynamic inertia weight adjustment strategy is adopted to expand the search area and enhance the widespread search ability by optimizing the high inertia weight in the early stage, to avoid falling into the local optimal. In the second stage, the inertia weight is gradually reduced, and the search area is aggregated to the local area near the optimal solution to increase the algorithm’s comprehension accuracy and convergence efficiency. Results from experiments indicate that when compared to conventional techniques, the proposed algorithm has significant advantages in scheduling accuracy and convergence speed.

Beijing Institute of Technology (CN)
Openalex Percentile: Top 58%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.