Two-echelon vehicle routing problems: A literature review

Sluijk, Natasja; Florio, Alexandre M.; Kinable, Joris; Dellaert, Nico; Woensel, Tom Van

doi:10.1016/j.ejor.2022.02.022

Cited by 76 publications

(27 citation statements)

References 89 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The connection is also strong with the Two-Echelon VRP (Crainic et al, 2009), in which large vehicles transfer goods to smaller vehicles at so-called satellites, the later ones being allowed to deliver to the customer in a restricted delivery area. We refer the interested reader to Cuda et al (2015) and Sluijk et al (2022). Nonetheless, as in other routing problems with intermediate facilities (Guastaroba et al, 2016), the purpose of those is to concentrate the flows.…”

Section: Related Classes Of Problemsmentioning

confidence: 99%

Small and large neighborhood search for the park-and-loop routing problem with parking selection

Colleter

Dumez

Lehuédé

et al. 2023

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Related Classes Of Problemsmentioning

confidence: 99%

Small and large neighborhood search for the park-and-loop routing problem with parking selection

Colleter

Dumez

Lehuédé

et al. 2023

European Journal of Operational Research

View full text Add to dashboard Cite

“…To solve it, a heuristic based on Clarke and Wright and a Variable Neighborhood Search (VNS) are presented. For supplementary information on 2E-VRP refer to [ 8].…”

Section: Literature Reviewmentioning

confidence: 99%

The Grey Zone Two-Echelon Vehicle Routing Problem with Customer-to-Parcel Locations and Low-Pollution Vehicles for Inner-City Logistics

Silva Russi,

Labadie,

Prodhon

2023

Lecture Notes in Operations Research

View full text Add to dashboard Cite

This study addresses the two-echelon vehicle routing problem with grey zones and Customer-to-Parcel (C2P) stations. This problem arises in the search for new sustainable delivery schemes for e-commerce and last-mile distribution in urban areas and aims at reducing last-mile transportation costs. This study proposes a literature review on the subject, and a mixed integer linear programming (MILP) formulation to model and solve small instances of the described problem.

show abstract

“…Mühlbauer and Fontaine [19] adopted swap containers for solving 2E-CVRP, where the frst echelon's requests are fulflled by a set of vans and the second echelon's requests are serviced by a set of cargo bicycles or city freighters provided by the logistic companies. Various studies were collected and summarized in the review of 2EVRP variants by Sluijk et al [20]. It can be seen that the existing literature has rarely considered heterogeneous vehicles, and so far, only Yu et al [17] have introduced occasional drivers to 2EVRP with covering locations.…”

Section: Literature Reviewmentioning

confidence: 99%

The Two-Echelon Vehicle Routing Problem with Transshipment Nodes and Occasional Drivers: Formulation and Adaptive Large Neighborhood Search Heuristic

Nguyen

Putra

et al. 2022

Journal of Advanced Transportation

View full text Add to dashboard Cite

This research introduces a new variant of the two-echelon vehicle routing problem (2EVRP) called the two-echelon vehicle routing problem with transshipment nodes and occasional drivers (2EVRP-TN-OD). In addition to city freighters in the second-echelon network, a set of occasional drivers (ODs) is available to serve customers. ODs are the basis of a crowd-shipping system in which crowds with planned trips are willing to take detours to deliver packages in exchange for some compensation. To serve customers, ODs collect the assigned packages at either satellite served by first-echelon trucks or transshipment nodes served by city freighters. We formulate this problem as a mixed-integer nonlinear programming model and develop an adaptive large neighborhood search (ALNS) to solve it. New problem-specific destroy and repair operators and a tailored local search procedure are embedded into ALNS to deal with the problem’s unique characteristics. The experiments show that the proposed ALNS effectively solves 2EVRP-TN-OD by outperforming Gurobi in terms of both solution quality and computational time. Moreover, the experiments confirm that employing occasional drivers leads to lower operational costs. Sensitivity analyses on the characteristics of occasional drivers and the impact of transshipment nodes are presented as interesting managerial insights from 2EVRP-TN-OD.

show abstract

Two-echelon vehicle routing problems: A literature review

Cited by 76 publications

References 89 publications

Small and large neighborhood search for the park-and-loop routing problem with parking selection

Small and large neighborhood search for the park-and-loop routing problem with parking selection

The Grey Zone Two-Echelon Vehicle Routing Problem with Customer-to-Parcel Locations and Low-Pollution Vehicles for Inner-City Logistics

The Two-Echelon Vehicle Routing Problem with Transshipment Nodes and Occasional Drivers: Formulation and Adaptive Large Neighborhood Search Heuristic

Contact Info

Product

Resources

About