检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:狄卫民[1] 杜慧莉 张鹏阁 DI Wei-min;DU Hui-li;ZHANG Peng-ge(School of Management Engineering,Zhengzhou University,Zhengzhou 450001,China)
出 处:《计算机工程与设计》2021年第9期2614-2620,共7页Computer Engineering and Design
基 金:河南省高等学校重点科研基金项目(20A630034)。
摘 要:为降低物流配送成本,促进碳减排,提出一种考虑动态拥堵的多车型绿色车辆路径优化方法。针对常发性道路拥堵状况,将配送时间划分为若干时段,以道路拥堵系数反映不同时段的拥堵状况,同时考虑到碳排放、多车型和客户时间窗的影响,建立以系统总成本最小为目标的绿色车辆路径优化模型,设计求解模型的头脑风暴优化算法。结合算例,对该问题进行仿真,将结果与遗传算法进行对比,验证了模型的可行性和算法的有效性,表明考虑多车型配送和动态拥堵可以有效降低系统成本。To reduce logistics distribution cost and promote carbon reduction,an optimization method for multi-vehicle green vehicle routing problem considering dynamic congestion was proposed.Aiming at frequent road congestion conditions,the delivery time was divided into several time periods,and the road congestion coefficient was used to reflect the congestion conditions at different time periods.Considering the impact of carbon emission,multi-vehicle types and customer time windows simultaneously,a green vehicle routing optimization model with the goal of minimizing the total system cost was established and a brain storm optimization algorithm was designed.This problem was simulated with a calculation example,and the result was compared with genetic algorithm to demonstrate the feasibility of the model and the effectiveness of the algorithm.The deduction is obtained simultaneously considering multi-vehicle distribution and dynamic congestion can reduce system cost effectively.
关 键 词:绿色车辆路径问题 动态拥堵 碳排放 多车型 头脑风暴优化算法
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222