Collaborative Vehicle Routing Problem in the Urban Ring Logistics Network under the COVID-19 Epidemic

ABSTRACT

This paper explored the problem of collaborative vehicle routing in the urban ring logistics network (Co-VRP-URLN) during the COVID-19 epidemic. According to the characteristics of urban distribution and the restriction of traffic all over China during this period, this study mainly considers a common distribution mode of order exchange through the outer ring of the city and then solves the vehicle routing problem of distribution, which belongs to a special multidepot vehicle routing problem with time windows. According to the definition of the problem, the corresponding mixed-integer programming problem of multicommodity flow is established, and the variable neighborhood search algorithm is designed in detail to solve it. The effectiveness of the algorithm is verified by a standard example, and the benefits of joint distribution are revealed through the improved standard example. At last, the influence of different distribution centers is compared. The results show that this model can significantly improve the distribution efficiency within the city under the restriction of traffic. [ FROM AUTHOR] Copyright of Mathematical Problems in Engineering is the property of Hindawi Limited and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full . (Copyright applies to all s.)