A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods

Authors: Wu, Yao; Zheng, Bin; Zhou, Xueliang

IEEE Access - 2020 Volume 8, Pages 189614-189631

© 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.In delivering perishable goods, certain unexpected disruptive events may cause the initial routing scheme to be infeasible. A new routing scheme must be generated quickly to alleviate delivery disturbances. According to the idea of disruption management, a disruption recovery model with a distinctive type of split delivery is developed for inter-route recourse based on an initial time-dependent vehicle routing model with time windows, which synthesizes the perishable nature of delivered goods and dynamic travel route choice in urban road networks. Then, a tabu search algorithm is proposed to solve the initial routing problem and further extended to generate the disruption recovery plan. Three computational experiments on the instances adapted from Solomon’s and Gehring and Homberger’s benchmark problems are conducted to illustrate the effectiveness of the proposed model and algorithm. Supplementary data associated with this article can be found at https://www.amazon.com/clouddrive/share/foL0Vfo5C0G UjTrdO2UwljhZ9j6nNnHcD2Q0bKCTXJS.

https://doi.org/10.1109/ACCESS.2020.3032018

Cite as:

@article{Wu_2020,
	doi = {10.1109/access.2020.3032018},
	url = {https://doi.org/10.1109%2Faccess.2020.3032018},
	year = 2020,
	publisher = {Institute of Electrical and Electronics Engineers ({IEEE})},
	volume = {8},
	pages = {189614--189631},
	author = {Yao Wu and Bin Zheng and Xueliang Zhou},
	title = {A Disruption Recovery Model for Time-Dependent Vehicle Routing Problem With Time Windows in Delivering Perishable Goods},
	journal = {{IEEE} Access}
}



    Leave a Reply

    Your email address will not be published. Required fields are marked *

    x
    This site uses cookies to make navigation simple and efficient. By continuing you declare that you want to automatically accept the privacy policy. More. Close