Title | Variable speed multi-task allocation for mobile crowdsensing based on a multi-objective shuffled frog leaping algorithm |
Author | |
Corresponding Author | Guo,Yinan |
Publication Years | 2022-09-01
|
DOI | |
Source Title | |
ISSN | 1568-4946
|
EISSN | 1872-9681
|
Volume | 127 |
Abstract | In multi-task studies of mobile crowdsensing, the possibility that a user may adopt another travel mode when completing the current task to the next is ignored. In addition, existing methods tend to allocate more tasks to the users with high reputation, which causes that few tasks will be assigned to new users with low reputation. In order to cover these shortages, a constrained multi-objective optimization model of variable speed multi-task allocation is established, which aims to maximize the user rewards and minimize the task completion time simultaneously. Meanwhile, the maximum number of fully paid tasks positively correlated with reputation is set for each user. To solve the constructed model, a three-stage multi-objective shuffled frog leaping algorithm is proposed, which introduces an objective anchored hybrid initialization operator based on heuristic information, a region mining strategy for the archive individuals, a discrete leaping rule to enhance the interaction of individual information and a constraint handling operator to reduce the loss of individual information. The performance of the proposed algorithm is evaluated by comparing it with five state-of-the-art algorithms on both real-world and synthetic instances. Experimental results show that the proposed algorithm can find a set of Pareto optimal allocation solutions with better convergence and distributions. |
Keywords | |
URL | [Source Record] |
Indexed By | |
Language | English
|
SUSTech Authorship | Others
|
Funding Project | National Natural Science Foundation of China[61502239];National Natural Science Foundation of China[61973305];National Natural Science Foundation of China[62002148];Natural Science Foundation of Jiangsu Province[BK20150924];
|
WOS Research Area | Computer Science
|
WOS Subject | Computer Science, Artificial Intelligence
; Computer Science, Interdisciplinary Applications
|
WOS Accession No | WOS:000861216300011
|
Publisher | |
EI Accession Number | 20223112469028
|
EI Keywords | Constrained optimization
; Constraint handling
; Pareto principle
|
ESI Classification Code | Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory:721.1
; Optimization Techniques:921.5
; Systems Science:961
|
ESI Research Field | COMPUTER SCIENCE
|
Scopus EID | 2-s2.0-85135101350
|
Data Source | Scopus
|
Citation statistics |
Cited Times [WOS]:1
|
Document Type | Journal Article |
Identifier | http://kc.sustech.edu.cn/handle/2SGJ60CL/365034 |
Department | Southern University of Science and Technology |
Affiliation | 1.B-DAT,CICAEET,School of Automation,Nanjing University of Information Science and Technology,Nanjing,210044,China 2.Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation,Southern University of Science and Technology,Shenzhen,518055,China 3.School of Electromechanical and Information Engineering,China University of Mining and Technology (Beijing),Beijing,100083,China 4.School of Information and Control Engineering,China University of Mining and Technology,Xuzhou,221116,China |
Recommended Citation GB/T 7714 |
Shen,Xiaoning,Chen,Qingzhou,Pan,Hongli,et al. Variable speed multi-task allocation for mobile crowdsensing based on a multi-objective shuffled frog leaping algorithm[J]. APPLIED SOFT COMPUTING,2022,127.
|
APA |
Shen,Xiaoning,Chen,Qingzhou,Pan,Hongli,Song,Liyan,&Guo,Yinan.(2022).Variable speed multi-task allocation for mobile crowdsensing based on a multi-objective shuffled frog leaping algorithm.APPLIED SOFT COMPUTING,127.
|
MLA |
Shen,Xiaoning,et al."Variable speed multi-task allocation for mobile crowdsensing based on a multi-objective shuffled frog leaping algorithm".APPLIED SOFT COMPUTING 127(2022).
|
Files in This Item: | There are no files associated with this item. |
|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment