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.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
秃头沙师弟完成签到,获得积分10
1秒前
1秒前
糖糖发布了新的文献求助10
2秒前
明理熠彤完成签到,获得积分10
2秒前
奶龙王完成签到,获得积分10
3秒前
3秒前
MZ完成签到,获得积分10
4秒前
hdf发布了新的文献求助10
5秒前
vvyuaan完成签到,获得积分10
5秒前
gu发布了新的文献求助10
5秒前
sci完成签到,获得积分10
7秒前
包容春天完成签到,获得积分10
8秒前
Orange的应助被lxt采纳,获得10
9秒前
专注的背包完成签到,获得积分10
9秒前
青青发布了新的文献求助10
9秒前
微风完成签到 ,获得积分10
10秒前
HH完成签到,获得积分10
10秒前
风吹麦浪发布了新的文献求助30
12秒前
12秒前
12秒前
科研通AI6.2的应助被糖糖采纳,获得10
12秒前
xianle完成签到,获得积分10
14秒前
guojunjie完成签到,获得积分10
14秒前
个性向卉发布了新的文献求助10
15秒前
15秒前
diu完成签到,获得积分10
16秒前
16秒前
16秒前
繁荣的瑛的应助被hdf采纳,获得10
18秒前
刘刘刘完成签到,获得积分10
18秒前
张毛毛完成签到 ,获得积分10
19秒前
菜鸟学习发布了新的文献求助10
19秒前
Qiaoqiao完成签到,获得积分10
19秒前
XZ发布了新的文献求助10
19秒前
20秒前
花灯王子发布了新的文献求助10
20秒前
21秒前
端庄的萝完成签到 ,获得积分10
21秒前
21秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1700
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
八旗制度の研究 600
高分子基功能界面水蒸发材料与应用研究 500
外场增强的水汽发电研究 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8187210
求助须知:如何正确求助?哪些是违规求助? 9575379
关于积分的说明 21840916
捐赠科研通 7784939
什么是DOI,文献DOI怎么找? 3434935
关于科研通互助平台的介绍 2559340
邀请新用户注册赠送积分活动 2481793