2021
DOI: 10.1016/j.trb.2020.11.012
|View full text |Cite
|
Sign up to set email alerts
|

A large neighborhood search approach to the vehicle routing problem with delivery options

Abstract: To reduce delivery failures in last mile delivery, several types of delivery options have been proposed in the past twenty years. Still, customer satisfaction is a challenge because a single location is chosen independently of the time at which customers will be delivered. In addition, delivery in shared locations such as lockers and shops also experience failure due to capacity or opening-time issues at the moment of delivery. To address this issue and foster consolidation in shared delivery points, we invest… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
50
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
3
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 68 publications
(50 citation statements)
references
References 63 publications
0
50
0
Order By: Relevance
“…The authors model the problem with MILP formulations and present a Savings based heuristic to solve a real-world instance with 12 customers. Dumez et al [4] present the vehicle routing problem with delivery options, a VRP with time windows in which several delivery options such as home, work place, locker, or car trunk are considered. The customers define their delivery preferences by ordering the options.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The authors model the problem with MILP formulations and present a Savings based heuristic to solve a real-world instance with 12 customers. Dumez et al [4] present the vehicle routing problem with delivery options, a VRP with time windows in which several delivery options such as home, work place, locker, or car trunk are considered. The customers define their delivery preferences by ordering the options.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In their heuristics solution method, customer requests are assigned to routes based on a set of rules, and subsequently, a traveling salesman problem is solved for each of these routes. Dumez et al (2021a) also focus on different delivery locations for customers and recently introduced the vehicle routing problem with delivery options (VRPDO). In this problem, each customer can specify a number of delivery options along with a preference value.…”
Section: Related Literaturementioning
confidence: 99%
“…Zhou et al (2018) consider a two-echelon vehicle routing problem (2E-VRP), where deliveries are routed through an intermediate capacitated satellite depot. Similar to Dumez et al (2021a) and Sitek and Wikarek (2019), they assume that customers can provide different delivery options, such as receiving their parcels at their home or picking them up at an intermediate pick up facility. To solve this problem, Zhou et al (2018) propose a hybrid multi-population genetic algorithm that is tested on real-world and artificial instances.…”
Section: Related Literaturementioning
confidence: 99%
See 1 more Smart Citation
“…Scholars have conducted extensive research on it from different perspectives since the first proposition of this issue was put by Dantizg and Rams in 1959. 1 These scholars are Gutierrez et al, 2 Errico et al, 3 Xuping et al, 4 Yaming et al, 5 Sacramento et al, 6 Belgin et al, 7 Fink et al, 8 Li et al, 9 Xue et al, 10 Timo, 11 Wang et al, 12 Hoogeboom et al 13 Rostami et al, 14 Uit het Broek et al, 15 Hoogeboom et al, 13 Dumez et al, 16 Zhang et al, 17 Pessoa et al, 18 and so on. However, most of these studies consider how to reduce the total cost of distribution from the view of economy.…”
Section: Introductionmentioning
confidence: 99%