基于蟻群算法動(dòng)態(tài)聯(lián)盟盟友選擇問題研究

來源：互聯(lián)網(wǎng)   發(fā)布日期：2011-09-07 14:50:46   瀏覽：6279次  

許曉偉，凌興宏，李凡長，姚望舒 （蘇州大學(xué)計(jì)算機(jī)科學(xué)與技術(shù)學(xué)院，蘇州，215006）摘要：盟友選擇是組建動(dòng)態(tài)聯(lián)盟的關(guān)鍵因素之一，而要保證選擇盟友決策的正確性，就必須選擇合理的評(píng)價(jià)指標(biāo)并建立合理的模型。盟友選擇問題是一個(gè)復(fù)雜的組合優(yōu)化問題，考慮因素多，屬于 NP-hard 問題。本文從整個(gè)生產(chǎn)價(jià)值鏈出發(fā)，結(jié)合層次分析法 (AHP) ，建立盟友選擇模型。在對(duì)模型研究的基礎(chǔ)上，提出了一種基于蟻群算法的動(dòng)態(tài)聯(lián)盟盟友選擇方法。實(shí)現(xiàn)整條生產(chǎn)價(jià)值鏈的全局最優(yōu)，最后通過實(shí)驗(yàn)證明這種方法的有效性。關(guān)鍵詞：動(dòng)態(tài)聯(lián)盟、盟友選擇、多目標(biāo)決策、層次分析法、蟻群算法Study on Selection Of Dynamic Alliance Ally ProblemBased on ACO Xu Xiaowei , Ling Xinghong ，Li Fanzhang, Yao Wangshu (School of Computer Science and Technology , Soochow University , suzhou ,215006,China )Abstract: Selection of ally is one of the key factors to build a danamic allience. To ensure the correctness of the decision-making, it is necessary to choose a reasonable evaluation of the model. Selection of allies is a complex combinatorial optimization problems,which consider much and belongs to NP-hard problems. In this paper, based on the entire production value chain and Analytical Hierarchy Process (AHP), establish selection of ally model. On the basic of study of model,we establis a solution of selection of danamic alliance ally based on ant colony algorithm . The solution make the realization of the entire production value chain of the global optimum, and finally proved by experiment the validity of this approach.Keywords:Dynamic Alliance; Selection of Ally;Multi-object Decision;The Analytic Hierarchy Process(AHP); Ant Colony Optimization引言 動(dòng)態(tài)聯(lián)盟是一種新型的企

贊助本站