An effective evolutionary approach for bicriteria shortest path routing problems (特集:進化技術とその応用) An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

この論文にアクセスする

この論文をさがす

著者

抄録

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

収録刊行物

  • 電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society  

    電気学会論文誌. C, 電子・情報・システム部門誌 = The transactions of the Institute of Electrical Engineers of Japan. C, A publication of Electronics, Information and System Society 128(3), 416-423, 2008-03-01 

    The Institute of Electrical Engineers of Japan

参考文献:  28件

参考文献を見るにはログインが必要です。ユーザIDをお持ちでない方は新規登録してください。

各種コード

  • NII論文ID(NAID)
    10021131692
  • NII書誌ID(NCID)
    AN10065950
  • 本文言語コード
    ENG
  • 資料種別
    ART
  • ISSN
    03854221
  • NDL 記事登録ID
    9401026
  • NDL 雑誌分類
    ZN31(科学技術--電気工学・電気機械工業)
  • NDL 請求記号
    Z16-795
  • データ提供元
    CJP書誌  NDL  J-STAGE 
ページトップへ