检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:杨晓华 郭健全[1] YANG Xiaohua;GUO Jianquan(Business School,University of Shanghai for Science and Technology,Shanghai 200093,China)
机构地区:[1]上海理工大学管理学院
出 处:《计算机应用》2019年第7期2168-2174,共7页journal of Computer Applications
基 金:国家自然科学基金资助项目(71071093,71471110);上海市自然科学基金资助项目(10ZR1413300);上海市科委创新项目(16DZ1201402,16040501500);陕西省社会科学基金资助项目(2015D060)~~
摘 要:针对生鲜品因易腐易损性而产生的高频次物流配送及不确定需求与退货量的问题,提出了模糊环境下多周期生鲜闭环物流网络系统,以实现最小系统成本、最优设施选址与最佳配送路径的多决策安排。为求解系统对应的模糊混合整数线性规划(FMILP)模型,首先将生鲜需求量和退货量设定为三角模糊值,其次运用模糊机会约束规划方法将模糊约束等价变换为清晰式,最后利用遗传算法(GA)和粒子群优化(PSO)算法搜索案例的最优解。实验结果表明,多周期闭环系统比单周期更能兼顾多决策规划,同时三角模糊量的置信水平变化对企业最优运作有着显著影响,进而为相关决策者提供借鉴。Concerning the high frequency logistics distribution of fresh products due to the products perishability and vulnerability,as well as the uncertainty of demand and return,a multi-period closed-loop logistics network for fresh products with fuzzy variables was constructed to achieve the multi-decision arrangement of minimum system cost,optimal facility location and optimal delivery route. In order to solve the Fuzzy Mixed Integer Linear Programming (FMILP) model corresponding to the system,firstly,the amounts of demand and return were defined as triangular fuzzy parameters;secondly,the fuzzy constraints were transformed into crisp formula by using fuzzy chance constrained programming method;finally,the optimal solution of case was obtained by using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithm. The experimental results show that multi-period closed-loop system performs better than single-period system in the aspect of multi-decision programming,meanwhile,the confidence levels of triangular fuzzy parameters have significant influence on the optimal operation of enterprise,thus providing a reference for relevant decision makers.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.36