SMF-GA: Optimized Multitask Allocation Algorithm in Urban Crowdsourced Transportation

Abstract

Urban crowdsourced transportation, which can solve traffic problem within city, is a new scenario where citizens share vehicles to take passengers and packages while driving. Differing from the traditional location based crowdsourcing system (e.g., crowdsensing system), the task has to be completed with visiting two different locations (i.e., start and end points), so task allocation algorithms in crowdsensing cannot be leveraged in urban crowdsourced transportation directly. To solve this problem, we first prove that maximizing the crowdsourcing system’s profit (i.e., maximizing the total saved distance) is an NP-hard problem. We propose a heuristic greedy algorithm called Saving Most First (SMF) which is simple and effective in assigning tasks. Then, an optimized SMF based genetic algorithm (SMF-GA) is devised to jump out of the local optimal result. Finally, we demonstrate the performance of SMF and SMF-GA with extensive evaluations, based on a large scale real vehicle traces. The evaluation with large scale real dataset indicates that both SMF and SMF-GA algorithms outperform other benchmark algorithms in terms of saved distance, participant profits, etc.

Truthful Profit Maximization Mechanisms for Mobile Crowdsourcing

“…Algorithmic game theory has become a useful method to build incentive auctions in the crowdsourcing system due to the strategic behavior of workers. Yaron [5] is the first person who studied the budget-constraint mechanism design which then became the major category of auctions for crowdsourcing auction design, i.e., [6][7][8][9][10][11][12][13][14][15][16][17]. In particular, Yaron proposed a method for provable guarantee auctions in crowdsourcing markets with fixed budget [7].…”