检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张倩[1] 熊英 何明珂[1,3] 张浩 Zhang Qian;Xiong Ying;He Mingke;Zhang Hao(Beijing Technology and Business University, Beijing 10004& China;State Grid Beijing Logistic Supply Company, State Grid Beijing Electric Power Company, Beijing 100054, China;Beijing Wuzi University, Beijing 101149, China)
机构地区:[1]北京工商大学商学院,北京100048 [2]国网北京市电力公司物资分公司,北京100054 [3]北京物资学院物流学院,北京101149
出 处:《系统仿真学报》2019年第8期1582-1590,共9页Journal of System Simulation
基 金:2018年首都流通业研究基地内设课题(JD-ZD-2018-001);北京市哲学社会科学项目(17GLB013)
摘 要:综合考虑配送成本、生鲜产品新鲜度、碳排放和客户需求不确定等因素,建立配送路径规划多目标优化模型。基于鲁棒优化处理不确定问题的方法,针对离散需求隶属于椭球不确定集情况,优化配送路径规划多目标模型,并应用主要目标法和果蝇算法对模型进行求解。算例验证所建模型及算法具有良好的鲁棒性,能有效抑制需求为不确定情况下所带来的扰动。对于完善生鲜电商企业配送路径规划模型和配送网络优化方法提供了重要的理论支持和实践思路。Considering the distribution cost, freshness of fresh products, carbon emissions and customer demand uncertainty and other factors, a multi-objective optimization model of distribution path planning is established. Based on the robust optimization method for dealing with uncertain problems, the multi-objective model of distribution routing planning is optimized for the situation that the discrete demand belongs to the uncertainty set of ellipsoid. The model is solved by using the main target method and fruit fly algorithm. It is proved that the model and algorithm are robust and can effectively suppress the disturbance caused by the uncertainty of the demand. This paper provides an important theoretical basis and practical ideas for improving the distribution route planning model and distribution network optimization method.
关 键 词:路径规划 不确定需求 生鲜电商 鲁棒优化 果蝇算法
分 类 号:TP391.9[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222