A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows
投稿时间:2018-06-27  
英文关键词:Petrol truck routing problem, Heuristic algorithm, Valid inequalities, Time windows
基金项目:This work was part of the Program of “Study on Optimization and Supply-side Reliability of Oil Product Supply Chain Logistics System” funded under the National Natural Science Foundation of China, Grant Number 51874325. The authors are grateful to all study participants.
作者单位
Bohong Wang National Engineering Laboratory for Pipeline Safety/ Beijing Key Laboratory of Urban Oil and Gas Distribution Technology, China University of Petroleum, Beijing 102249, People’s Republic of China 
Yongtu Liang National Engineering Laboratory for Pipeline Safety/ Beijing Key Laboratory of Urban Oil and Gas Distribution Technology, China University of Petroleum, Beijing 102249, People’s Republic of China 
Meng Yuan National Engineering Laboratory for Pipeline Safety/ Beijing Key Laboratory of Urban Oil and Gas Distribution Technology, China University of Petroleum, Beijing 102249, People’s Republic of China 
Haoran Zhang National Engineering Laboratory for Pipeline Safety/ Beijing Key Laboratory of Urban Oil and Gas Distribution Technology, China University of Petroleum, Beijing 102249, People’s Republic of China 
Qi Liao National Engineering Laboratory for Pipeline Safety/ Beijing Key Laboratory of Urban Oil and Gas Distribution Technology, China University of Petroleum, Beijing 102249, People’s Republic of China 
摘要点击次数: 59
全文下载次数: 66
      
英文摘要:
      The petrol truck routing problem is an important part of the petrol supply chain. This study focuses on determining routes for distributing petrol products from a depot to petrol stations with the objective of minimizing the total travel cost and the fixed cost required to use the trucks. We propose a mathematical model that considers petrol trucks returning to a depot multiple times and develop a heuristic algorithm based on a local branch-and-bound search with a tabu list and the Metropolis acceptance criterion. In addition, an approach that accelerates the solution process by adding several valid inequalities is presented. In this study, the trucks are homogeneous and have two compartments, and each truck can execute at most three tasks daily. The sales company arranges the transfer amount and the time windows for each station. The performance of the proposed algorithm is evaluated by comparing its results with the optimal results. In addition, a real-world case of routing petrol trucks in Beijing is studied to demonstrate the effectiveness of the proposed approach.
Bohong Wang,Yongtu Liang,Meng Yuan,Haoran Zhang,Qi Liao,2019.A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows.Petroleum Science,(3):701~712.
查看全文  查看/发表评论  下载PDF阅读器