Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem
Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem
复制标题
DOI：
10.1016/j.cie.2010.03.012
复制
发表时间：
2010-08-01
影响因子：
7.9
通讯作者：
Kuo, Yiyo
中科院分区：
文献类型：
--
作者：
Kuo, Yiyo
车辆路径问题（VRP）已经在许多研究论文中得到了解决。其中只有少数考虑了与时间相关的行驶速度。此外，大多数与VRP相关的研究旨在最小化总旅行时间或旅行距离。近年来，减少碳排放已成为一个重要问题。因此，油耗也是车辆路径规划中的一个重要指标。在这项研究中，提出了一个模型来计算总燃料消耗的时间相关的车辆路径问题（TDVRP）的速度和行程时间被假定为取决于时间的行程时，规划车辆路径。该模型中燃油消耗量不仅考虑了装载重量，而且满足“非通过”性质，而这一点在大多数TDVRP相关研究论文中被忽视。在此基础上，提出了一种求解总油耗最低的车辆路径的模拟退火算法。所提出的方法的实验评估进行。结果表明，该方法提供了一个24.61%的改善燃料消耗的方法的基础上最小化运输时间和最小化运输距离的方法的基础上，提高了22.69%。(C)2010爱思唯尔有限公司版权所有。
The vehicle routing problem (VRP) has been addressed in many research papers. Only a few of them take time-dependent travel speeds into consideration. Moreover, most research related to the VRP aims to minimize total travel time or travel distance. In recent years, reducing carbon emissions has become an important issue. Therefore, fuel consumption is also an important index in the VRP. In this research a model is proposed for calculating total fuel consumption for the time-dependent vehicle routing problem (TDVRP) where speed and travel times are assumed to depend on the time of travel when planning vehicle routing. In the model, the fuel consumption not only takes loading weight into consideration but also satisfies the "non-passing" property, which is ignored in most TDVRP-related research papers. Then a simulated annealing (SA) algorithm is proposed for finding the vehicle routing with the lowest total fuel consumption. An experimental evaluation of the proposed method is performed. The results show that the proposed method provides a 24.61% improvement in fuel consumption over the method based on minimizing transportation time and a 22.69% improvement over the method based on minimizing transportation distances. (C) 2010 Elsevier Ltd. All rights reserved.