The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems

Li, Hongqi; Zhang, Lu; Lv, Tan; Chang, Xinyu

doi:10.1016/j.trb.2016.09.012

Cited by 51 publications

(18 citation statements)

References 45 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Grangier et al [28] considered integrated constraints (e.g., time windows, synchronization, multiple trips) in the second echelon and proposed an ALNS to solve the problem. Li et al [37] adopted Clarke and Wright's savings heuristic algorithm, and further improved through a local search phase.…”

Section: Two-echelon Vehicle Routing Problemmentioning

confidence: 99%

A branch-and-price algorithm for two-echelon electric vehicle routing problem

Zhang

2021

Complex Intell. Syst.

View full text Add to dashboard Cite

Motivated by express and e-commerce companies’ distribution practices, we study a two-echelon electric vehicle routing problem. In this problem, fuel-powered vehicles are used to transport goods from a depot to intermediate facilities (satellites) in the first echelon, whereas electric vehicles, which have limited driving ranges and need to be recharged at recharging stations, are used to transfer goods from the satellites to customers in the second echelon. We model the problem as an arc flow model and decompose the model into a master problem and pricing subproblem. We propose a branch-and-price algorithm to solve it. We use column generation to solve the restricted master problem to provide lower bounds. By enumerating all the subsets of the satellites, we generate feasible columns by solving the elementary shortest path problem with resource constraints in the first echelon. Then, we design a bidirectional labeling algorithm to generate feasible routes in the second echelon. Comparing the performance of our proposed algorithm with that of CPLEX in solving a set of small-sized instances, we demonstrate the former’s effectiveness. We further assess our algorithm in solving two sets of larger scale instances. We also examine the impacts of some model parameters on the solution.

show abstract

Section: Two-echelon Vehicle Routing Problemmentioning

confidence: 99%

A branch-and-price algorithm for two-echelon electric vehicle routing problem

Zhang

2021

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…Here, we introduce the deterministic/random start customer node selection strategies that can be used in GetStartCustomerNode. The deterministic start customer node selection strategy is the one we obtain the start customer node with the minimum latest service time (similar to (Li et al 2016)), while in the random start customer node selection strategy, the start visiting customer node from the customer nodes set is chosen randomly to maintain the diversity of solutions.…”

Section: Algorithm 1 Construction Heuristicmentioning

confidence: 99%

Two-echelon urban deliveries using autonomous vehicles

Puchinger

Sun

2020

Transportation Research Part E: Logistics and Transportation Re

View full text Add to dashboard Cite

We introduce a two-echelon urban delivery problem with second-level unmanned vehicles. This problem typically applies for delivering parcels or other small commodities to pedestrianized areas such as campuses or residential clusters. To model the proposed vehicle routing problem, we introduce a mixed-integer program. We further propose construction heuristics and a hybrid metaheuristic approach with backtracking for solving larger instances. A sensitivity analysis for vehicle speed combinations reveals that increasing small autonomous vehicle (SAV) speeds has only very limited effects on cost. We therefore recommend to keep SAV speeds rather low because of a more pedestrian friendly environment in practical implementations.

show abstract

“…The CW saving algorithm combined with the local search algorithm was widely adopted to solve various types of routing problems in the literature (Lai [49], Zhang [50], and Li [51]).…”

Section: Cw Algorithmmentioning

confidence: 99%

A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway

Lang

et al. 2019

Sustainability

View full text Add to dashboard Cite

Sustainable development of transport systems is a common topic of concern and effort in multiple countries, in which reducing carbon emissions is one of the core goals. Multimodal transport is an effective way to achieve carbon emission reduction and to efficiently utilize transport resources. The intercontinental transport system, represented by the Euro–China Expressway, is a prominent exploration that has recently received attention, which promotes the sustainable development of transport between countries and carbon emission reduction. In the intercontinental multimodal transport system, the reasonable connection of roads and railways, especially the optimization of consolidation, is an important link which affects the system's carbon emissions. This paper focuses on the consolidation of sustainable multimodal transport and summarizes the multimodal transport two-echelon location-routing problem with consolidation (MT-2E-LRP-C). We aim to solve multimodal consolidation optimization problem, especially locations of multimodal station, by routing of highway and railway. We propose a two-layer mixed integer linear problem (MILP) model, which highlights the consolidation of roads and railways, focuses on road and rail transport connections, and optimizes road routes and railway schemes. To validate the MT-2E-LRP-C model, we design a series of random instances for different quantities of nodes. In order to solve large-scale instances and realistic transport problems, we propose a hybrid differential evolution algorithm, which decomposes the problem into a railway layer and a highway layer for heuristic algorithm solving. Furthermore, the MILP model and algorithm are tested by small-scale random instances, and the hybrid differential evolution algorithm is solved for the large-scale random instances. Finally, we solve the realist instance from the Euro–China Expressway to develop instructive conclusions.

show abstract

The two-echelon time-constrained vehicle routing problem in linehaul-delivery systems

Cited by 51 publications

References 45 publications

A branch-and-price algorithm for two-echelon electric vehicle routing problem

A branch-and-price algorithm for two-echelon electric vehicle routing problem

Two-echelon urban deliveries using autonomous vehicles

A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro–China Expressway

Contact Info

Product

Resources

About