Two-echelon vehicle routing problem with time windows and mobile satellites

Li, Hongqi; Wang, Haotian; Chen, Jun; Bai, Ming

doi:10.1016/j.trb.2020.05.010

Cited by 104 publications

(32 citation statements)

References 50 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, a multiproduct vehicle routing problem with time windows (MPVRPTW) [35] is formulated when delivery tasks with several products are conducted by a single DC. A basic two-echelon multidepot vehicle routing problem (2E-MDVRP) [36] can be described as an extension of a two-echelon vehicle routing problem with time windows (2E-VRPTW) [37]. Both of them focus on optimizing the vehicle routes in the first-and secondechelon logistics networks to achieve certain objectives (e.g., minimizing logistics operating costs and maximizing customer satisfaction).…”

Section: Relevant Solution Methods For the 2e-cmdpdtwmentioning

confidence: 99%

“…Research on PDP, MDVRPTW, and their variants established an optimization model with a single objective to optimize the logistics network, especially to minimize the cost, waiting time of customers, and number of transportation tools of the network [31,37,45]. However, compared with the optimization model with a single objective, the optimization model with multiobjective can evaluate the efficiency of the logistics network effectively to better optimize the logistics network [47].…”

Section: Relevant Solution Methods For the 2e-cmdpdtwmentioning

confidence: 99%

See 1 more Smart Citation

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

Luo

Wang

Tang

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

Resource sharing within a logistics network offers an effective way to solve problems resulting from inefficient and costly operations of individual logistics facilities. However, the existing analysis of resource sharing and profit allocation is still limited. Therefore, this study aims to model resource sharing in two-echelon delivery and pickup logistics networks to improve the overall efficiency and decrease the total network operating cost. A bi-objective integer programming model is first proposed for two-echelon collaborative multidepot pickup and delivery problems with time windows (2E-CMDPDTW) to seek the minimization of operating costs and number of vehicles. Integrating a customer clustering algorithm, a greedy algorithm, and an improved nondominated sorting genetic algorithm-II (Im-NSGA-II), a hybrid method is then designed to handle the 2E-CMDPDTW model. The customer clustering and the greedy algorithms are employed to generate locally optimized initial solutions to accelerate the calculating velocity and guarantee the diversity of feasible solutions. The Im-NSGA-II combines the order crossover operation and the polynomial mutation process to find the optimal solution of the 2E-CMDPDTW. The comparative results show that the proposed hybrid method outperforms the NSGA-II and the multiobjective genetic algorithm. Furthermore, a Shapley value method is used for allocating total profits of established alliances and finding an optimal coalition sequence of the logistics facilities joining alliances based on the strictly monotonic path strategy. Finally, a case study of 2E-CMDPDTW in Chongqing China is conducted to validate the feasibility. Results indicate that this study contributes to long-term partnerships between logistics facilities within multi-echelon logistics networks in practice and contributes to the long-term sustainability of urban logistics pickup and delivery networks’ development.

show abstract

Section: Relevant Solution Methods For the 2e-cmdpdtwmentioning

confidence: 99%

Section: Relevant Solution Methods For the 2e-cmdpdtwmentioning

confidence: 99%

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

Luo

Wang

Tang

et al. 2021

Journal of Advanced Transportation

View full text Add to dashboard Cite

show abstract

“…They suggested a MIP formulation and tackled the problem with combination of an initial Clarke-and-Wright savings heuristic and a local search. Li et al (2020b) studied another variant of the 2E-VRPTW with mobile satellites. The first echelon involves vans and the second echelon involves unmanned aerial vehicles (UAV).…”

Section: Literature Reviewmentioning

confidence: 99%

A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows

Marquès

Sadykov

Deschamps

et al. 2022

Transportation Science

View full text Add to dashboard Cite

The paper studies the two-echelon capacitated vehicle routing problem with time windows, in which delivery of freight from depots to customers is performed using intermediate facilities called satellites. We consider the variant of the problem with precedence constraints for unloading and loading freight at satellites. In this variant allows for storage and consolidation of freight at satellites. Thus, the total transportation cost may decrease in comparison with the alternative variant with exact freight synchronization at satellites. We suggest a mixed integer programming formulation for the problem with an exponential number of route variables and an exponential number of precedence constraints that link first-echelon and second-echelon routes. Routes at the second echelon connecting satellites and clients may consist of multiple trips and visit several satellites. A branch-cut-and-price algorithm is proposed to solve efficiently the problem. This is the first exact algorithm in the literature for the multi-trip variant of the problem. We also present a postprocessing procedure to check whether the solution can be transformed to avoid freight consolidation and storage without increasing its transportation cost. It is shown that all single-trip literature instances solved to optimality admit optimal solutions of the same cost for both variants of the problem either with precedence constraints or with exact synchronization constraints. Experimental results reveal that our algorithm can be used to solve these instances significantly faster than another recent approach proposed in the literature.

show abstract

“…Inspired by the method used in Li et al (2020), we derive the computational formula to simplify the disposal of the first-echelon network as follows. For the i th customer delivered from a dummy satellite j (or route j), we introduce a variable T S j i to represent the maximum duration for the first-echelon vehicle that can postpone to arrive at satellite j related to customer i's time window:…”

Section: Solution Representationmentioning

confidence: 99%

“…Dellaert et al (2019Dellaert et al ( , 2021 proposed a branch-and-price-based algorithm. Li et al (2020) introduced a two-echelon vehicle routing problem with time windows and mobile satellites (2E-VRP-TM) and proposed an Adaptive Large Neighborhood Search (ALNS) to solve it.…”

Section: Introductionmentioning

confidence: 99%

Two-echelon vehicle routing problem with time windows and simultaneous pickup and delivery

et al. 2022

View full text Add to dashboard Cite

In this paper, we propose a tabu search algorithm for the two-echelon vehicle routing problem with time windows and simultaneous pickup and delivery (2E-VRPTWSPD), which is a new variant of the two-echelon vehicle routing problem (2E-VRP) by considering the time window constraints and simultaneous pickup and delivery. In 2E-VRPTW SPD, the pickup and delivery activities are performed simultaneously by the same vehicles through the depot to satellites in the first echelon and satellites to customers in the second echelon, where each customer has a specified time window. To solve this problem, firstly, we formulate the problem with a mathematical model. Then, we implement a variable neighborhood tabu search algorithm with the proposed solution representation of dummy satellites to solve largescale instances. Dummy satellites time windows are used in our algorithm to speed up the algorithm. Finally, we generate two instance sets based on the existing 2E-VRP and 2E-VRPTW benchmark sets and conduct additional experiments to analyze the performance of our algorithm.Keywords Two-echelon vehicle routing problem • time windows • pickup and delivery • tabu search

show abstract

Two-echelon vehicle routing problem with time windows and mobile satellites

Cited by 104 publications

References 50 publications

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

Two-Echelon Multidepot Logistics Network Design with Resource Sharing

A Branch-Cut-and-Price Approach for the Single-Trip and Multi-Trip Two-Echelon Vehicle Routing Problem with Time Windows

Two-echelon vehicle routing problem with time windows and simultaneous pickup and delivery

Contact Info

Product

Resources

About