Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery
https://orcid.org/https://orcid.org/0000-0003-0076-8602
https://orcid.org/https://orcid.org/0000-0002-0126-007X
https://orcid.org/https://orcid.org/0000-0003-2231-7861
Crowdshipping is a revolutionary concept of the sharing economy. In this study, two carriers are used to perform the following expedition: the truck starts from the depot to complete part of the deliveries, shares part of the load with the crowdshipper at the relay point, and the private driver selected as the crowdshipper continues from that point onward. This study proposes the two-echelon open vehicle routing problem with crowdshipping (2EOVRP-CS) and formulates a mathematical model to determine the crowdshipper, parcel relay location, truck route, and crowdsource route. A tangible nested genetic algorithm (NGA) is proposed, and its efficiency is demonstrated by comparison with CPLEX and genetic algorithm (GA). A real case study is investigated in Xi’an city to test the applicability of the proposed model. The results show that using crowdshipping instead of truck delivery alone can save approximately 14% of the total cost and 26% of truck vehicle miles traveled (VMT). Moreover, several sensitivity analyses are performed. The results show that crowdshipping is sensitive to the detour limit and the time value of carriers. For the detour limit, after the acceptable detour distance increases by 8%, the total cost can be reduced by up to 5.94%.
The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery
https://orcid.org/https://orcid.org/0000-0003-0076-8602
https://orcid.org/https://orcid.org/0000-0002-0126-007X
https://orcid.org/https://orcid.org/0000-0003-2231-7861
Crowdshipping is a revolutionary concept of the sharing economy. In this study, two carriers are used to perform the following expedition: the truck starts from the depot to complete part of the deliveries, shares part of the load with the crowdshipper at the relay point, and the private driver selected as the crowdshipper continues from that point onward. This study proposes the two-echelon open vehicle routing problem with crowdshipping (2EOVRP-CS) and formulates a mathematical model to determine the crowdshipper, parcel relay location, truck route, and crowdsource route. A tangible nested genetic algorithm (NGA) is proposed, and its efficiency is demonstrated by comparison with CPLEX and genetic algorithm (GA). A real case study is investigated in Xi’an city to test the applicability of the proposed model. The results show that using crowdshipping instead of truck delivery alone can save approximately 14% of the total cost and 26% of truck vehicle miles traveled (VMT). Moreover, several sensitivity analyses are performed. The results show that crowdshipping is sensitive to the detour limit and the time value of carriers. For the detour limit, after the acceptable detour distance increases by 8%, the total cost can be reduced by up to 5.94%.
The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery
https://orcid.org/https://orcid.org/0000-0003-0076-8602
https://orcid.org/https://orcid.org/0000-0002-0126-007X
https://orcid.org/https://orcid.org/0000-0003-2231-7861
Crowdshipping is a revolutionary concept of the sharing economy. In this study, two carriers are used to perform the following expedition: the truck starts from the depot to complete part of the deliveries, shares part of the load with the crowdshipper at the relay point, and the private driver selected as the crowdshipper continues from that point onward. This study proposes the two-echelon open vehicle routing problem with crowdshipping (2EOVRP-CS) and formulates a mathematical model to determine the crowdshipper, parcel relay location, truck route, and crowdsource route. A tangible nested genetic algorithm (NGA) is proposed, and its efficiency is demonstrated by comparison with CPLEX and genetic algorithm (GA). A real case study is investigated in Xi’an city to test the applicability of the proposed model. The results show that using crowdshipping instead of truck delivery alone can save approximately 14% of the total cost and 26% of truck vehicle miles traveled (VMT). Moreover, several sensitivity analyses are performed. The results show that crowdshipping is sensitive to the detour limit and the time value of carriers. For the detour limit, after the acceptable detour distance increases by 8%, the total cost can be reduced by up to 5.94%.
The Two Echelon Open Vehicle Routing Problem: Optimization of Crowdshipping Based Parcel Delivery
KSCE J Civ Eng
Wu, Xue (Autor:in) / Hu, Dawei (Autor:in) / Ma, Bingshan (Autor:in) / Jiang, Ruisen (Autor:in)
KSCE Journal of Civil Engineering ; 26 ; 4073-4085
01.09.2022
13 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Potential last-mile impacts of crowdshipping services: a simulation-based evaluation
| Online Contents | 2019
The effect of trust on the choice for crowdshipping services
| Elsevier | 2023