ADMM-based problem decomposition scheme for vehicle routing problem with time windows

Yao, Yu; Zhu, Xiaoning; Dong, Hongyu; Wu, Shengnan; Wu, Hai‐Long; Lu, Tong; Zhou, Xuesong

doi:10.1016/j.trb.2019.09.009

Cited by 88 publications

(32 citation statements)

References 54 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boyd et al [61] proposed that the ADMM was applied to large-scale distributed convex optimization problems. Yao et al [54] suggested that the ADMM could solve the multi-VRP and examined the performance of the proposed approach using classical Solomon VRP benchmark instances. Using an ALR approach, Yang et al [62] iteratively solved a logistics VRP with mixed backhauls and time windows in a block nonlinear Gauss-Seidel framework.…”

Section: Solution Methods For the Proposed Optimization Modelmentioning

confidence: 99%

“…Mahmoudi and Zhou [53] proposed a time-space-state transportation network to formulate a VRP with pickup and delivery time windows (VRPPDTW), which has subsequently been applied to address other variants of the VRP. Yao et al [54] proposed high-dimensional state-space-time network representations for VRPTW in urban logistics, not considering the pickup requests of backhaul customers. Shang et al [55] proposed a space-time-state hypernetwork-based assignment approach to deal with passenger flow state estimation in an urban rail transit network.…”

Section: Space-time-state Networkmentioning

confidence: 99%

See 1 more Smart Citation

Equity‐oriented vehicle routing optimization for catering distribution services with timeliness requirements

Wang

Yang

Yao

et al. 2021

IET Intelligent Trans Sys

Self Cite

View full text Add to dashboard Cite

The rapid development in the catering services and urban logistics industries has significantly promoted the prosperity of business-to-consumer (B2C) e-commerce urban logistics distribution, which is gaining increasing interest from food producers, distribution platforms, and consumers. Unlike traditional logistics supply chains, catering distribution services have strong timeliness and consideration of delivery delay. Traditional distribution platforms usually group commodities by their origins or destinations and then transport each group with one logistics vehicle. However, for a logistics distribution area with limited commodities, the vehicle capacity cannot be fully utilized if one vehicle can only transport commodities with the same origin or destination. Therefore, a mixed-load strategy is proposed in which commodities with different origins or destinations in a distribution area could be transported by the same vehicle to improve vehicle capacity utilization. A mixed-load strategy would further cause delivery sequencing problems, leading to different delivery delays for customers. This study proposed an equity-oriented vehicle routing problem for food distribution services with timeliness requirements considering a mixed-loading strategy and vehicle capacity constraints. For the above problem, a multi-commodity flow optimization model was constructed for the equity-oriented vehicle routing problem and a mixed-load strategy based on a time-discretized space-time-state network representation. An augmented Lagrangian relaxation approach was utilized to reformulate the original model and thus effectively solve the proposed model. Furthermore, the augmented Lagrangian model was decomposed and linearized into a series of shortest path searching subproblems and iteratively solved by a dynamic programming algorithm using an alternating direction method of multipliers (ADMM)-based solution framework. Finally, the proposed model and solution approaches were tested on numerous networks.

show abstract

Section: Solution Methods For the Proposed Optimization Modelmentioning

confidence: 99%

Section: Space-time-state Networkmentioning

confidence: 99%

Equity‐oriented vehicle routing optimization for catering distribution services with timeliness requirements

Wang

Yang

Yao

et al. 2021

IET Intelligent Trans Sys

Self Cite

View full text Add to dashboard Cite

show abstract

“…more than 30% in Meng and Zhou (2014). To improve the primal feasibility of Lagrangian relaxation, the alternating direction method of multipliers (ADMM) has recently been applied in Yao et al (2019) for the vehicle-routing problem, and in Zhang et al (2019b) for the train-timetabling problem. Compared with Lagrangian relaxation, ADMM improves both the primal and dual feasibility, thus reducing the optimality gap and also the required number of iterations.…”

Section: Relevant Studiesmentioning

confidence: 99%

“…Thus, the quadratic terms in the objective function ( 17) are linearized. A similar linearization method can also be found in Yao et al (2019). After we have linearized and revised the quadratic terms in Objective Function ( 17), the whole model P A can be decomposed into a series of subproblems.…”

Section: Optimization Framework Based On Admmmentioning

confidence: 99%

Train rescheduling in a major disruption on a high-speed railway network with seat reservation

Shou-yi

Wong

Shang

et al. 2021

Transportmetrica A: Transport Science

View full text Add to dashboard Cite

In this paper, we develop a method of real-time train rescheduling on double-track high-speed railway lines undergoing major disruption. As a result, trains approaching the disrupted area cannot use the blocked tracks and must be efficiently rescheduled. As most tracks in a high-speed railway station can be shared by trains arriving from both directions, we reschedule both inbound and outbound trains simultaneously by allowing them to share sidings. Based on a space-time network, an integer linear programming (ILP) model is formulated to minimize the train-deviation cost. As the ILP model is difficult to solve for real-world problems, we decompose it into many easy-to-solve subproblems by the alternating direction method of multipliers (ADMM) algorithm. Our model is tested on an abstract representation of the Chinese high-speed railway system to illustrate both the benefit of rescheduling trains in both directions simultaneously and the efficiency of the ADMM algorithm in train rescheduling.

show abstract

“…This industry generates more than 400,000 new jobs and is projected to continue to grow until 2022 (Huang et al, 2019). In China, the logistics industry has shown significant growth in recent years, and it ranks first place among forty-five developing industries worldwide (Yao et al, 2019). One of the problems in the logistics industry is the Vehicle Routing Problem (VRP) (Putri, 2016).…”

Section: Introductionmentioning

confidence: 99%

The vehicle routing problem for perishable goods: A systematic review

et al. 2020

View full text Add to dashboard Cite

Vehicle Routing Problem (VRP) is the problem for finding optimal routes in the distribution system, and this problem needs attention because it can improve distribution performance. One of the problems in VRP is the Vehicle Routing Problem for Perishable Goods (VRPfPG). This issue addresses VRP for products that are rapidly losing quality and perishable. This paper attempts to review the Vehicle Routing Problem for Perishable Goods (VRPfPG). A systematic review has been carried out on fifty-nine (59) published papers from 2001 to March 2020. The optimization methods in this review were classified into single and multi-objective problems. In addition, the review was also conducted based on the objective function. The results show the metaheuristic algorithm to be a popular optimization method for solving single and multi-objective problems. Further, the results also show that minimizing the total cost distribution to be the objective function that was often used by researchers. Finally, future studies are suggested to explore a more comprehensive investigation in the VRPfPG.

show abstract

ADMM-based problem decomposition scheme for vehicle routing problem with time windows

Cited by 88 publications

References 54 publications

Equity‐oriented vehicle routing optimization for catering distribution services with timeliness requirements

Equity‐oriented vehicle routing optimization for catering distribution services with timeliness requirements

Train rescheduling in a major disruption on a high-speed railway network with seat reservation

The vehicle routing problem for perishable goods: A systematic review

Contact Info

Product

Resources

About