2019
DOI: 10.1109/access.2019.2950442
|View full text |Cite
|
Sign up to set email alerts
|

Last Mile Delivery With Stochastic Travel Times Considering Dual Services

Abstract: Nowadays there are two prevailing delivery modes in the last mile delivery; one is the home delivery (HD) that vehicles deliver parcels to customers' homes; and the other is the customers' pickup (CP) that vehicle deliver parcels to some kind of intelligent express boxes where customers can pick up their parcels with free time. This article studies a green vehicle routing problem considering dual services (HD and CP) with stochastic travel times (GVRP-DS-STT) to provide customers with sustainable and diversifi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 25 publications
(17 citation statements)
references
References 37 publications
0
17
0
Order By: Relevance
“…Jiang et al [14] consider a similar last-mile delivery problem and aim to reduce the total costs and carbon emissions, their model is a variant of the traveling salesman problem. Zhou et al [15] study a green VRP considering dual last-mile delivery services with stochastic travel times. However, both of them do not consider the prediction problem with multivariate data.…”
Section: Last-mile Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…Jiang et al [14] consider a similar last-mile delivery problem and aim to reduce the total costs and carbon emissions, their model is a variant of the traveling salesman problem. Zhou et al [15] study a green VRP considering dual last-mile delivery services with stochastic travel times. However, both of them do not consider the prediction problem with multivariate data.…”
Section: Last-mile Problemmentioning
confidence: 99%
“…Assuming there are p = 5 features, and the nodes-vehicles pair is (15, 3) in which further entry is a total number of customers and the latter is the number of total drivers. The customer demand is random generated as d i = [24,20,20,25,24,13,16,20,25,25,16,17,22,19,15] and vehicle capacity vector is Q = [94, 108, 100] . We generate customers' positions in a 100*100 region and suppose the initial deport is situated in the central position.…”
Section: Experimental Designmentioning
confidence: 99%
“…It has become an indispensable part of daily life. Taking the terminal distribution in university campus as an example, almost every logistics service firm has its service dot and serves for faculties' delivery demands [8].…”
Section: Terminal Distributionmentioning
confidence: 99%
“…e innovative VRP applications and distribution modes contribute to efficiency improvement of express delivery [3,6]. e double service including home delivery and customers' pick-up are taken into consideration during the VRP optimization [7,8]. Zhou [9] developed a novel nonlinear programming model to assist logistics managers to find an optimal integrated location-routing solution by an improved GA algorithm, and the numerical case showed that it can improve the efficiency of last mile delivery by the formulated model.…”
Section: Introductionmentioning
confidence: 99%
“…Genetic algorithm (abbreviated form GA) has the advantage of fast convergence in solving NP-hard problems, so it has become an important method for solving vehicle routing problems [28][29][30][31]. In order to verify the effectiveness of IFFO, the paper compares the solution results of FFO, IFFO, and GA and draws the distribution route map of the three algorithms.…”
Section: Performance Analysis Of Iffomentioning
confidence: 99%