| 城市道路定向问题及其算法 |
| |
| 引用本文： | 王新红,崔玉泉. 城市道路定向问题及其算法[J]. 山东大学学报(理学版), 2004, 39(1): 21-28 |
| |
| 作者姓名： | 王新红 崔玉泉 |
| |
| 作者单位： | 1. 济南大学,信息科学与工程学院,山东,济南,250022
2. 山东大学,数学与系统科学学院,山东,济南,250100 |
| |
| 摘 要： | 介绍了研究城市道路定向问题的意义及城市合理定向的概念，给出图的合理定向的定义，研究了图的定向的一些性质，还给出几个特殊图合理定向存在的充要条件．利用就近配对思想与断头切技术设计了合理定向问题的启发式算法，以济南市实际道路定向问题作为实例，得到济南市道路定向的一个合理方案．
|
| 关 键 词： | 道路定向 合理定向 就近配对思想 断头切技术 算法 |
| 文章编号： | 1671-9352(2004)01-0021-08 |
| 修稿时间： | 2003-01-22 |
City road orientation problem and algorithm |
| |
| WANG Xin-hong , CUI Yu-quan. City road orientation problem and algorithm[J]. Journal of Shandong University, 2004, 39(1): 21-28 |
| |
| Authors: | WANG Xin-hong & CUI Yu-quan |
| |
| Affiliation: | WANG Xin-hong 1 & CUI Yu-quan 2 |
| |
| Abstract: | The importance to investigate the city road orientation problem and the conception of city road reasonable orientation are introduced,the definition of reasonable orientation is given and some properties of orientation are obtained.An heuristic algorithm RO based on the idea of nearest vertices pairing and guillotine cut technique is designed to solve the reasonable orientation problem.Taking the Jinan's road orientation problem as an instance, a reasonable plan with the algorithm RO is provided. |
| |
| Keywords: | orientation reasonable orientation idea of nearest pairing guillotine cut technique algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
