检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]北京工商大学计算机与信息工程学院,北京100048 [2]郑州轻工业学院计算机与通信工程学院,河南郑州450002
出 处:《计算机工程与科学》2015年第7期1318-1324,共7页Computer Engineering & Science
基 金:北京市自然科学基金资助项目(9102005);教育部人文社会科学研究项目基金资助(09YJA630003);首都流通业研究基地资助项目(JD-2014-YB-001)
摘 要:针对连锁零售供应链多级库存资源的动态优化配置问题,提出了在上层对库存策略和下层对物流分配方案协同寻优的多级库存双层规划模型。借鉴细粒度模型遗传算法的遗传操作具有局部性的特点,模拟微观群体交互作用的局部性,基于细粒度模型遗传算法的Agent群体行为优化算法和基于复杂适应系统涌现机理的协同决策机制,进行连锁零售供应链多级库存协同决策研究。通过算例实验对模型的有效性进行了验证。仿真实验结果表明,通过连锁零售供应链微观个体Agent的群体行为优化,从系统工程的角度,实现了连锁零售供应链多级库存的动态资源优化配置和信息共享,降低了多级库存管理与运营的总成本。Aiming at the dynamic optimization problem of multistage inventory resources allocation in chain retail supply chain, we put forth a dual-level programming model of multistage inventory,in which inventory strategy is optimized at the upper layer,and the logistics distribution schemes at the lower lay- er. Using the local genetic operation characteristics of the fine-grained genetic algorithms, we simulate the locality of microscopic group interaction, and study the collaborative decision of multistage inventory for chain retail supply chain based on the Agent group behavior optimization algorithms of the fine-- grained genetic algorithms and on the collaborative decision mechanism of the emergence mechanism of complex adaptive system. The validity of the model is verified by an example experiment. Simulation re- sults show that from the view of system engineering, the dynamic optimization of multistage inventory resources allocation and information sharing in chain retail supply chain are realized by the group behav- ior optimization of microscopic individual Agents in chain retail supply chain, which can reduce the total cost of management and operation for multistage inventory.
关 键 词:多级库存协同决策 连锁零售供应链 复杂适应系统 细粒度模型遗传算法 Agent群体行为 优化
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.46