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

Algorithm 1

The algorithm.

Input: The planned route set and the to-do task set

, all routes’ and tasks’ corresponding attributes.

Output: The tuple

1: Initialize the saved distance matrix between all routes and tasks according to (8)

2: while   and   do

3: for   to size() do

4: Find the th highest saved distance value from the matrix, and get the

corresponding planned route and to-do task

5: if    then

6: Select , and assign to

7:

8: Remove from

9: if    then

10: Remove from

11: end  if

12: Jump out of the loop

13: end  if

14: end  for

15: Update saved distance matrix

16: end  while

17: return