亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

An efficient algorithm for task allocation with the budget constraint

计算机科学 任务(项目管理) 约束(计算机辅助设计) 预算约束 数学优化 算法 人工智能 数学 管理 新古典经济学 经济 几何学
作者
Qinyuan Li,Minyi Li,Quoc Bao Vo,Ryszard Kowalczyk
出处
期刊:Expert Systems With Applications [Elsevier BV]
卷期号:210: 118279-118279 被引量:8
标识
DOI:10.1016/j.eswa.2022.118279
摘要

This paper studies a heterogeneous task allocation problem with the budget constraint. Existing works on task allocation mainly tackle this well-known NP-hard problem from an optimisation perspective. They have not been able to cater to the extra needs of scalability and robustness in large-scale systems. Furthermore, some general allocation mechanisms do not consider system budget and agent cost. Thus, they can not guarantee to obtain valid solutions when the budget is constrained. This paper models the task allocation problem as a game whose players are the agents to be assigned to the teams working on the tasks, and align the task allocation objective (i.e., system optimality) with the game-theoretic solution concept of Nash equilibrium. Based on this formulation, a novel algorithm, called CF , is proposed in this paper. CF searches for a valid Nash equilibrium solution using a greedy strategy that aims to improve system utility while takes into consideration of the overall system budget constraint. CF is a scalable, anytime, and monotonic algorithm, which in turn, makes it robust for the deployment in large-scale systems. CF can also be used as a local search algorithm for improving the quality of any existing valid allocation solution. Comprehensive empirical studies have been carried out in this paper to demonstrate that CF is effective in all budget states and achieves a solution quality better than the state-of-the-art algorithms. • The objective in task allocation is aligned with Nash equilibrium in game theory. • The proposed algorithm can be used as a local search algorithm. • The proposed algorithm guarantees the return of a valid Nash equilibrium solution. • The proposed algorithm is an “anytime” and “monotonic” algorithm. • The proposed algorithm is computationally efficient and highly scalable.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
紫熊完成签到,获得积分10
36秒前
49秒前
我的文献呢完成签到 ,获得积分10
56秒前
李爱国应助郭伟采纳,获得10
1分钟前
1分钟前
郭伟发布了新的文献求助10
1分钟前
1分钟前
1分钟前
赘婿应助科研通管家采纳,获得10
1分钟前
FashionBoy应助lty采纳,获得10
2分钟前
多亿点完成签到 ,获得积分10
2分钟前
科研通AI5应助宋雨航采纳,获得10
2分钟前
2分钟前
2分钟前
2分钟前
sowhat完成签到 ,获得积分10
2分钟前
SciGPT应助简单的雅蕊采纳,获得10
2分钟前
3分钟前
3分钟前
lty发布了新的文献求助10
3分钟前
大模型应助Ying采纳,获得20
3分钟前
3分钟前
3分钟前
吗喽完成签到 ,获得积分10
3分钟前
4分钟前
nav完成签到 ,获得积分10
4分钟前
yi完成签到 ,获得积分10
4分钟前
yi完成签到 ,获得积分10
4分钟前
4分钟前
4分钟前
WerWu完成签到,获得积分10
5分钟前
5分钟前
5分钟前
5分钟前
汉堡包应助爱撒娇的曼凝采纳,获得10
5分钟前
5分钟前
科研通AI2S应助科研通管家采纳,获得10
5分钟前
小蘑菇应助科研通管家采纳,获得10
5分钟前
科研通AI2S应助科研通管家采纳,获得10
5分钟前
6分钟前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Technical Brochure TB 814: LPIT applications in HV gas insulated switchgear 1000
Immigrant Incorporation in East Asian Democracies 600
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
A Preliminary Study on Correlation Between Independent Components of Facial Thermal Images and Subjective Assessment of Chronic Stress 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3968504
求助须知:如何正确求助?哪些是违规求助? 3513278
关于积分的说明 11167234
捐赠科研通 3248678
什么是DOI,文献DOI怎么找? 1794386
邀请新用户注册赠送积分活动 875030
科研通“疑难数据库(出版商)”最低求助积分说明 804638