The main objective of this paper is to propose a new hybrid algorithm for solving the Bi objective green vehicle routing problem (BGVRP) from the BicriterionAnt metaheuristic. The methodology used is subdivided as fol...The main objective of this paper is to propose a new hybrid algorithm for solving the Bi objective green vehicle routing problem (BGVRP) from the BicriterionAnt metaheuristic. The methodology used is subdivided as follows: first, we introduce data from the GVRP or instances from the literature. Second, we use the first cluster route second technique using the k-means algorithm, then we apply the BicriterionAntAPE (BicriterionAnt Adjacent Pairwise Exchange) algorithm to each cluster obtained. And finally, we make a comparative analysis of the results obtained by the case study as well as instances from the literature with some existing metaheuristics NSGA, SPEA, BicriterionAnt in order to see the performance of the new hybrid algorithm. The results show that the routes which minimize the total distance traveled by the vehicles are different from those which minimize the CO<sub>2</sub> pollution, which can be understood by the fact that the objectives are conflicting. In this study, we also find that the optimal route reduces product CO<sub>2</sub> by almost 7.2% compared to the worst route.展开更多
In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used t...In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.展开更多
The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and ...The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and literature Instances, was divided into three stages: Stage 1, data treatment;Stage 2, “metaheuristic approaches” (hybrid or non-hybrid), used comparatively, more specifically: NSGA-II (Non-dominated Sorting Genetic Algorithm II), MOPSO (Multi-Objective Particle Swarm Optimization), which were compared with the new approaches proposed by the authors, CWNSGA-II (Clarke and Wright’s Savings with the Non-dominated Sorting Genetic Algorithm II) and CWTSNSGA-II (Clarke and Wright’s Savings, Tabu Search and Non-dominated Sorting Genetic Algorithm II);Stage 3, analysis of the results, with a comparison of the algorithms. An optimization of 19.9% was achieved for Objective Function 1 (OF<sub>1</sub>;minimization of CO<sub>2</sub> emissions) and consequently the same percentage for the minimization of total distance, and 87.5% for Objective Function 2 (OF<sub>2</sub>;minimization of the difference in demand). Metaheuristic approaches hybrid achieved superior results for case study and instances. In this way, the procedure presented here can bring benefits to society as it considers environmental issues and also balancing work between the routes, ensuring savings and satisfaction for the users.展开更多
针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索...针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索空间;然后,提出增强超启发式分布估计算法(enhanced hyperheuristic estimation of distribution algorithm,EHHEDA)对各个子问题进行求解,进而获得原问题的解.EHHEDA基于超启发式算法框架,在高层策略域设计一种基于三维概率模型的分布估计算法,动态确定由底层操作域中各搜索算子所组成的排列(即高层个体),可有效控制和引导整个算法的搜索行为;同时,在底层操作域设计10种有效邻域搜索算子,并加入重升温操作的模拟退火机制作为问题解(即底层个体)的接受准则,有利于在问题解空间中执行深入搜索.仿真实验结果表明,所提出的算法在大多数测试集上优于近年来用于求解类似问题的算法,验证了所提出算法的有效性.展开更多
为揭示电动车辆路径问题领域的研究与发展现状,对CNKI和Web of Science数据库中电动车辆路径问题1994-2022年间的期刊文献进行知识挖掘与分析。基于文献计量学的量化分析与知识图谱的可视化,通过分析文献外部特征和共被引情况,梳理研究...为揭示电动车辆路径问题领域的研究与发展现状,对CNKI和Web of Science数据库中电动车辆路径问题1994-2022年间的期刊文献进行知识挖掘与分析。基于文献计量学的量化分析与知识图谱的可视化,通过分析文献外部特征和共被引情况,梳理研究热点及热点演进趋势,归纳研究主题,总结出电动车辆路径问题的知识域包括研究主题和应用场景,其中,研究主题由变体研究、充电调度、求解方法三部分构成;对电动车辆路径问题在复杂实际问题、高效求解算法方面的未来发展进行展望,这将为电动车辆路径问题研究的深入化与国际化提供一定的推动作用。展开更多
文章针对绿色物流中多车场多车型带时间窗的车辆路径问题(Green Vehicle Routing Problem with Time Windows for Multi-depot and Heterogeneous Vehicles, GVRPTW-MDHV),考虑实时载重对车辆油耗和碳排放的影响,引入综合排放模型(Compr...文章针对绿色物流中多车场多车型带时间窗的车辆路径问题(Green Vehicle Routing Problem with Time Windows for Multi-depot and Heterogeneous Vehicles, GVRPTW-MDHV),考虑实时载重对车辆油耗和碳排放的影响,引入综合排放模型(Comprehensive Modal Emission Model, CMEM)对车辆油耗和碳排放进行度量,最终以车辆油耗成本、碳排放成本、固定发车费用、车辆租用费用、车辆人力成本和时间窗惩罚成本之和最小化为优化目标,构建了GVRPTW-MDHV数学模型,并根据模型特点设计改进差分进化算法。算例仿真结果表明,构建的模型和提出的算法能够为不同车场合理调配不同型号车辆,有助于科学规划车辆路径,有效减少油耗量和碳排放量,降低总配送成本。展开更多
为了降低插电式混合动力汽车(Plug-in Hybrid Electric Vehicle,PHEV)在驾驶过程中的能耗,本文对插电式混合动力汽车绿色路径规划问题(Plug-in Hybrid Electric Vehicle Green Routing Problem,PHEVGRP)进行了研究。基于脉冲耦合神经网...为了降低插电式混合动力汽车(Plug-in Hybrid Electric Vehicle,PHEV)在驾驶过程中的能耗,本文对插电式混合动力汽车绿色路径规划问题(Plug-in Hybrid Electric Vehicle Green Routing Problem,PHEVGRP)进行了研究。基于脉冲耦合神经网络提出了用时间依赖中继神经网络求解时间依赖车辆路径规划问题。基于可实时获取的道路交通状态量建立PHEV能耗计算模型。采用硬参数共享多任务学习建立道路交通状态量的预测模型。结合两个模型,将时间依赖中继神经网络应用于PHEVGRP的求解。采用真实数据进行试验,结果表明所提出的方法能够求得PHEVGRP的基于预测模型的最优解且求解速度优于启发式算法。展开更多
绿色车辆路径规划对物流配送领域的节能减排具有重要的现实意义。针对时间依赖型绿色车辆路径问题(time-dependent green vehicle routing problem,TDGVRP),考虑车辆不同出发时刻对行驶时间的影响,分析车辆时变速度、载重与碳排放率之...绿色车辆路径规划对物流配送领域的节能减排具有重要的现实意义。针对时间依赖型绿色车辆路径问题(time-dependent green vehicle routing problem,TDGVRP),考虑车辆不同出发时刻对行驶时间的影响,分析车辆时变速度、载重与碳排放率之间的关系,确定基于车辆时变速度和载重的碳排放率度量函数;在此基础上,以车辆油耗和碳排放成本、使用时间成本和固定成本、等待成本与人力成本之和作为目标函数,构建TDGVRP模型,并根据模型特点设计基于路段划分策略的车辆行驶时间计算方法,提出了改进蚁群算法。算例仿真结果表明,构建的模型和提出的算法能合理规划车辆出发时刻,有效规避交通拥堵时间段,降低配送总成本,减少油耗和碳排放。展开更多
文摘The main objective of this paper is to propose a new hybrid algorithm for solving the Bi objective green vehicle routing problem (BGVRP) from the BicriterionAnt metaheuristic. The methodology used is subdivided as follows: first, we introduce data from the GVRP or instances from the literature. Second, we use the first cluster route second technique using the k-means algorithm, then we apply the BicriterionAntAPE (BicriterionAnt Adjacent Pairwise Exchange) algorithm to each cluster obtained. And finally, we make a comparative analysis of the results obtained by the case study as well as instances from the literature with some existing metaheuristics NSGA, SPEA, BicriterionAnt in order to see the performance of the new hybrid algorithm. The results show that the routes which minimize the total distance traveled by the vehicles are different from those which minimize the CO<sub>2</sub> pollution, which can be understood by the fact that the objectives are conflicting. In this study, we also find that the optimal route reduces product CO<sub>2</sub> by almost 7.2% compared to the worst route.
基金supported by the National Science Fund for Distinguished Young Scholars of China(61525304)the National Natural Science Foundation of China(61873328)
文摘In this paper, a memetic algorithm with competition(MAC) is proposed to solve the capacitated green vehicle routing problem(CGVRP). Firstly, the permutation array called traveling salesman problem(TSP) route is used to encode the solution, and an effective decoding method to construct the CGVRP route is presented accordingly. Secondly, the k-nearest neighbor(k NN) based initialization is presented to take use of the location information of the customers. Thirdly, according to the characteristics of the CGVRP, the search operators in the variable neighborhood search(VNS) framework and the simulated annealing(SA) strategy are executed on the TSP route for all solutions. Moreover, the customer adjustment operator and the alternative fuel station(AFS) adjustment operator on the CGVRP route are executed for the elite solutions after competition. In addition, the crossover operator is employed to share information among different solutions. The effect of parameter setting is investigated using the Taguchi method of design-ofexperiment to suggest suitable values. Via numerical tests, it demonstrates the effectiveness of both the competitive search and the decoding method. Moreover, extensive comparative results show that the proposed algorithm is more effective and efficient than the existing methods in solving the CGVRP.
文摘The purpose of this work is to present a methodology to provide a solution to a Bi-objective Green Vehicle Routing Problem (BGVRP). The methodology, illustrated using a case study (newspaper distribution problem) and literature Instances, was divided into three stages: Stage 1, data treatment;Stage 2, “metaheuristic approaches” (hybrid or non-hybrid), used comparatively, more specifically: NSGA-II (Non-dominated Sorting Genetic Algorithm II), MOPSO (Multi-Objective Particle Swarm Optimization), which were compared with the new approaches proposed by the authors, CWNSGA-II (Clarke and Wright’s Savings with the Non-dominated Sorting Genetic Algorithm II) and CWTSNSGA-II (Clarke and Wright’s Savings, Tabu Search and Non-dominated Sorting Genetic Algorithm II);Stage 3, analysis of the results, with a comparison of the algorithms. An optimization of 19.9% was achieved for Objective Function 1 (OF<sub>1</sub>;minimization of CO<sub>2</sub> emissions) and consequently the same percentage for the minimization of total distance, and 87.5% for Objective Function 2 (OF<sub>2</sub>;minimization of the difference in demand). Metaheuristic approaches hybrid achieved superior results for case study and instances. In this way, the procedure presented here can bring benefits to society as it considers environmental issues and also balancing work between the routes, ensuring savings and satisfaction for the users.
文摘针对模糊需求下的绿色两级车辆路径问题,以最小化车辆运营成本和油耗成本之和为优化目标,提出一种混合超启发式算法进行求解.首先,考虑两级问题解空间庞大且相互耦合,设计一种聚类分解策略将该问题分解为多个子问题,以合理缩小问题搜索空间;然后,提出增强超启发式分布估计算法(enhanced hyperheuristic estimation of distribution algorithm,EHHEDA)对各个子问题进行求解,进而获得原问题的解.EHHEDA基于超启发式算法框架,在高层策略域设计一种基于三维概率模型的分布估计算法,动态确定由底层操作域中各搜索算子所组成的排列(即高层个体),可有效控制和引导整个算法的搜索行为;同时,在底层操作域设计10种有效邻域搜索算子,并加入重升温操作的模拟退火机制作为问题解(即底层个体)的接受准则,有利于在问题解空间中执行深入搜索.仿真实验结果表明,所提出的算法在大多数测试集上优于近年来用于求解类似问题的算法,验证了所提出算法的有效性.
文摘为揭示电动车辆路径问题领域的研究与发展现状,对CNKI和Web of Science数据库中电动车辆路径问题1994-2022年间的期刊文献进行知识挖掘与分析。基于文献计量学的量化分析与知识图谱的可视化,通过分析文献外部特征和共被引情况,梳理研究热点及热点演进趋势,归纳研究主题,总结出电动车辆路径问题的知识域包括研究主题和应用场景,其中,研究主题由变体研究、充电调度、求解方法三部分构成;对电动车辆路径问题在复杂实际问题、高效求解算法方面的未来发展进行展望,这将为电动车辆路径问题研究的深入化与国际化提供一定的推动作用。
文摘文章针对绿色物流中多车场多车型带时间窗的车辆路径问题(Green Vehicle Routing Problem with Time Windows for Multi-depot and Heterogeneous Vehicles, GVRPTW-MDHV),考虑实时载重对车辆油耗和碳排放的影响,引入综合排放模型(Comprehensive Modal Emission Model, CMEM)对车辆油耗和碳排放进行度量,最终以车辆油耗成本、碳排放成本、固定发车费用、车辆租用费用、车辆人力成本和时间窗惩罚成本之和最小化为优化目标,构建了GVRPTW-MDHV数学模型,并根据模型特点设计改进差分进化算法。算例仿真结果表明,构建的模型和提出的算法能够为不同车场合理调配不同型号车辆,有助于科学规划车辆路径,有效减少油耗量和碳排放量,降低总配送成本。
文摘为了降低插电式混合动力汽车(Plug-in Hybrid Electric Vehicle,PHEV)在驾驶过程中的能耗,本文对插电式混合动力汽车绿色路径规划问题(Plug-in Hybrid Electric Vehicle Green Routing Problem,PHEVGRP)进行了研究。基于脉冲耦合神经网络提出了用时间依赖中继神经网络求解时间依赖车辆路径规划问题。基于可实时获取的道路交通状态量建立PHEV能耗计算模型。采用硬参数共享多任务学习建立道路交通状态量的预测模型。结合两个模型,将时间依赖中继神经网络应用于PHEVGRP的求解。采用真实数据进行试验,结果表明所提出的方法能够求得PHEVGRP的基于预测模型的最优解且求解速度优于启发式算法。
文摘绿色车辆路径规划对物流配送领域的节能减排具有重要的现实意义。针对时间依赖型绿色车辆路径问题(time-dependent green vehicle routing problem,TDGVRP),考虑车辆不同出发时刻对行驶时间的影响,分析车辆时变速度、载重与碳排放率之间的关系,确定基于车辆时变速度和载重的碳排放率度量函数;在此基础上,以车辆油耗和碳排放成本、使用时间成本和固定成本、等待成本与人力成本之和作为目标函数,构建TDGVRP模型,并根据模型特点设计基于路段划分策略的车辆行驶时间计算方法,提出了改进蚁群算法。算例仿真结果表明,构建的模型和提出的算法能合理规划车辆出发时刻,有效规避交通拥堵时间段,降低配送总成本,减少油耗和碳排放。