Correlation-aware constrained many-objective service composition in crowdsourcing design

IF 9.9 1区 工程技术 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Advanced Engineering Informatics Pub Date : 2025-05-01 Epub Date: 2025-02-12 DOI:10.1016/j.aei.2025.103173
Gui Li , Renbin Xiao
{"title":"Correlation-aware constrained many-objective service composition in crowdsourcing design","authors":"Gui Li ,&nbsp;Renbin Xiao","doi":"10.1016/j.aei.2025.103173","DOIUrl":null,"url":null,"abstract":"<div><div>With the development of social productivity, crowdsourcing design, a new service-oriented innovative design model emerged. The optimal selection of service resources in crowdsourcing design has a great impact on the quality of task implementation and consumer satisfaction. Unlike the previous research, this paper models and solves the problem from the perspective of constrained many-objective optimization. Firstly, a constrained 6-objective combination optimization model is constructed according to the characteristics of service resources in crowdsourcing design. Secondly, a variety of correlation categories and correlation forms of services are considered. It is not limited to the correlation between two services but rather correlations between any number of services. In order to improve search efficiency, a multi-objective service pruning (MOSP) method based on efficient non-dominated sorting (ENS) is used to reduce the decision space. The new constraint strategy handles complex constraints, and a correlation-aware local search strategy is proposed to deal with correlations between services. The results of comparison experiments prove the superiority of the proposed method in solving the constrained correlation-aware many-objective service composition problem.</div></div>","PeriodicalId":50941,"journal":{"name":"Advanced Engineering Informatics","volume":"65 ","pages":"Article 103173"},"PeriodicalIF":9.9000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Engineering Informatics","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1474034625000667","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/2/12 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

With the development of social productivity, crowdsourcing design, a new service-oriented innovative design model emerged. The optimal selection of service resources in crowdsourcing design has a great impact on the quality of task implementation and consumer satisfaction. Unlike the previous research, this paper models and solves the problem from the perspective of constrained many-objective optimization. Firstly, a constrained 6-objective combination optimization model is constructed according to the characteristics of service resources in crowdsourcing design. Secondly, a variety of correlation categories and correlation forms of services are considered. It is not limited to the correlation between two services but rather correlations between any number of services. In order to improve search efficiency, a multi-objective service pruning (MOSP) method based on efficient non-dominated sorting (ENS) is used to reduce the decision space. The new constraint strategy handles complex constraints, and a correlation-aware local search strategy is proposed to deal with correlations between services. The results of comparison experiments prove the superiority of the proposed method in solving the constrained correlation-aware many-objective service composition problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
众包设计中关联感知约束多目标服务组合
随着社会生产力的发展,众包设计,一种新的服务型创新设计模式应运而生。众包设计中服务资源的最优选择对任务执行质量和消费者满意度有很大影响。与以往的研究不同,本文从约束多目标优化的角度对问题进行建模和求解。首先,根据众包设计中服务资源的特点,构建了约束的六目标组合优化模型;其次,考虑了服务的各种关联类别和关联形式。它不局限于两个服务之间的相关性,而是任何数量的服务之间的相关性。为了提高搜索效率,采用基于高效非支配排序(ENS)的多目标服务修剪(MOSP)方法减小决策空间。新的约束策略处理复杂的约束,并提出了一种关联感知的局部搜索策略来处理服务之间的相关性。对比实验结果证明了该方法在解决约束关联感知的多目标服务组合问题上的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Advanced Engineering Informatics
Advanced Engineering Informatics 工程技术-工程:综合
CiteScore
12.40
自引率
18.20%
发文量
292
审稿时长
45 days
期刊介绍: Advanced Engineering Informatics is an international Journal that solicits research papers with an emphasis on 'knowledge' and 'engineering applications'. The Journal seeks original papers that report progress in applying methods of engineering informatics. These papers should have engineering relevance and help provide a scientific base for more reliable, spontaneous, and creative engineering decision-making. Additionally, papers should demonstrate the science of supporting knowledge-intensive engineering tasks and validate the generality, power, and scalability of new methods through rigorous evaluation, preferably both qualitatively and quantitatively. Abstracting and indexing for Advanced Engineering Informatics include Science Citation Index Expanded, Scopus and INSPEC.
期刊最新文献
Synergistic in-domain and out-of-domain learning to strengthen visual scene understanding in data-scarce, imbalanced construction settings Span entropy: A novel time series complexity measurement with a redesigned phase space reconstruction Collaborative planning model for mixed traffic flow in bottleneck zones considering compliance and the impact of human-driven vehicles A method for safety risk dynamic assessment in flight cockpit intelligent human-machine interaction Multi-objective differential evolution algorithm based on partial reinforcement learning intelligence for engineering design problems and physics-informed neural networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1