A Clustering-Based Adaptive Hybrid Algorithm for the Stochastic Resource Allocation Problem With Time Windows

The stochastic resource allocation (SRA) problem is widely encountered in complex systems, where the resource may probabilistically fail to complete its assigned task. In practical scenarios, the assignment of resources to tasks should be handled within specified time windows, and the success probability of each assignment changes over time. Such a problem can be represented as the SRA problem with time window (SRA-TW). Both the discrete assignment relationship and the corresponding continuous-valued assignment time are indispensable in the decision scheme of SRA-TW. This mixed-variable nature poses a great challenge for optimization. Based on these requirements, SRA-TW is formulated as a mixed-variable optimization problem (MVOP) with temporal constraints. To solve this problem, an adaptive hybrid algorithm with clustering-based diversity preservation (<roman xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">AHA</roman><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><roman>CDP</roman></sub>) is proposed. Firstly, a variable-length hybrid encoding method with constructive decoding is proposed for incremental constraint handling. Secondly, a hybrid search mechanism incorporating a matching-similarity-guided adaptive selection method is proposed to balance the search in discrete and continuous subspaces. Then, a clustering-based diversity preservation strategy is developed, facilitating a good distribution of the population. Finally, an SRA-TW instance generator considering various problem features is designed, so as to comprehensively validate the algorithm’s performance. The statistical results over numerous instances demonstrate the superiority of <roman xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">AHA</roman><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><roman>CDP</roman></sub> over prevailing algorithms in addressing SRA-TW.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2025-10-14
DOI
https://doi.org/10.1109/tsmc.2025.3614245
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 Clustering-Based Adaptive Hybrid Algorithm for the Stochastic Resource Allocation Problem With Time Windows

Bin Xin, Danjing Wang, Jia Zhang, Xianpeng Wang et al.
IEEE Transactions on Systems Man and Cybernetics Systems
Scheduling and Optimization Algorithms
article

A Clustering-Based Adaptive Hybrid Algorithm for the Stochastic Resource Allocation Problem With Time Windows

Bin Xin, Danjing Wang, Jia Zhang, Xianpeng Wang, Qing Wang
article en

Abstract

The stochastic resource allocation (SRA) problem is widely encountered in complex systems, where the resource may probabilistically fail to complete its assigned task. In practical scenarios, the assignment of resources to tasks should be handled within specified time windows, and the success probability of each assignment changes over time. Such a problem can be represented as the SRA problem with time window (SRA-TW). Both the discrete assignment relationship and the corresponding continuous-valued assignment time are indispensable in the decision scheme of SRA-TW. This mixed-variable nature poses a great challenge for optimization. Based on these requirements, SRA-TW is formulated as a mixed-variable optimization problem (MVOP) with temporal constraints. To solve this problem, an adaptive hybrid algorithm with clustering-based diversity preservation (<roman xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">AHA</roman><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><roman>CDP</roman></sub>) is proposed. Firstly, a variable-length hybrid encoding method with constructive decoding is proposed for incremental constraint handling. Secondly, a hybrid search mechanism incorporating a matching-similarity-guided adaptive selection method is proposed to balance the search in discrete and continuous subspaces. Then, a clustering-based diversity preservation strategy is developed, facilitating a good distribution of the population. Finally, an SRA-TW instance generator considering various problem features is designed, so as to comprehensively validate the algorithm’s performance. The statistical results over numerous instances demonstrate the superiority of <roman xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">AHA</roman><sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><roman>CDP</roman></sub> over prevailing algorithms in addressing SRA-TW.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 55(12)
Beijing Institute of Technology (CN), Northeastern University (CN)
Openalex Percentile: Top 59%
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.