arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.01018math.OC
收藏

利用经济型辅助任务加速求解昂贵调度问题

Accelerate Solving Expensive Scheduling by Leveraging Economical Auxiliary Tasks

Minshuo Li, Bo Liu, Bin Xin, Liang Feng, Peng Li

AI总结:

本文通过构建基于作业重要性采样的经济型辅助任务、利用析因设计确定采样比例以及提取作业优先级作为可迁移不变量并结合部分解修补策略,显著提升了进化多任务算法求解昂贵置换流水车间调度问题的性能。

摘要:

为了充分利用多任务优化范式加速求解昂贵调度问题,本研究有效解决了三个关键问题。首要问题是识别与原始昂贵任务高度相似的辅助任务。我们提出了一种基于作业重要性的采样策略,通过从昂贵任务的完整问题规格矩阵中提取关键行来构建一个紧凑矩阵。该矩阵作为一个经济型辅助任务。在数学上,我们证明了该经济型辅助任务与其对应的昂贵任务具有相似性。第二个问题围绕如何使辅助任务更具成本效益。我们通过析因设计实验确定了完整问题规格矩阵的采样比例,从而得到更紧凑的辅助任务。由于搜索空间更小且函数评估时间更短,它能够快速为主任务提供高质量的可迁移信息。最后一个方面涉及设计来自辅助任务的可迁移深层信息。我们将经济型辅助任务的(次)优解中的作业优先级视为可迁移不变量。通过采用部分解修补策略,我们在共性知识上增强了特异性知识,以适应目标昂贵任务。所设计的用于构建任务对和促进知识迁移的策略,在融入各种进化多任务算法后,被用于求解置换流水车间调度的昂贵实例。大量实验和统计比较验证了在这些策略的协同作用下,进化多任务算法在处理昂贵调度任务时的性能得到了显著提升。

英文摘要:

To fully leverage the multi-task optimization paradigm for accelerating the solution of expensive scheduling problems, this study has effectively tackled three vital concerns. The primary issue is identifying auxiliary tasks that closely resemble the original expensive task. We suggested a sampling strategy based on job importance, creating a compact matrix by extracting crucial rows from the entire problem specification matrix of the expensive task. This matrix serves as an economical auxiliary task. Mathematically, we proved that this economical auxiliary task bears similarity to its corresponding expensive task. The subsequent concern revolves around making auxiliary tasks more cost-effective. We determined the sampling proportions for the entire problem specification matrix through factorial design experiments, resulting in a more compact auxiliary task. With a reduced search space and shorter function evaluation time, it can rapidly furnish high-quality transferable information for the primary task. The last aspect involves designing transferable deep information from auxiliary tasks. We regarded the job priorities in the (sub-) optimal solutions to the economical auxiliary task as transferable invariants. By adopting a partial solution patching strategy, we augmented specificity knowledge onto the common knowledge to adapt to the target expensive task. The strategies devised for constructing task pairs and facilitating knowledge transfer, when incorporated into various evolutionary multitasking algorithms, were utilized to address expensive instances of permutation flow shop scheduling. Extensive experiments and statistical comparisons have validated that, with the collaborative synergy of these strategies, the performance of evolutionary multitasking algorithms is significantly enhanced in handling expensive scheduling tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑