[1]陶光远,周佩德,王强.最优运输径路选择的启发式算法[J].东南大学学报(自然科学版),1987,17(6):72-77.[doi:10.3969/j.issn.1001-0505.1987.06.008]
　Tao Guangyuan (Institute of Applied Mathematics,Academia Sinica) Zhou Peide Wang Qiang (Department of Computer Science and Engineering).The Heuristic Shortest-path Algorithm for Transportation[J].Journal of Southeast University (Natural Science Edition),1987,17(6):72-77.[doi:10.3969/j.issn.1001-0505.1987.06.008]
点击复制

最优运输径路选择的启发式算法()
分享到：

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
17
期数:
1987年第6期
页码:
72-77
栏目:
本刊信息
出版日期:
1987-11-20

文章信息/Info

Title:
The Heuristic Shortest-path Algorithm for Transportation
作者:
陶光远; 周佩德; 王强
中科院应用数学研究所； 南京工学院计算机科学与工程系
Author(s):
Tao Guangyuan (Institute of Applied Mathematics; Academia Sinica) Zhou Peide Wang Qiang (Department of Computer Science and Engineering)
关键词:
运输;  最优路径;  人工智能;  知识;  算法
Keywords:
transportation;  shortest-path;  artificial intelligence;  knowledge;  algorithm
分类号:
+
DOI:
10.3969/j.issn.1001-0505.1987.06.008
摘要:
最优运输径路选择问题是处理运输的运行、管理和规划的基础。作者在简述了经典的 Dijkstra 算法后,提出了基于人工智能产生式系统的启发式算法,讨论了关于路径知识的管理、更新与使用的问题,最后给出了算法实现的数据结构及框图。
Abstract:
The shortest-path selection is the basis for transport servicing,managing and programming.In this paper,after a brief description of the classical Dijkstra algorithm,we have developed an AI-based heuristic shortest-path algorithm.How to manage,update and use the knowledge of path is discussed. Data structure and algorithm framechart are introduced in the end.

相似文献/References:

[1]潘义勇,马健霄.基于可靠性的随机交通网络约束最优路径问题[J].东南大学学报(自然科学版),2017,47(6):1263.[doi:10.3969/j.issn.1001-0505.2017.06.028]
　Pan Yiyong,Ma Jianxiao.Constrained shortest path problem in stochastic traffic network based on reliability[J].Journal of Southeast University (Natural Science Edition),2017,47(6):1263.[doi:10.3969/j.issn.1001-0505.2017.06.028]

更新日期/Last Update: 2013-05-01