Dual learning based Pareto evolutionary algorithm for a kind of multi-objective task assignment problem

IF 7.5 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Expert Systems with Applications Pub Date : 2025-03-13 DOI:10.1016/j.eswa.2025.127006
Zuocheng Li , Qinglong Du , Bin Qian , Rong Hu , Meiling Xu
{"title":"Dual learning based Pareto evolutionary algorithm for a kind of multi-objective task assignment problem","authors":"Zuocheng Li ,&nbsp;Qinglong Du ,&nbsp;Bin Qian ,&nbsp;Rong Hu ,&nbsp;Meiling Xu","doi":"10.1016/j.eswa.2025.127006","DOIUrl":null,"url":null,"abstract":"<div><div>The task assignment problem (TAP) involves assigning a set of tasks to a set of agents subject to the processing capacity of each agent. The objective is to minimize the total assignment cost and total communication cost. This paper focuses on a special kind of multi-objective TAP (MOTAP). MOTAP differs from TAP in that it optimizes the total cost and agent load balance. MOTAP has many real-life applications and is however NP-hard. To solve the problem, a dual learning-based Pareto evolutionary algorithm (DLPEA) is proposed. The primary highlights of this work are two-fold: a new mathematical model of MOTAP and a dual learning-based search model of DLPEA. For the mathematical model, we propose the MOTAP model for the first time and a problem-specific repair method for infeasible solutions. For the search framework, a statistical learning method with shift-based density estimation is proposed to evaluate the convergence and diversity of the population, enabling the selection of high-quality individuals. We additionally present a probability learning mechanism with a clustering technique to extract valuable information about elite individuals based on which meaningful population can be predicted. Results of experiments on 180 benchmark instances show that the proposed algorithm competes favorably with state-of-the-art methods.</div></div>","PeriodicalId":50461,"journal":{"name":"Expert Systems with Applications","volume":"276 ","pages":"Article 127006"},"PeriodicalIF":7.5000,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Expert Systems with Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0957417425006281","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

The task assignment problem (TAP) involves assigning a set of tasks to a set of agents subject to the processing capacity of each agent. The objective is to minimize the total assignment cost and total communication cost. This paper focuses on a special kind of multi-objective TAP (MOTAP). MOTAP differs from TAP in that it optimizes the total cost and agent load balance. MOTAP has many real-life applications and is however NP-hard. To solve the problem, a dual learning-based Pareto evolutionary algorithm (DLPEA) is proposed. The primary highlights of this work are two-fold: a new mathematical model of MOTAP and a dual learning-based search model of DLPEA. For the mathematical model, we propose the MOTAP model for the first time and a problem-specific repair method for infeasible solutions. For the search framework, a statistical learning method with shift-based density estimation is proposed to evaluate the convergence and diversity of the population, enabling the selection of high-quality individuals. We additionally present a probability learning mechanism with a clustering technique to extract valuable information about elite individuals based on which meaningful population can be predicted. Results of experiments on 180 benchmark instances show that the proposed algorithm competes favorably with state-of-the-art methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
Expert Systems with Applications
Expert Systems with Applications 工程技术-工程:电子与电气
CiteScore
13.80
自引率
10.60%
发文量
2045
审稿时长
8.7 months
期刊介绍: Expert Systems With Applications is an international journal dedicated to the exchange of information on expert and intelligent systems used globally in industry, government, and universities. The journal emphasizes original papers covering the design, development, testing, implementation, and management of these systems, offering practical guidelines. It spans various sectors such as finance, engineering, marketing, law, project management, information management, medicine, and more. The journal also welcomes papers on multi-agent systems, knowledge management, neural networks, knowledge discovery, data mining, and other related areas, excluding applications to military/defense systems.
期刊最新文献
SR_ColorNet: Multi-path attention aggregated and mask enhanced network for the super resolution and colorization of panchromatic image MLK-Net: Leveraging multi-scale and large kernel convolutions for robust skin lesion segmentation Dual learning based Pareto evolutionary algorithm for a kind of multi-objective task assignment problem Radiologist-inspired Symmetric Local–Global Multi-Supervised Learning for early diagnosis of pneumoconiosis Editorial Board
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1