首页 | 本学科首页   官方微博 | 高级检索  
     

动态联盟中伙伴选择问题的区间规划模型及其求解
引用本文:曹洪医. 动态联盟中伙伴选择问题的区间规划模型及其求解[J]. 中国管理科学, 2006, 14(6): 86-91
作者姓名:曹洪医
作者单位:中南财经政法大学工商管理学院, 湖北, 武汉, 430060
摘    要:伙伴选择和风险管理是动态联盟中的重要决策问题,当考虑失败风险时,失败概率无法给出精确值,因此,考虑采用不确定性规划描述此类问题.提出动态联盟中伙伴选择问题的区间规划模型,模型中用区间数表示联盟伙伴的失败概率.为了求解该模型,引入序关系,并利用Nakahara和Ishibuchi的定理,将区间规划模型转化为等价的清晰双目标模型.设计带自适应适值函数的遗传算法,求出问题的全部非劣解.经过对多个问题的仿真,证明了算法的有效性.

关 键 词:伙伴选择  区间规划  双目标规划  遗传算法  
文章编号:1003-207(2006)06-0086-06
收稿时间:2005-10-08;
修稿时间:2005-10-08

Interval Programming Model of Partner Selection Problem in Virtual Enterprise and Its Solution
CAO Hong-yi. Interval Programming Model of Partner Selection Problem in Virtual Enterprise and Its Solution[J]. Chinese Journal of Management Science, 2006, 14(6): 86-91
Authors:CAO Hong-yi
Affiliation:School of Business Administration, Zhongnan University of Economics and Law, WuHan 430060, China
Abstract:Partner selection and risk management are important decision problems in virtual enterprise.In some cases,failure probability cannot be given precisely,it is reasonable to denote this type of problem by uncertain programming.An interval programming model for partner selection is presented,in which members' failure probabilities are treated as interval coefficients.This model is transformed into equivalent bi-objective precise model by the definition of order relation between interval numbers and the theorem proved by Nakahara and Ishibuchi.A genetic algorithm with self-adaptive fitness function is proposed to find all Pareto solutions.Simulation results show that this approach is efficient.
Keywords:partner selection  interval programming  bi-objective programming  genetic algorithm  
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《中国管理科学》浏览原始摘要信息
点击此处可从《中国管理科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号