公交出行最优路径搜索的有向赋权图模型  

Weighted directed graph model for searching optimal travel routes by public transport

作　　者：姚春龙[1] 李旭[1] 沈岚[1] 

机构地区：[1]大连工业大学信息科学与工程学院,辽宁大连116034

出　　处：《计算机应用研究》2013年第4期1058-1063,共6页Application Research of Computers

摘　　要：当前的公交查询系统和模型在处理多目标和多模式查询时,存在着描述困难和缺乏灵活性的问题。为此,基于有向赋权图提出了一种新的公交出行最优路径搜索模型。该模型不仅可以让用户设定可接受的最大步行距离,而且通过灵活的赋权策略利用最短路径搜索算法可以满足个性化的查询要求,尤其是在多目标查询方面具有较强的表达能力。以真实的公交数据实验表明提出的模型有效、实用。For present public transport inquiry systems and models, there exists issues of difficulty in expressing and lack of flexibility in dealing with multi-criteria and multi-modal queries. Therefore, this paper proposed a new model for searching optimal travel routes by public transport based on the weighted directed graph. It could set the acceptable maximum walking distance by users, and could satisfy the personalized needs of users by using flexible strategies of assigning weights. Especially, the model had a good ability to express muhi-criteria queries. Experiments using real public transport data show that the model proposed is effective and practical.

关 键 词：公交查询系统 有向赋权图 最短路径 多目标 

分 类 号：TP39[自动化与计算机技术—计算机应用技术]