检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:曾敏刚[1] 王秀慧 黎建宇 ZENG Min-gang;WANG Xiu-hui;LI Jian-yu(School of Business Administration,South China University of Technology,Guangzhou 510640,Guangdong,China;School of Computer Science and Engineering,South China University of Technology,Guangzhou 510640,Guangdong,China)
机构地区:[1]华南理工大学工商管理学院,广东广州510640 [2]华南理工大学计算机科学与工程学院,广东广州510640
出 处:《华南理工大学学报(社会科学版)》2021年第4期55-66,共12页Journal of South China University of Technology(Social Science Edition)
基 金:教育部哲学社会科学研究重大课题攻关项目(17JZD020);广东省基础与应用基础研究专项资金项目(2017A030313409);中央高校基本科研业务费专项资金资助项目(2015XZD19)。
摘 要:基于冷链物流较普通物流产生更多碳排放的实际情况和现实中物流网络中的节点存在中断风险,利用情景描述法刻画冷链物流网络中节点中断的情景,兼顾货损成本、碳排放成本和缺货损失成本、运输成本,构建了冷链物流网络规划模型。利用改进遗传算法求解模型,求解过程主要采用模拟二进制交叉算子对决策变量进行降维。通过算例证明了冷链物流仓库网络规划模型可行性,并与贪婪算法对比证明算法的有效性。研究结果表明,企业可以根据公司的现状和商品的性质来选择合适的弹性系数使公司的物流总成本最小。In view of the fact that the nodes in the cold chain logistics network have the risk of interruption and the cold chain logistics generate more carbon emissions than the ordinary logistics,the scenario description method is used to describe the scene of node interruption in the cold chain logistics network.This paper constructs a cold chain logistics network planning model including freight loss cost,carbon emission cost,o ut-of-stock loss cost,and transportation cost.The improved genetic algorithm is used to solve the model.The solution process mainly uses the simulated binary crossover operator to reduce the dimension of the decision variables.The calculation results show that the cold chain logistics warehouse network planning model and the algorithm are effective and feasible.The research results show that the enterprise can choose the appropriate elastic coefficient to minimize the total logistics cost of the company according to the company's current situation and the nature of the commodity.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.226.114