摘要
在一个运输网络中,一条时间最短、费用最少并且最安全的路,是一个多目标路的实例。使用传统的Dijstra算法或多目标规划方法求一条多目标路是困难的。首先将多目标路问题转换为单目标路问题,或一个"综合"目标问题,然后分别给出"基于顶点标号"的扩展Dijstra算法。
A path taking least time, costing lowest and being safest in a transport net is an instance of multi-targets path. Looking for such a path is difficult with traditional Dijstra Algorithm or with the multi-targets programming. Multi-targets path is changed into many single-target paths or one synthetical single-target path, and then Extended Dijstra Algorithm based on vertex labels are given respectively.
出处
《计算技术与自动化》
2004年第4期31-33,共3页
Computing Technology and Automation
