城市最优乘车方案算法的研究  

An Algorithm Research on the Optimal Transfer Strategy for City Traveling

作　　者：韩光鹏[1] 

机构地区：[1]武汉大学国家多媒体软件工程技术研究中心,武汉430072

出　　处：《武汉理工大学学报》2004年第6期92-94,99,共4页Journal of Wuhan University of Technology

摘　　要：利用图论、集合论和多叉树型结构广度优先搜索的思想设计了一套求市内乘车最优解的算法 ;针对一个模拟城市按计算机软件制作的要求 ,描述了一个以行路指南系统为主的开发过程 ,并通过对一个实例的分析 ,表明该算法正确、实用、方便、有效。该项研究成果也为城市电子地图设计和物流配送站点布局提供了一种算法框架。By utilizing the graph theory,the set theory and the idea of extensive and preferential retrieval of the multi-fork tree-type structure,an optimal transportation scheme algorithm designed in a city is presented.Aimed at a simulant city and according to the request of the software production,a development course in the main of the transportation guide system is described.From an example,the algorithm is proved right,applicable,convenient and valid.The research result also offered a kind of algorithm frames for design of the urban e-maps and layout of the distribution stations of material flow.

关 键 词：最优解 算法 公交 软件 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]