基于分解的动态多目标进化算法求解测试任务调度问题

Hui Lu, Xin Xu, Mengmeng Zhang, Lijuan Yin
{"title":"基于分解的动态多目标进化算法求解测试任务调度问题","authors":"Hui Lu, Xin Xu, Mengmeng Zhang, Lijuan Yin","doi":"10.1109/ICICIP.2015.7388136","DOIUrl":null,"url":null,"abstract":"Test task scheduling problem in the dynamic environment (DTTSP) is an important issue in automatic test system. In this paper, a dynamic multi-objective evolutionary algorithm based on decomposition (DMOEA/D) is proposed to improve the adaptability of the environment changes in test process. The mathematical model considering the arrival of dynamic tasks is proposed based on the Markov decision process. Three standard test functions and two DTTSP examples are used in experiment for illustrating the performance of the proposed algorithm. The results show that the proposed algorithm has good performance in convergence and diversity. Almost all the performance metrics of convergence and diversity obtain stable statistical results. The result of convergence ratio of an algorithm is not good as other metrics because of the slow convergence rate. The results also show that the solutions obtained by DMOEA/D have better Pareto front than the dynamic multi-objective particle swarm optimization algorithm (DMOPSO).","PeriodicalId":265426,"journal":{"name":"2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Dynamic multi-objective evolutionary algorithm based on decomposition for test task scheduling problem\",\"authors\":\"Hui Lu, Xin Xu, Mengmeng Zhang, Lijuan Yin\",\"doi\":\"10.1109/ICICIP.2015.7388136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Test task scheduling problem in the dynamic environment (DTTSP) is an important issue in automatic test system. In this paper, a dynamic multi-objective evolutionary algorithm based on decomposition (DMOEA/D) is proposed to improve the adaptability of the environment changes in test process. The mathematical model considering the arrival of dynamic tasks is proposed based on the Markov decision process. Three standard test functions and two DTTSP examples are used in experiment for illustrating the performance of the proposed algorithm. The results show that the proposed algorithm has good performance in convergence and diversity. Almost all the performance metrics of convergence and diversity obtain stable statistical results. The result of convergence ratio of an algorithm is not good as other metrics because of the slow convergence rate. The results also show that the solutions obtained by DMOEA/D have better Pareto front than the dynamic multi-objective particle swarm optimization algorithm (DMOPSO).\",\"PeriodicalId\":265426,\"journal\":{\"name\":\"2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICIP.2015.7388136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Sixth International Conference on Intelligent Control and Information Processing (ICICIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICIP.2015.7388136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

动态环境下的测试任务调度问题是自动测试系统中的一个重要问题。为了提高测试过程中对环境变化的适应性,提出了一种基于分解的动态多目标进化算法(DMOEA/D)。基于马尔可夫决策过程,提出了考虑动态任务到达的数学模型。实验中使用了三个标准测试函数和两个DTTSP示例来说明该算法的性能。结果表明,该算法具有良好的收敛性和多样性。几乎所有的收敛性和多样性性能指标都得到稳定的统计结果。由于算法的收敛速度较慢,其收敛率的结果不如其他指标。结果还表明,与动态多目标粒子群优化算法(DMOPSO)相比,DMOEA/D算法得到的解具有更好的Pareto front。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic multi-objective evolutionary algorithm based on decomposition for test task scheduling problem
Test task scheduling problem in the dynamic environment (DTTSP) is an important issue in automatic test system. In this paper, a dynamic multi-objective evolutionary algorithm based on decomposition (DMOEA/D) is proposed to improve the adaptability of the environment changes in test process. The mathematical model considering the arrival of dynamic tasks is proposed based on the Markov decision process. Three standard test functions and two DTTSP examples are used in experiment for illustrating the performance of the proposed algorithm. The results show that the proposed algorithm has good performance in convergence and diversity. Almost all the performance metrics of convergence and diversity obtain stable statistical results. The result of convergence ratio of an algorithm is not good as other metrics because of the slow convergence rate. The results also show that the solutions obtained by DMOEA/D have better Pareto front than the dynamic multi-objective particle swarm optimization algorithm (DMOPSO).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信