A block recombination approach to solve green vehicle routing problem
A block recombination approach to solve green vehicle routing problem
复制标题
DOI：
10.1016/j.ijpe.2014.11.003
复制
发表时间：
2015-06
影响因子：
12
通讯作者：
Anurag Tiwari;P. Chang
中科院分区：
文献类型：
--
作者：
Anurag Tiwari;P. Chang
车辆路径问题（VRP）是交通和物流领域许多实际应用中最重要的问题之一。目前二氧化碳排放是研究人员关注的主要问题之一。绿色车辆路径问题（GVRP）是车辆路径问题的延伸。在 GVRP 中，我们考虑每辆车从仓库到配送中心的最短行驶距离以及车辆排放的二氧化碳总量。在本文中，我们考虑基于距离的方法来计算二氧化碳排放量。此外，卡车负载也被视为二氧化碳排放的一个因素。我们为不同卡车访问的每个城市生成不同的集群，并应用块重组方法来解决每个集群代表一个块的 GVRP 基准问题。为了避免偏差，我们将实验结果与其他众所周知的进化算法进行比较。计算结果表明，所提出的方法非常具有竞争力并且具有广阔的前景。
The vehicle routing problem (VRP) is one of the most important problem with many real world application in transportation and logistics area. Presently carbon dioxide emission is one of the major concerns for the researchers. Green vehicle routing problem (GVRP) is the extension of the vehicle routing problem. In GVRP we consider the minimum distance travelled by each vehicle from depot to distribution center as well as the total emitted carbon dioxide by the vehicle. In this paper, we consider the distance based approach to calculate the carbon dioxide emission. In addition, the truck load is considered as a factor for the carbon dioxide emission. We generate the different cluster for each city visited by different trucks and apply block recombination approach to solve the GVRP benchmark problem where each cluster represents as a block. To avoid the bias, we compare the experimental results with other well know evolutionary algorithms. Computational results show that the proposed methodology is very competitive and has the promising future.