Fair Task Allocation in Crowdsourced Delivery

07/09/2018
by   Fuat Basık, et al.
0

Faster and more cost-efficient, crowdsourced delivery is needed to meet the growing customer demands of many industries, including online shopping, on-demand local delivery, and on-demand transportation. The power of crowdsourced delivery stems from the large number of workers potentially available to provide services and reduce costs. It has been shown in social psychology literature that fairness is key to ensuring high worker participation. However, existing assignment solutions fall short on modeling the dynamic fairness metric. In this work, we introduce a new assignment strategy for crowdsourced delivery tasks. This strategy takes fairness towards workers into consideration, while maximizing the task allocation ratio. Since redundant assignments are not possible in delivery tasks, we first introduce a 2-phase allocation model that increases the reliability of a worker to complete a given task. To realize the effectiveness of our model in practice, we present both offline and online versions of our proposed algorithm called F-Aware. Given a task-to-worker bipartite graph, F-Aware assigns each task to a worker that minimizes unfairness, while allocating tasks to use worker capacities as much as possible. We present an evaluation of our algorithms with respect to running time, task allocation ratio (TAR), as well as unfairness and assignment ratio. Experiments show that F-Aware runs around 10^7 x faster than the TAR-optimal solution and allocates 96.9 it. Moreover, it is shown that, F-Aware is able to provide a much fair distribution of tasks to workers than the best competitor algorithm.

READ FULL TEXT
research
06/14/2018

Online Variant of Parcel Allocation in Last-mile Delivery

We investigate the problem of last-mile delivery, where a large pool of ...
research
05/27/2015

Fair task allocation in transportation

Task allocation problems have traditionally focused on cost optimization...
research
05/09/2018

Self-Stabilizing Task Allocation In Spite of Noise

We study the problem of distributed task allocation inspired by the beha...
research
07/09/2020

Intelligent Warehouse Allocator for Optimal Regional Utilization

In this paper, we describe a novel solution to compute optimal warehouse...
research
10/13/2018

Maximizing Clearance Rate of Reputation-aware Auctions in Mobile Crowdsensing

Auctions have been employed as an effective framework for the management...
research
02/11/2021

Fair Robust Assignment using Redundancy

We study the consideration of fairness in redundant assignment for multi...
research
04/22/2022

Some Optimization Solutions for Relief Distribution

Humanitarian logistics remain a challenging area of application for oper...

Please sign up or login with your details

Forgot password? Click here to reset