Loading…
Multi-hop driver-parcel matching problem with time windows
Crowdsourced shipping can result in significant economic and social benefits. For a shipping company, it has a potential cost advantage and creates opportunities for faster deliveries. For the society, it can provide desirable results by reducing congestion and air pollution. Despite the great poten...
Saved in:
Published in: | Flexible services and manufacturing journal 2018-09, Vol.30 (3), p.517-553 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Crowdsourced shipping can result in significant economic and social benefits. For a shipping company, it has a potential cost advantage and creates opportunities for faster deliveries. For the society, it can provide desirable results by reducing congestion and air pollution. Despite the great potential, crowdsourced shipping is not well studied. With the aim of using the spare capacities along the existing transportation flows of the crowd to deliver small-to-medium freight volumes, this paper defines the multi-driver multi-parcel matching problem and proposes a general ILP formulation, which incorporates drivers’ maximum detour, capacity limits, and the option of transferring parcels between drivers. Due to the high computational complexity, we develop two heuristics to solve the problem. The numerical study shows that crowdsourced shipping can be an economic viable and sustainable option, depending on the spatial characteristics of the network and drivers’ schedules. Furthermore, the added benefits increase with an increasing number of participating drivers and parcels. |
---|---|
ISSN: | 1936-6582 1936-6590 |
DOI: | 10.1007/s10696-016-9273-3 |