检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蔡延光[1] 王世豪 黄戈文[1,2] 戚远航 CAI Yan-guang;WANG Shi-hao;HUANG Ge-wenu;QI Yuan-hang(School of Automation,Guangdong University of Technology,Guangzhou 510006,China;Information and Network Center,Jiaying University,Meizhou 514015,China;School of Computer Science,University of Electronic Science and Technology of China,Zhoi^shan Institute,Zhongshan 528402,China)
机构地区:[1]广东工业大学自动化学院,广州510006 [2]嘉应学院信息网络中心,广东梅州514015 [3]电子科技大学中山学院计算机学院,广东中山528402
出 处:《嘉应学院学报》2020年第6期13-19,共7页Journal of Jiaying University
基 金:国家自然科学基金(61074147);广东省自然科学基金(S2011010005059);广东省教育部产学研结合项目(2012B091000171,2011B090400460);广东省科技计划项目(2012B050600028,2014B010118004,2016A050502060);广东省普通高校青年创新人才项目(2018KQNCX333);广州市花都区科技计划项目(HD14ZD001);广州市科技计划项目(201604016055);广州市天河区科技计划项目(2018CX005)。
摘 要:和一般物流不同,冷链物流需考虑生鲜产品运输的制冷成本、新鲜度损失和及时送达.针对冷链物流的特点,建立了冷链物流运输调度模型.该模型综合考虑了车辆固定成本、运输成本、制冷成本、碳排放成本、新鲜度损失成本以及时间惩罚成本.进一步提出了一种以帝国竞争算法为基础的混合扫描帝国竞争算法进行求解.该算法采用扫描法提高初始种群的质量,同时应用帝国分裂策略以及2-Opt策略提高算法搜索能力.仿真实验表明:所提出的算法能有效求解VRPCC,求解所需时间较短,能有效地降低运冷链物流运输总成本.Cold chain logistics is different from general logistics, where the refrigeration cost, freshness loss and timely rage of fresh products delivery must be considered. According to the characteristics of cold chain logistics, a model of vehicle routing problem in cold chain(VRPCC) is established The proposed model minimize the total cost which includes the vehicle fixed cost, transportation cost, refrigeration cost, carbon emission cost, freshness loss cost and time penalty cost. Furthermore, a hybrid sweep imperialist competitive algorithm is proposed to solve the model, which is based on the imperialist competitive algorithm and adopts the sweeping method to improve the quality of the initial population. The imperialist splitting strategy and the 2-Opt strategy are used to improve the search ability of the proposed algorithm. Experiments show that: the proposed algorithm can effectively solve VRPCC;and have great optimization efficiency. The proposed algorithm effectively reduces the total cost.
关 键 词:车辆路径问题 冷链 帝国竞争算法 扫描法 局部搜索
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147