Danjing Wang , Bin Xin , Jingyu Zhang , Qing Wang , Jia Zhang
{"title":"带时间窗随机资源分配问题的建设性启发式集成实例驱动演化","authors":"Danjing Wang , Bin Xin , Jingyu Zhang , Qing Wang , 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":"{\"title\":\"Instance-driven evolution of constructive heuristic ensemble for the stochastic resource allocation problem with time windows\",\"authors\":\"Danjing Wang , Bin Xin , Jingyu Zhang , Qing Wang , 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}","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}
Instance-driven evolution of constructive heuristic ensemble for the stochastic resource allocation problem with time windows
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.
期刊介绍:
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.