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

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static-preview.hindawi.com/articles/wcmc/volume-2019/8035167/figures/8035167.fig.007a.svgz" name="8035167.fig.007a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>CDF plot of task executer’s profit</td></tr><tr class="fig-image" id="b"><td><object data="https://static-preview.hindawi.com/articles/wcmc/volume-2019/8035167/figures/8035167.fig.007b.svgz" name="8035167.fig.007b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>Saved distance between SMF-GA and EA</td></tr><tr class="fig-image" id="c"><td><object data="https://static-preview.hindawi.com/articles/wcmc/volume-2019/8035167/figures/8035167.fig.007c.svgz" name="8035167.fig.007c" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(c) </b>Logarithmic complexity between SMF-GA and EA</td></tr></table>

<div>Results of user enthusiasm and computational complexity.</div>

Wireless Communications and Mobile Computing

fig7

Figure 7

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