皇冠网名唇-皇冠网名唇-娱乐城开户彩金

首頁(yè)» 往期文章» 2019» Issue 3» 石油經(jīng)濟(jì)與管理

Petroleum Science >2019,??Issue 3:??701-712 DOI: https://doi.org/10.1007/s12182-019-0316-8

A metaheuristic method for the multireturn-to-depot petrol truck routing problem with time windows Open?Access

文章信息

pdf下載
作者：Bohong Wang, Yongtu Liang, Meng Yuan, Haoran Zhang and 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,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,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,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 and 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

投稿時(shí)間：2018-06-27
引用方式：Wang, B., Liang, Y., Yuan, M. et al. Pet. Sci. (2019) 16: 701. https://doi.org/10.1007/s12182-019-0316-8

文章摘要

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.

關(guān)鍵詞

    Petrol truck routing problem, Heuristic algorithm, Valid inequalities, Time windows