带碳排放约束的异型车辆路径问题及其禁忌搜索算法  

Heterogeneous vehicle routing problem with carbon emission and its tabu search algorithm

作　　者：段凤华[1] 符卓[2] 

机构地区：[1]湖南科技大学商学院,湖南湘潭411000 [2]中南大学交通运输工程学院,湖南长沙410075

出　　处：《铁道科学与工程学报》2015年第4期941-948,共8页Journal of Railway Science and Engineering

基　　金：国家自然科学基金资助项目(71271220);湖南省自然科学基金资助项目(11JJ3082);湖南科技大学博士启动基金资助项目(E510A7)

摘　　要：回顾物流运输中的碳排放和异型车辆路径问题研究状况,阐述带碳排放的异型车辆路径问题(HVRPCE),并建立HVRPCE问题的数学模型。应用基于最佳插入和交换的混合邻域禁忌搜索算法求解HVRPCE问题,对Taillard标准算例给予碳排放约束以进行HVRPCE测试,其中异型车辆的碳排放系数根据其燃料消耗确定。采用小型车优先的策略来产生初始解,并提出一种混合邻域结构。与文献中已有的结果相比较,结果显示:混合邻域禁忌搜索算法能使得HVRPCE问题在车辆行驶成本和碳排放两方面有较大的下降,而企业不仅能在低碳物流方面成功,还能增加效益。In this paper,the research situations of carbon emissions from logistics transport and the heterogene-ous vehicle routing problem （HVRP）were reviewed,and the heterogeneous vehicle routing problem with carbon emission （HVRPCE）was expounded and modeled.The mixed neighborhood tabu search （MNTS）algorithm is applied to solve the model based on best insertion and change.The HVRPCE was tested based on Taillard’s benchmarks that limited by carbon emissions and the heterogeneous vehicles’carbon emission coefficients were obtained according to their fuel consumptions.The strategy of small vehicle priority was used to generate the ini-tial solution,and the mixed neighborhood structure was proposed.Compared with similar literature,the results of this paper show that MNTS can lead HVRPCE to a significant decline in vehicle travel cost and vehicle carbon e-missions,and enterprises could achieve not only low carbon logistics but also benefit growth by applying MNTS to HVRPCE.

关 键 词：车辆路径问题 异型车 碳排放 混合邻域 禁忌搜索 

分 类 号：U9[交通运输工程]