| 双目标最优路问题 |
| |
| 引用本文： | 王勤,杨爱峰,林浩.双目标最优路问题[J].河南科学,2000,18(1):28-31. |
| |
| 作者姓名： | 王勤 杨爱峰 林浩 |
| |
| 作者单位： | 郑州大学系统科学与数学系,河南,郑州,450052 |
| |
| 摘 要： | 双目标最优路问题是指在一个图中找这样的路 ,使其权最大 ,费用最少。本文利用几个模型将双目标最优路问题转化成单目标问题 ,求得双目标最优路问题的有效解
|
| 关 键 词： | 双目标最优路 有效解 弱有效解 |
| 文章编号： | 1004-3918(2000)01-0028-04 |
| 修稿时间： | 1999-12-21 |
The Optimal Path Problem with Two Objective Functions |
| |
| WANG Qing,YANG Ai-feng,LIN Hao.The Optimal Path Problem with Two Objective Functions[J].Henan Science,2000,18(1):28-31. |
| |
| Authors: | WANG Qing YANG Ai-feng LIN Hao |
| |
| Abstract: | Let G be a digraph.The two objective optimal path problem is to find a path which has the maximum weight and minimum cost in G.In this paper,we transfer the two objective optimal path problem to one objective problem by some mathematical models,from which we obtain the effective solutions. |
| |
| Keywords: | Two objective optimal path Effective solution Weakly effective solution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
