主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2020, Vol. 28 ›› Issue (2): 126-135.doi: 10.16381/j.cnki.issn1003-207x.2020.02.012

• 论文 • 上一篇    下一篇

公共服务平台下虚拟联盟成员选择机制及联盟企业间协同制造问题研究

刘捷先1,2, 张晨1   

  1. 1. 合肥工业大学管理学院, 安徽 合肥 230009;
    2. 铜陵学院会计学院, 安徽 铜陵 244061
  • 收稿日期:2018-12-01 修回日期:2019-05-07 出版日期:2020-02-20 发布日期:2020-03-03
  • 通讯作者: 刘捷先(1988-),女(汉族),安徽铜陵人,合肥工业大学管理学院,在读博士研究生,铜陵学院会计学院,讲师,研究方向:生产计划与调度理论、方法及应用、供应链与物流管理,E-mail:liujiexian198833@126.com. E-mail:liujiexian198833@126.com
  • 基金资助:
    国家社会科学基金资助项目(14BGL004);国家社会科学基金资助项目(18BGL069);国家自然科学基金资助项目(71971071,71373065)

Research on Member Selection Mechanism of Virtual Alliance and Collaborative Manufacturing Problem among Alliance Enterprises under Public Service Platform

LIU Jie-xian1,2, ZHANG Chen1   

  1. 1. School of Management, Hefei University of Technology, Hefei 230009, China;
    2. School of Accounting, Tongling University, Tongling 244061, China
  • Received:2018-12-01 Revised:2019-05-07 Online:2020-02-20 Published:2020-03-03

摘要: 本文主要研究了公共服务平台下虚拟联盟成员选择和联盟企业间协同生产的联合优化问题。该问题主要涉及到虚拟联盟战略层面和运营层面两个层面,旨在实现虚拟联盟成员选择、订单分配和生产排序等三个阶段的协同优化。在分析单一联盟企业的生产排序最优化性质的基础上,本文给出了涉及到顾客订单分配和联盟成员选择的结构化性质。考虑到联合优化问题的复杂性,引入并拓展了用于求解连续优化问题的树种算法,开发了嵌入二维离散编码策略和离散种子生成规则的离散树种算法,给出了结合前述结构化性质的适应度计算方法,并开展了一系列仿真对比试验,实验结果表明所提算法相较于离散萤火虫算法和集合蛙跳算法等离散智能优化算法而言,在求解质量和鲁棒性上具有一定的优越性。本文的主要创新点在于提出了横跨战略层面和运营层面的虚拟联盟协同模型,开发了新颖的离散树种算法,能够为虚拟制造联盟的组建和运行提供一定的指导意义。

关键词: 虚拟联盟, 成员选择, 协同生产, 离散树种算法

Abstract: Motivated by the collaborative operations of the manufacturing alliances in industries such as aviation and automobiles, the joint optimization problem of member selection of virtual alliance and collaborative production among alliance enterprises under the public service platform are mainly studied in this paper. This problem involves two levels of virtual alliance, namely strategic alliance and operational level. It aims to achieve collaborative optimization in three stages including virtual alliance member selection, order allocation and production sequencing. Based on the analysis of the optimal properties of the order production in a single enterprise, the structured properties of customer order allocation and alliance member selection are given. Considering the complexity of the joint optimization problem, the Tree-Seed algorithm for solving the continuous optimization problem is introduced and extended. The discrete tree algorithm embedded in the two-dimensional discrete coding strategy and discrete seed generation rule is developed, and the calculation method of fitness is carried out based on the above-mentioned structuring properties.In addition, a benchmark simulation data for this problem are given, and a series of simulation comparison experiments are further conducted. The experimental results show that the proposed algorithm has certain superiority in solving quality and robustness compared with others discrete intelligent optimization algorithms such as Discrete Firefly Algorithm (DFA) and Shuffled Frog Leapfrog Algorithm (SFLA).The main innovation of this paper is to propose a virtual alliance collaboration model across strategic and operational levels, and develop a novel discrete Tree-Seed algorithm, which can provide some guiding significance for the formation and operation of virtual manufacturing alliance.

Key words: virtual alliance, member selection, collaborative production, discrete Tree-Seedalgorithm

中图分类号: