File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
  • Find via Find It@HKUL
Supplementary

Article: The Determination of Critical Junctions for Transport Network

TitleThe Determination of Critical Junctions for Transport Network
城市實時交通監測中關鍵路口的選擇
Authors
KeywordsTraffic sensor (交通傳感器)
Optimal location (最優布設)
Vertex cover (頂點覆蓋)
Issue Date2005
PublisherDi li xin xi shi jie bian ji bu (地理信息世界編輯部).
Citation
Geomatics World, 2005, v. 3 n. 2, p. 6-9, 17 How to Cite?
Abstract
By using the vertex cover algorithm in graph theory and network analysing techniques in GPS, the paper explores method in determining critical road network junctions for the optimum location of non-intrusive sensors for real-time traffic monitoring and data collection. The objective of the paper is to find the optimal location of junctions for placing sensors to maximally cover the road network under different budgets and requirements. Since the problem is NP-complete, a greedy-based heuristic method is proposed in finding the optimal junctions.
DescriptionFulltext link (for HKU subscribed user): http://library.hku.hk/record=b3767842
Persistent Identifierhttp://hdl.handle.net/10722/89742
ISSN

 

DC FieldValueLanguage
dc.contributor.authorYue, Yen_HK
dc.contributor.authorYeh, AGOen_HK
dc.date.accessioned2010-09-06T10:01:14Z-
dc.date.available2010-09-06T10:01:14Z-
dc.date.issued2005en_HK
dc.identifier.citationGeomatics World, 2005, v. 3 n. 2, p. 6-9, 17en_HK
dc.identifier.citation地理信息世界, 2005, v. 3 n. 2, p. 6-9, 17-
dc.identifier.issn1672-1586-
dc.identifier.urihttp://hdl.handle.net/10722/89742-
dc.descriptionFulltext link (for HKU subscribed user): http://library.hku.hk/record=b3767842-
dc.description.abstractBy using the vertex cover algorithm in graph theory and network analysing techniques in GPS, the paper explores method in determining critical road network junctions for the optimum location of non-intrusive sensors for real-time traffic monitoring and data collection. The objective of the paper is to find the optimal location of junctions for placing sensors to maximally cover the road network under different budgets and requirements. Since the problem is NP-complete, a greedy-based heuristic method is proposed in finding the optimal junctions.zh_HK
dc.description.abstract本文利用圖論中的頂點覆蓋算法和GIS中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。其目的在于選擇最少的路口點而覆蓋最大的路網范圍,從而最大限度地掌握交通流在路網上的分布和變化。由于頂點覆蓋是一個NP完全問題,本文將采用一個啟發式算法,并在一個模擬的路網結構上進行解算。-
dc.languagechi-
dc.publisherDi li xin xi shi jie bian ji bu (地理信息世界編輯部).en_HK
dc.relation.ispartofGeomatics Worlden_HK
dc.relation.ispartof地理信息世界-
dc.subjectTraffic sensor (交通傳感器)zh_HK
dc.subjectOptimal location (最優布設)zh_HK
dc.subjectVertex cover (頂點覆蓋)zh_HK
dc.titleThe Determination of Critical Junctions for Transport Networken_HK
dc.title城市實時交通監測中關鍵路口的選擇-
dc.typeArticleen_HK
dc.identifier.emailYue, Y: yueyang@hkusua.hku.hken_HK
dc.identifier.emailYeh, AGO: hdxugoy@hkucc.hku.hken_HK
dc.identifier.authorityYeh, AGO=rp01033en_HK
dc.identifier.hkuros117640en_HK
dc.identifier.hkuros143422-
dc.identifier.hkuros108278-
dc.identifier.volume3-
dc.identifier.issue2-
dc.identifier.spage6-
dc.identifier.epage9, 17-
dc.publisher.placeHaerbin Shi (哈爾濱市)-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats