检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:连剑[1] 许钦泰[1] 王永[1] 陈铮[1] 樊铭渠[1]
出 处:《交通运输工程与信息学报》2009年第3期68-72,共5页Journal of Transportation Engineering and Information
摘 要:本文充分考虑了乘客出行心理后,设计了以换乘次数最少和出行耗时最少作为约束目标的公交出行最优路径算法。利用动态分段技术建立了公交信息数据库,采用Visual C#.NET+MapX5.0集成开发的方式开发了公交信息查询系统,实现了输入查询或直接对地图操作来获得出行最优路线和换乘方案。系统以济南市公交网络为基础进行了测试,测试结果良好,为居民的出行提供了一个方便、快捷的公交路线查询平台。This paper studied the optimal route algorithm of the city public transportation. In view of the passengers' traveling psychology, an optimal route algorithm of the city public transportation, which takes the least transfer and the least time consuming as constraint conditions, was designed. In the process, adatabase of the public transportation information by using dynamic segmentation and a city public transportation query system, which selectes a development method, integrated a Visual C#.NET+MapX5.0, were designed. By entering the query information or operating the digital map directly, the user could acquire an optimal path or scheme of transfer to another bus. It provided a convenient and quick public transportation route query platform for people's travel.
分 类 号:U495[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30