Hyper-heuristic algorithm for traffic flow-based vehicle routing problem with simultaneous delivery and pickup

Hyper-heuristic algorithm for traffic flow-based vehicle routing problem with simultaneous delivery and pickup

Authors: Wang, Zheng; Liu, Jinlong; Zhang, Jingling

Journal of Computational Design and Engineering - 2023 Volume 10, Pages 2271-2287

Abstract To address the realistic problem of seriously reducing distribution efficiency and increasing distribution cost caused by road traffic congestion, this paper constructs a time-dependent speed describing vehicle travel speed and road traffic flow by simulating the change of urban traffic flow, to establish a vehicle route problem model considering traffic flow with distribution cost and customer satisfaction as optimization objectives. To solve this problem, a hyper-heuristic algorithm based on tabu search is designed in this paper, in which the underlying search operator is selected more efficiently by a high-level heuristic strategy. In addition, the correctness of the model and the effectiveness of the algorithm are verified by conducting simulation experiments on several benchmark sets. Experiment results are shown as the travel speed of the vehicle increases, the average customer satisfaction in lc1-type instances increases to 0.94. And the impact of urban traffic changes on logistics costs and customer satisfaction is further analyzed.

https://doi.org/10.1093/jcde/qwad097

Cite as:

 @article{Wang_2023, title={Hyper-heuristic algorithm for traffic flow-based vehicle routing problem with simultaneous delivery and pickup}, volume={10}, ISSN={2288-5048}, url={http://dx.doi.org/10.1093/jcde/qwad097}, DOI={10.1093/jcde/qwad097}, number={6}, journal={Journal of Computational Design and Engineering}, publisher={Oxford University Press (OUP)}, author={Wang, Zheng and Liu, Jinlong and Zhang, Jingling}, year={2023}, month=oct, pages={2271–2287} }



    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