2016
DOI: 10.1057/jors.2015.90
|View full text |Cite
|
Sign up to set email alerts
|

Solving the vehicle routing problem with lunch break arising in the furniture delivery industry

Abstract: 5In this paper we solve the Vehicle Routing Problem with Lunch Break (VRPLB) which arises when drivers must take pauses during their shift, for example, for lunch breaks. Driver breaks have already been considered in long haul transportation when drivers must rest during their travel, but the underlying optimization problem remains difficult and few contributions can be found for These results demonstrate the importance of integrating drivers pauses in the resolution process.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 28 publications
(6 citation statements)
references
References 34 publications
0
5
0
Order By: Relevance
“…Routing Electric vehicle routing [87,91,92]; routing with drones [94,99];routing with time windows [10,93]; multimodal delivery [89]; crowd navigation [85]; automated vehicle routing [84]; routing with lunch breaks [90]; other routing problems [83,86,95] 14…”
Section: Operational Optimization 21mentioning
confidence: 99%
“…Routing Electric vehicle routing [87,91,92]; routing with drones [94,99];routing with time windows [10,93]; multimodal delivery [89]; crowd navigation [85]; automated vehicle routing [84]; routing with lunch breaks [90]; other routing problems [83,86,95] 14…”
Section: Operational Optimization 21mentioning
confidence: 99%
“…Several researchers, [39][40][41][42][43][44][45][46][47] to name a few, have developed different heuristics to solve last mile delivery problems in different contexts. For instance, Gunawan [39] and Isler et al [46] developed Genetic Algorithms (GA) to solve a last mile delivery problem in smart cities and in automotive parts distribution problem respectively.…”
Section: Last Mile Delivery Problemmentioning
confidence: 99%
“…The problem was formulated as a mixed-integer program model that maximizes customers' coverage and minimizes the total time spent by the couriers and the total earliness and lateness penalty. To solve large-scale problem instances, an insertion-based two-phase heuristic was developed and a tabu search improvement procedure was adopted afterwards.Some researchers such as Schneider et al[42] and Coelho et al[43] developed heuristics to solve the delivery problem when vehicles have intermediate stops or pauses in their routes. The former authors in [42] developed an adaptive variable neighborhood search heuristic which combines ideas of variable neighbor search and adaptive large neighborhood search when vehicles have stopping requirements at intermediate facilities to replenish the goods to be delivered or to unload collected goods.…”
mentioning
confidence: 99%
“…One of the first works explicitly considering breaks and night rests within a vehicle routing context is presented by Savelsbergh and Sol (1998) who consider a compulsory 45 min lunch break between 11.00 h and 14.00 h and a night rest between any two working days. More recently, vehicle routing problems with break requirements have been studied in Beaudry et al (2010), Wen et al (2011), Parragh et al (2012, Coelho et al (2016).…”
Section: State-of-the-artmentioning
confidence: 99%