Instance-driven evolution of constructive heuristic ensemble for the stochastic resource allocation problem with time windows

IF 8.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Swarm and Evolutionary Computation Pub Date : 2026-04-01 Epub Date: 2026-04-06 DOI:10.1016/j.swevo.2026.102381
Danjing Wang , Bin Xin , Jingyu Zhang , Qing Wang , Jia Zhang
{"title":"Instance-driven evolution of constructive heuristic ensemble for the stochastic resource allocation problem with time windows","authors":"Danjing Wang ,&nbsp;Bin Xin ,&nbsp;Jingyu Zhang ,&nbsp;Qing Wang ,&nbsp;Jia Zhang","doi":"10.1016/j.swevo.2026.102381","DOIUrl":null,"url":null,"abstract":"<div><div>This paper investigates the stochastic resource allocation problem with time windows (SRA-TW), which is widely encountered in complex systems. In SRA-TW, the assignment of each resource to each task is limited within a time window, and the task completion is described by a time-dependent success probability, aiming to maximize the total expected reward of tasks. To address diverse SRA-TW scenarios, an efficient and general-purpose solving method is urgently needed. We propose an ensemble of multiple constructive heuristics (CHs), which preserves the computational efficiency of individual CHs and exploits their complementarity for superior overall performance. A three-level instance-driven evolution framework (IDEF) is further proposed, where intractable SRA-TW instances guide the adaptive evolution of the ensemble. At the bottom level, a radial-basis-function-network-based CH (RCH) is designed to construct a decision scheme for each instance rapidly, ensuring feasibility through incremental handling of temporal constraints. At the medium level, an evolutionary meta-optimization algorithm (EMOA) is proposed to simultaneously search for an ensemble of RCHs (E-RCH) capable of solving multiple instances. At the top level, intractable instances are iteratively exploited to drive the EMOA to generate new RCHs. By integrating these RCHs and refining them using historical instances, the E-RCH is progressively enhanced in generalization. Experimental results indicate that the E-RCHs built via IDEF can quickly construct decision schemes with higher expected rewards across various test instances, outperforming state-of-the-art algorithms for related problems.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"104 ","pages":"Article 102381"},"PeriodicalIF":8.5000,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S221065022600101X","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/4/6 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

This paper investigates the stochastic resource allocation problem with time windows (SRA-TW), which is widely encountered in complex systems. In SRA-TW, the assignment of each resource to each task is limited within a time window, and the task completion is described by a time-dependent success probability, aiming to maximize the total expected reward of tasks. To address diverse SRA-TW scenarios, an efficient and general-purpose solving method is urgently needed. We propose an ensemble of multiple constructive heuristics (CHs), which preserves the computational efficiency of individual CHs and exploits their complementarity for superior overall performance. A three-level instance-driven evolution framework (IDEF) is further proposed, where intractable SRA-TW instances guide the adaptive evolution of the ensemble. At the bottom level, a radial-basis-function-network-based CH (RCH) is designed to construct a decision scheme for each instance rapidly, ensuring feasibility through incremental handling of temporal constraints. At the medium level, an evolutionary meta-optimization algorithm (EMOA) is proposed to simultaneously search for an ensemble of RCHs (E-RCH) capable of solving multiple instances. At the top level, intractable instances are iteratively exploited to drive the EMOA to generate new RCHs. By integrating these RCHs and refining them using historical instances, the E-RCH is progressively enhanced in generalization. Experimental results indicate that the E-RCHs built via IDEF can quickly construct decision schemes with higher expected rewards across various test instances, outperforming state-of-the-art algorithms for related problems.
带时间窗随机资源分配问题的建设性启发式集成实例驱动演化
研究了复杂系统中普遍存在的带时间窗的随机资源分配问题。在SRA-TW中,每个资源分配给每个任务的时间限制在一个时间窗口内,任务的完成用与时间相关的成功概率来描述,目的是使任务的总期望回报最大化。为了解决各种SRA-TW场景,迫切需要一种高效、通用的求解方法。我们提出了多个建设性启发式(CHs)的集合,它保留了单个CHs的计算效率,并利用它们的互补性来获得更好的整体性能。进一步提出了一个三层实例驱动进化框架(IDEF),其中棘手的SRA-TW实例指导集成的自适应进化。在底层,设计了基于径向基函数网络的决策方案(RCH),为每个实例快速构建决策方案,通过增量处理时间约束来确保决策方案的可行性。在中等层次上,提出了一种进化元优化算法(EMOA),用于同时搜索能够求解多个实例的rch集合(E-RCH)。在顶层,迭代地利用难以处理的实例来驱动EMOA生成新的rch。通过整合这些rch并使用历史实例对其进行改进,E-RCH在泛化方面逐步得到增强。实验结果表明,通过IDEF构建的E-RCHs可以在不同的测试实例中快速构建具有更高期望回报的决策方案,优于当前相关问题的最先进算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Swarm and Evolutionary Computation
Swarm and Evolutionary Computation COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCEC-COMPUTER SCIENCE, THEORY & METHODS
CiteScore
16.00
自引率
12.00%
发文量
169
期刊介绍: Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书