File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Article: The Determination of Critical Junctions for Transport Network
Title | The Determination of Critical Junctions for Transport Network 城市實時交通監測中關鍵路口的選擇 |
---|---|
Authors | |
Keywords | Traffic sensor (交通傳感器) Optimal location (最優布設) Vertex cover (頂點覆蓋) |
Issue Date | 2005 |
Publisher | Di li xin xi shi jie bian ji bu (地理信息世界編輯部). |
Citation | Geomatics World, 2005, v. 3 n. 2, p. 6-9, 17 How to Cite? 地理信息世界, 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. 本文利用圖論中的頂點覆蓋算法和GIS中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。其目的在于選擇最少的路口點而覆蓋最大的路網范圍,從而最大限度地掌握交通流在路網上的分布和變化。由于頂點覆蓋是一個NP完全問題,本文將采用一個啟發式算法,并在一個模擬的路網結構上進行解算。 |
Persistent Identifier | http://hdl.handle.net/10722/89742 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yue, Y | en_HK |
dc.contributor.author | Yeh, AGO | en_HK |
dc.date.accessioned | 2010-09-06T10:01:14Z | - |
dc.date.available | 2010-09-06T10:01:14Z | - |
dc.date.issued | 2005 | en_HK |
dc.identifier.citation | Geomatics World, 2005, v. 3 n. 2, p. 6-9, 17 | en_HK |
dc.identifier.citation | 地理信息世界, 2005, v. 3 n. 2, p. 6-9, 17 | - |
dc.identifier.issn | 1672-1586 | - |
dc.identifier.uri | http://hdl.handle.net/10722/89742 | - |
dc.description.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. | zh_HK |
dc.description.abstract | 本文利用圖論中的頂點覆蓋算法和GIS中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。其目的在于選擇最少的路口點而覆蓋最大的路網范圍,從而最大限度地掌握交通流在路網上的分布和變化。由于頂點覆蓋是一個NP完全問題,本文將采用一個啟發式算法,并在一個模擬的路網結構上進行解算。 | - |
dc.language | chi | - |
dc.publisher | Di li xin xi shi jie bian ji bu (地理信息世界編輯部). | en_HK |
dc.relation.ispartof | Geomatics World | en_HK |
dc.relation.ispartof | 地理信息世界 | - |
dc.subject | Traffic sensor (交通傳感器) | zh_HK |
dc.subject | Optimal location (最優布設) | zh_HK |
dc.subject | Vertex cover (頂點覆蓋) | zh_HK |
dc.title | The Determination of Critical Junctions for Transport Network | en_HK |
dc.title | 城市實時交通監測中關鍵路口的選擇 | - |
dc.type | Article | en_HK |
dc.identifier.email | Yue, Y: yueyang@hkusua.hku.hk | en_HK |
dc.identifier.email | Yeh, AGO: hdxugoy@hkucc.hku.hk | en_HK |
dc.identifier.authority | Yeh, AGO=rp01033 | en_HK |
dc.identifier.hkuros | 117640 | en_HK |
dc.identifier.hkuros | 143422 | - |
dc.identifier.hkuros | 108278 | - |
dc.identifier.volume | 3 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 6 | - |
dc.identifier.epage | 9, 17 | - |
dc.publisher.place | Haerbin Shi (哈爾濱市) | - |
dc.identifier.issnl | 1672-1586 | - |