File Download
 
 
Supplementary

Article: The Determination of Critical Junctions for Transport Network
  • Basic View
  • Metadata View
  • XML View
TitleThe Determination of Critical Junctions for Transport Network
城市實時交通監測中關鍵路口的選擇
 
AuthorsYue, Y
Yeh, AGO
 
KeywordsTraffic sensor (交通傳感器)
Optimal location (最優布設)
Vertex cover (頂點覆蓋)
 
Issue Date2005
 
PublisherDi li xin xi shi jie bian ji bu (地理信息世界編輯部).
 
CitationGeomatics World, 2005, v. 3 n. 2, p. 6-9, 17
地理信息世界, 2005, v. 3 n. 2, p. 6-9, 17 [How to Cite?]
 
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.
本文利用圖論中的頂點覆蓋算法和GIS中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。其目的在于選擇最少的路口點而覆蓋最大的路網范圍,從而最大限度地掌握交通流在路網上的分布和變化。由于頂點覆蓋是一個NP完全問題,本文將采用一個啟發式算法,并在一個模擬的路網結構上進行解算。
 
DescriptionFulltext link (for HKU subscribed user): http://library.hku.hk/record=b3767842
 
ISSN1672-1586
 
DC FieldValue
dc.contributor.authorYue, Y
 
dc.contributor.authorYeh, AGO
 
dc.date.accessioned2010-09-06T10:01:14Z
 
dc.date.available2010-09-06T10:01:14Z
 
dc.date.issued2005
 
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.
 
dc.description.abstract本文利用圖論中的頂點覆蓋算法和GIS中的網絡分析技術,對非嵌入式傳感器在路網中的最優定位問題,即關鍵路口點的選擇問題進行了探討。其目的在于選擇最少的路口點而覆蓋最大的路網范圍,從而最大限度地掌握交通流在路網上的分布和變化。由于頂點覆蓋是一個NP完全問題,本文將采用一個啟發式算法,并在一個模擬的路網結構上進行解算。
 
dc.descriptionFulltext link (for HKU subscribed user): http://library.hku.hk/record=b3767842
 
dc.identifier.citationGeomatics World, 2005, v. 3 n. 2, p. 6-9, 17
 
dc.identifier.citation地理信息世界, 2005, v. 3 n. 2, p. 6-9, 17 [How to Cite?]
 
dc.identifier.epage9, 17
 
dc.identifier.hkuros117640
 
dc.identifier.hkuros143422
 
dc.identifier.hkuros108278
 
dc.identifier.issn1672-1586
 
dc.identifier.issue2
 
dc.identifier.spage6
 
dc.identifier.urihttp://hdl.handle.net/10722/89742
 
dc.identifier.volume3
 
dc.languagechi
 
dc.publisherDi li xin xi shi jie bian ji bu (地理信息世界編輯部).
 
dc.publisher.placeHaerbin Shi (哈爾濱市)
 
dc.relation.ispartofGeomatics World
 
dc.relation.ispartof地理信息世界
 
dc.subjectTraffic sensor (交通傳感器)
 
dc.subjectOptimal location (最優布設)
 
dc.subjectVertex cover (頂點覆蓋)
 
dc.titleThe Determination of Critical Junctions for Transport Network
 
dc.title城市實時交通監測中關鍵路口的選擇
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Yue, Y</contributor.author>
<contributor.author>Yeh, AGO</contributor.author>
<date.accessioned>2010-09-06T10:01:14Z</date.accessioned>
<date.available>2010-09-06T10:01:14Z</date.available>
<date.issued>2005</date.issued>
<identifier.citation>Geomatics World, 2005, v. 3 n. 2, p. 6-9, 17</identifier.citation>
<identifier.citation>&#22320;&#29702;&#20449;&#24687;&#19990;&#30028;, 2005, v. 3 n. 2, p. 6-9, 17</identifier.citation>
<identifier.issn>1672-1586</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/89742</identifier.uri>
<description>Fulltext link (for HKU subscribed user): http://library.hku.hk/record=b3767842</description>
<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.</description.abstract>
<description.abstract>&#26412;&#25991;&#21033;&#29992;&#22294;&#35542;&#20013;&#30340;&#38914;&#40670;&#35206;&#33995;&#31639;&#27861;&#21644;GIS&#20013;&#30340;&#32178;&#32097;&#20998;&#26512;&#25216;&#34899;,&#23565;&#38750;&#23884;&#20837;&#24335;&#20659;&#24863;&#22120;&#22312;&#36335;&#32178;&#20013;&#30340;&#26368;&#20778;&#23450;&#20301;&#21839;&#38988;,&#21363;&#38364;&#37749;&#36335;&#21475;&#40670;&#30340;&#36984;&#25799;&#21839;&#38988;&#36914;&#34892;&#20102;&#25506;&#35342;&#12290;&#20854;&#30446;&#30340;&#22312;&#20110;&#36984;&#25799;&#26368;&#23569;&#30340;&#36335;&#21475;&#40670;&#32780;&#35206;&#33995;&#26368;&#22823;&#30340;&#36335;&#32178;&#33539;&#22285;,&#24478;&#32780;&#26368;&#22823;&#38480;&#24230;&#22320;&#25484;&#25569;&#20132;&#36890;&#27969;&#22312;&#36335;&#32178;&#19978;&#30340;&#20998;&#24067;&#21644;&#35722;&#21270;&#12290;&#30001;&#20110;&#38914;&#40670;&#35206;&#33995;&#26159;&#19968;&#20491;NP&#23436;&#20840;&#21839;&#38988;,&#26412;&#25991;&#23559;&#37319;&#29992;&#19968;&#20491;&#21855;&#30332;&#24335;&#31639;&#27861;,&#24182;&#22312;&#19968;&#20491;&#27169;&#25836;&#30340;&#36335;&#32178;&#32080;&#27083;&#19978;&#36914;&#34892;&#35299;&#31639;&#12290;</description.abstract>
<language>chi</language>
<publisher>Di li xin xi shi jie bian ji bu (&#22320;&#29702;&#20449;&#24687;&#19990;&#30028;&#32232;&#36655;&#37096;).</publisher>
<relation.ispartof>Geomatics World</relation.ispartof>
<relation.ispartof>&#22320;&#29702;&#20449;&#24687;&#19990;&#30028;</relation.ispartof>
<subject>Traffic sensor (&#20132;&#36890;&#20659;&#24863;&#22120;)</subject>
<subject>Optimal location (&#26368;&#20778;&#24067;&#35373;)</subject>
<subject>Vertex cover (&#38914;&#40670;&#35206;&#33995;)</subject>
<title>The Determination of Critical Junctions for Transport Network</title>
<title>&#22478;&#24066;&#23526;&#26178;&#20132;&#36890;&#30435;&#28204;&#20013;&#38364;&#37749;&#36335;&#21475;&#30340;&#36984;&#25799;</title>
<type>Article</type>
<identifier.hkuros>117640</identifier.hkuros>
<identifier.hkuros>143422</identifier.hkuros>
<identifier.hkuros>108278</identifier.hkuros>
<identifier.volume>3</identifier.volume>
<identifier.issue>2</identifier.issue>
<identifier.spage>6</identifier.spage>
<identifier.epage>9, 17</identifier.epage>
<publisher.place>Haerbin Shi (&#21704;&#29246;&#28657;&#24066;)</publisher.place>
</item>