检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈雨蝶 干宏程[1,2] 程亮 CHEN Yu-die;GAN Hong-cheng;CHENG Liang(School of Management,University of Shanghai for Science and Technology,Shanghai 200082,China;Center for Supernetworks Research,University of Shanghai for Science and Technology,Shanghai 200082,China)
机构地区:[1]上海理工大学管理学院,上海200082 [2]上海理工大学超网络研究中心,上海200082
出 处:《控制与决策》2023年第7期1951-1959,共9页Control and Decision
基 金:国家自然科学基金项目(71871143).
摘 要:首先,基于“双碳”战略目标的提出以及物流企业低碳转型的发展趋势,以多中心冷链物流绿色车辆路径问题为研究对象,以碳排放成本、配送成本和时间窗惩罚成本之和最小化为优化目标,建立考虑联合配送和碳交易机制的冷链物流模型;然后,针对遗传算法局部搜索能力差、收敛速度慢等缺点,设计一种具有变邻域搜索操作和动态灾变机制的多种群遗传算法,以标准算例集验证该算法在寻优能力、稳定性、收敛速度等方面的优势;最后,通过实验验证所提出模型的有效性,并从联合配送、决策目标、碳交易机制等多角度进行分析,为冷链物流企业和政府提供管理启示.Under the background of the“double carbon”objective and the low carbon transformation of logistics enterprises,a cold chain logistics model based on joint distribution and carbon trading mechanism is constructed.The model takes the multi-depot green vehicle routing problem in cold chain logistics as the research object,and minimizes carbon emission cost,distribution cost and time window penalty cost as the optimization objective.Then,a multiple population genetic algorithm with variable neighborhood search and dynamic catastrophe mechanism is designed to address the disadvantages of poor local search ability and slow convergence of genetic algorithms.And the advantages of the algorithm in terms of optimization ability,stability and convergence speed are confirmed by the standard instances.Finally,an example is analyzed from various perspectives such as joint distribution,objectives and carbon trading mechanism to verify the validity of the model and provide management insights for cold chain logistics enterprises and governments.
关 键 词:冷链物流 联合配送 碳交易机制 多种群遗传算法 变邻域搜索 动态灾变机制
分 类 号:O224[理学—运筹学与控制论] TP301.6[理学—数学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7