QQ客服 官方微博 反馈留言

	Algorithm for road network graph partitioning
	Qin Xuyan ; Lu Huapu ; Ma Hong
	2010-10-12 ; 2010-10-12
关键词	Practical Theoretical or Mathematical/ network theory (graphs) parallel algorithms road traffic transportation/ road network graph partitioning heuristic algorithm parallel system dynamic traffic assignment methodology transportation system road grid parallel LAN personnel computers computation/ B8520 Transportation B0250 Combinatorial mathematics C7445 Traffic engineering computing C1160 Combinatorial mathematics C4240P Parallel programming and algorithm theory
中文摘要	A heuristic algorithm was developed for network graph partitioning based on a parallel system dynamic traffic assignment methodology. Unlike current algorithms, this algorithm is specially designed for road networks in transportation systems. The road grid is first mapped onto a vector network, then a growth method is used for the network partitioning. Compared with current algorithm, the algorithm allows graph partitioning of any size system without repeated iterations. Thus, the algorithm is efficient and gives excellent results. The algorithm is quite general and can be applied on IBM compatible computer and parallel LAN environments using standard personnel computers computations.
语种	中文
出版者	Tsinghua University Press ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/82057]
专题	清华大学
推荐引用方式 GB/T 7714	Qin Xuyan,Lu Huapu,Ma Hong. Algorithm for road network graph partitioning[J],2010, 2010.
APA	Qin Xuyan,Lu Huapu,&Ma Hong.(2010).Algorithm for road network graph partitioning..
MLA	Qin Xuyan,et al."Algorithm for road network graph partitioning".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。