Evaluation of the reconstructing scheme making streets one-way

š @ V i f f ^ Q f ^ 2 7 Vol2, No7 200 7 Systems Engineering Theory & ractice July, 200 : 1000-67(200)07-0153-07 "!$#"& ')(*( 1 2, +*,*- (1 /02130452673026, / 210016 2 /021304526:<=>?26, / 210016) ACBEDEFHGJIHKELJMENEOHEQJRESET, UEVWZYE[E\, E^H_ E`JabZcEdEeEf, `JaEHkElJmHnJoEpHJqHr IHsJtHuJv Jx gzhei n 1, n 2 w _JyEz JN n 1 + 1 E EH~JE^E n 2 + 1 H JH~JE^ JBED ^E H_ `Ja ƒz H_J H J EÊiE EGJŠ Eˆ, EŒHJŽH J xe E E E E, w E E H deẽ Eš sej Eœ `J, _J w E EžHŸJ _J deẽ se E fh J E H_J H EJŒHJŽH J E EV GŠE E J ªqE«E J ª E J, ²ª³ ª s gµ ª ª ª¹ Ÿº» ª `aªqª½ Vª¾ vª ªÀ ÁªÂªt ü à ª Ūƪ ª ªq rejneçeè ÉEÊEË ÌJÍ _JyEzEE^H_ i ^ w E ÁE ÎEÏEÐEÑEÒ O1575 ÓEÔEÕEÖE A Evaluation of the reconstructing scheme making streets one-way WU Wei-wei 1, NING uan-xi 2 (1 Civil Aviation College, Naning University of Aeronautics and Astronautics, Naning 210016, China 2 College of Economics and Management, Naning University of Aeronautics and Astronautics, Naning 210016,China) Abstract With the increasing of the vehicles in the city, the traffic am is much more seriously At present, the reconstructing scheme making streets one-way is often used internationally The grid graphs consisting of n 1 + 1 east-west avenues and n 2 + 1 north-south streets, for n 1, n 2 sufficiently small, are studied in this paper It is possible to find multi-scenarios reconstructing the grid graphs The emphasis on how to evaluate the optimal reconstructing scheme For the sake of the stochastic flow in the network, the saturated flow between the two vertexes is multi-value In the case of the most seriously traffic am, the saturated flow is minimum Adding the minimum saturated flow could improve the traffic performance Based on two indices of the expected flow and the bias-variance of the stochastic saturated flow between the two vertexes, this paper presents an evaluative model having multi-obects to solve the optimal reconstructing scheme Finally the validity of this evaluation is illustrated with an example Keywords graph theory city street grid one-way street minimum saturated flow simulation 1 ØÚ٠۪ܪݪުߪàªáªâªãªäªåªæªçªèªéªêªãªëªìªíªî ߪàðïµñªòªó ݪުߪà ôõªöª ªøªùªúªûªüªý,,, þ ÿ ã à EÝEÞ ªßEàªòEöªøªù ªã,!#"$'& : 2005-12-26 (#)#*+ :,#-'/#0#1#2#3 (002041C) J#K#L#M (70571037) 4#5#6#7#6###1#:##<#=#0?>#2?3 (1007-0731) @#A#B#C#D#E#0#>#F#G#H#I : N#O#O (172 ),, Q#R, C#D#E, S#T#>#U#VW'#Y#Z#[#\#I

è a u u i O Þ ü Ž ã ƒ Š ä 154 _^_`_acb_d_e_f_g 2 h i k l m n, o p q 20 r s 30 ì t, ÝEÞuwvEã x y z ã à 200 ~, ƒ ãeýeþ ˆ Š à wœ, 1000 Ž, 6 é ï à Eã Š š Eã 3400 ~, p œ 20, žeþ 3 ã à ôã ôõªã à u Ÿ, Ÿ ª, «Ÿ ² ³ Éà µ ª Robbins [1 ¹ º» à Eã ½ ¾ ª, Roberts [2, Boesch and Tindell [3 [4 Chung, et al ¹ i ÀEã Á  à Roberts and u [5 7 Å ÆHôwÇ ÈEã É n 1 + 1 w Eè EãEÝEÞ HôJã º» à n 2 + 1 Ê Ëw ª áì ôõí ²ÐѲªãÍÒ ÐºÍÓ ª, ÎÏ, ÔÕÖ Ø ªãÍÒ ÙÚÛ Ü ª ߪà ôõ u Íß ÍߪãªÛáâ, Ý Þ à, Íß åæç ã èíß ãä, ÍÒéê ôõªãëìªö ²íªæîªöª ÓðÍß è ñ ò óô, ï à, æîªöª ªã ôõ u ÍÒ åõªîö ÍÒªûªû ä Ð º Í ³ ùeè Í ôjõ í ùeè È ú Ó ² Ð Ñ ² ³ Éã û î ý uw þ, ø [, Î Ï ü ùeè Ô î ö Í ÒEã î ý ôjõeã ùeè Í EÛ á âªè âªã ² ùeè Í Eã, «ä ÿ ü, å HôJõEãEöE, º ùeè Í Eá ÌHôJõ Í Eã º Í Ë ÓHôJõuwð EöE Eö, ï º, ² ³ ªãºªàå º ùªèí ôõªöª ºªüªýÓªãùªèÍ Ï Ü, Ï ² ³ Éã º Eà å ã ÆHôwÇ ÈEã É Eè Eã ÝEÞ HôJã n 1 + 1 w n 2 + 1 Ê Ëw û, n 1, n 2 Ÿ ¹ Ü EãEöE å Ð ã Ü, «ä, v!"#eã HôJõ, ã ÝEÞ Hô ' ( n 1 = n 2 = 2 ($ 1) & Hô ¹ * + Ž ), * +u ² ³ ÉÛ á ùeè ÍEã ) Ù, -  á / º 0 1 2 3 4 5 6, 7 : * + 2 =?>?@?A?B?CED F G 1 HJI KLJM, N O v i Q R Φ vi S T U v i V W O HJI Q Y Z [ \ H U v i V ^ O HJI Q Y Z [ _ R, ` Φ vi = c i c i (1) M, c i V v i v Q Y F G 2 bjkljmc d O e f O g h i k l m n : o m n p H q S r Itsvu w [, x _ V c d O e f O r Ï y z m n 1 ~~~ ~ F 1 KLJMƒ d O [ f O _ Q R N O S ˆ Š O Œ a Q R Ž Q Y Z [ Q Y Z [ o Ž O V w [, ` Q Y Z [, k H Y š, h o O œ ž Y Š Ÿ x _ V ˆ Š O KLJM ˆ Š O, KL Q œ Š 2, J f i /c i ª o Y /Q Y «O S O Q R, O B S ˆ Š O Mc s e t J² š g h y z m, w [ ³ š µ Š w [ ³ V 5 (¹ 2(c)) º H» w [ ³ V 10 (¹ 2(a)), w [ ³ ½ (a) (b) (c) 2 (a) ¾~ ~À~Á~ =10 (b) ~À~Á~ =(c) ¾~Ã~À~Á~ =5

ƒ K ( 5 2 k 5 a 5 S 7 Å Æ~Ç~Ç, È : É~Ê~Ë~Ì~Í~Î~Ï~Ì~Ð~Ñ~Ò~Ó~Ô~Õ~Ö 155 Ø 1 h Ù ÚJÏ Û Ü Ý Þ K M, Ý Þ ß à O á V KL N O, Ý Þ á V â l ãjï ä å Y ä, æ V ç Ý Þ Û Ü è k é Ý Þ Kê ë V HJI KL KLJM ð ñ Q Y, S m ì h í î ï Û Ü ò ó Ø 2 Ü ô h ojkl c õ Ž O» e ö k Ž O øúù û o üú Ý Þ m n Ü ý 2 1 M Kÿþ Ý Þ, Ý Þ ß à O ª p ÿð ñ S Ý Þ Z Q Ÿ í î ï Û Ü Z ò ó U p Ý Þ ê ë V HJI, 3 3 ~~ 3!"#$E@ *+ KLJM & '() [ KL ˆ Š O g h, KL w [ ³ ½, w [ 1 2,- '( / /+ * ½, Ù â N O _ ï w [ ½ / '0 y1, w [ 234 I 5 k ³ KLJM â N O _ ï w [ 67 ³, : å< _ ï => Û è KL â N O _ ï 67 Û ³? ¹@A [: n V'( w [ B (` w [ ³ * ³ p i (k) V E w [ ³ 23 FG KLJMOH _ ï Û è, E(F i ) = DC, Q n F i (k)p i (k), (2) k=1 ) E(F i ) V N O i, _ ï Y 67 ³ F i (k) V E w [ 67 Û ³ i k TI S šj h OH _ ï w [ ½JM, Q 6 7 ³ w [ S Ÿ K 7 L Ù M N, U O @ 0 6 7 ³ w [ ³ \ 6 7 ³ R S T U R S T U V, ª KÿL M W 6 7 ³ w [ ½, KÿL Û Ü ) R, å _, Û Ü ) RSTU V KL Û Ü ) @A [10? ž OH _ ï '( w [ R ã R ³ 2Y, â N O i, ^ _ ï '( w [ F i R ã RZ[ \ S 67 ³ F i ³ \ 67 RSTU n 1 V`_a67 ³ w [ ³ n 1 D (F i ) = [F i (k) E(F i ) 2 p i (k), F i (k) < E(F i ), (3) DC 4 bc#defg Bhik k=1 Kþ H n 1 +1 llmji Ý Þ [ n 2 +1 lnoji Ý Þ pq Þ mjk, ª V G = G (n1+1) (n 2+1) = (V, E), G M «O v i :i = 1, 2,, n 1 + 1, = 1, 2,, n 2 + 1,n 1 1, n 2 1, ¹ ª V O 4 G HJIar Û î < Ý Þ Kas u Stu KL, [v ~ K Û Ü è, cz O ª V : aw 4 Ý Þ Kär Ý Þ K Û Ü è z ü Ý Þ K Ma w 1 = v 11, w 2 = v 1(n2+1), w 3 = v (n1+1)1, w 4 = v (n1+1)(n 2+1) ~ T Ý Þ K, S Vxy i k ü O S [ Ý Þ Kar

Ù Þ ç Þ â E 0 ç 156 ˆ Š Œ 41 Ž Q 1 V Ý Þ â šÿ Ü ã, í I ß Û œ k H ä ž Ÿ Ü Þ m, s Þ m / R š, Q 2 Û Ü è ä, ` mjk ˆ, í Ü ã 0 2 í Ü Þ Þ m Û Ü èª e xy ç«újï Û Ü Þ m V íjï Û Ü, íji Þ m Q Y Ý Þ Z Q Y 3 pq Þ S pq ß Û, U k š² 4 Þ m I(A) 1 < 0, ³ N O µ H k l [ k l 2 í Ü, ` N O A ã 2 U O(A) 1, N O A U 0 5 Ý Þ K M, OH _ ï Ù ö ) 42 Ž ¹ n 1, n 2 º» F 2 Kþ H n 1 + 1 llmji Ý Þ [ n 2 + 1 lnoji Ý Þ pq Þ mjk G M, b H³ l Ý Þ ½ Ü í Ü Þ, n 1 + 1, n 2 + 1 œ S¾ Œ h Þ mjk G M ( 4), \ ³ ~ 0 O H À ~ H â l, U Þ m OÁ : I(w i ) = O(w i ) = 1, i = 1, 2, 3, 4 (4) n 1 + 1 SÃ, k llmji Ý Þ [ n 1 + 1 llmji Ý Þ ãjï k kå Q, UÆÇE / : 1) n 1 + 1 SÃ, b w 1 w 2, w 3 w 4 b w 3 w 1, O(w 3 ) = 2 b w 1 w 3, O(w 1 ) = 2 2) n 2 + 1 SÃ, b w 1 w 3, w 2 w 4 b w 1 w 2, O(w 1 ) = 2 b w 2 w 1, O(w 2 ) = 2 3) n 1 + 1 [ n 2 + 1 S¾, b w 1 w 2, w 4 w 3, b w 3 w 1, w 2 w 4 b w 2 w 1, w 3 w 4, b w 1 w 3, w 4 w 2 U p È ÙÉ, E /Á (4), U o Ê ªË O @ÌÍ S n 1 = 2, n 2 = 2 KþJKL, ¹ 3 1-2-3 [ 1-4-7 S pq Þ, Î i â l ð ñ Þ m š½ Ü í Ü Þ, ÏÐ ÚJÏ Û Ü U p, x ã a, b, 5, 6 43 ÑÒ ÓÔ ÕÖ Ø F i SÚ I G MN O i, _ ï w [ ³ Fi, F i, E(F i ), D (F i ) æ S HJI O MN O i, _ ï V w [ ³, w [ ³, 67 Û ³, R ã R ³ Û Ü UÆÇ : LL(O) : : < ã ã \ S L(G) = i V min F i : V (5) L(O) = i V min F i : V, (6) D (O) = maxd (F i ) : V (7) i V LL(O) = i V Ý = * Ü V ë äh µ k 3 4 5 6 ` V : [minf i : V minf i : V = L(O) L(G) () L(O) V ë Ü Ü D (O) ë Ú I KL, Ù Þ H E ã, H Ü L(O) V ë µ ã Ùß ù û, m E 5 ~~ àáâã a 6 ~~ àáâã b

S I E ˆ ¹ ç M â Ù ó S äå 7 Å Æ~Ç~Ç, È : É~Ê~Ë~Ì~Í~Î~Ï~Ì~Ð~Ñ~Ò~Ó~Ô~Õ~Ö 157 C Ü læ : H Ú I : çè 41 5 bcdeé!"#$e@ ê Ý Þ K Maëì â N O _ ï 1 = max(ll(o)) s s = 1,, m () 2 = min(d (O)) s s = 1,, m (10) m E / Æ w [ ³ JKLJMm`ïaðñ O ö e Q V Š Ù, cz í Ý Þ K M ë ì â N O _ ï Ù Þ œ š`ò ˆ ó KL H œ m ì ãji ç : 1 ƒõ O [ ^ O ³ 2 ô \ «O ä À O Q R ³ ø Q ãji V w «O µ H k l ã Ï, ã HJI r Û î [ Q í z w [ íî œ, `JKLJM Mï Ž O Q R ³ w [ V Š, ô [ k l (1) ö 3 MN O 1 e _ ï Û Ü è, &=ù h â N O _ ï ø ý k l m ì É c N O 1 e V Û Ü è 12 z íî w [ úûü ô Q œ Š KÿL ˆ M Y Î Ù ýji U p [ ç J ô Y Î 0 & ãji, ¹ 7, N O Q R ¹ A [11 U µ ã Ù U í KLJMaëì â O _ ï < ê 0 ~ < ê O _ ï Û Ü è Ý Þ 1, 2(KL 3) 1 ~~ àá ~¾~ ~À~Á~ 1 3 7 1 13 13 12 3 13 13 12 7 13 13 12 12 12 12 ³ íª N O 1 e K V [ ~ Q q N O _ ï Š, KL 7 ýþ~ ~~ ÿ ~¾~ w [ ³ V ê ë O _ ï V w [ [ 6 defg# B ã a,b(¹ 5,6) Ma ~ O _ ï '( w [ ½ ½ Ü H â ¹ 3 6! (2), (3) æ, - E ã M ³, ¹ 7 10 3 ~~ àá " ~¾~ ~À~Á~ (âã a) 1 3 7 1 7 13 14 3 14 1 12 7 7 7 7 12 7 12 ~ w [ ³ V 6, íî ã ¹@ FG, UÆ ÌÍ Ý Þ K w [ ³ æ ¹ 2 ~~ àá ~¾~Ã~À~Á~ 1 3 7 1 6 6 6 3 7 6 6 7 7 6 6 7 6 6,-, + 10000 + ˆ O _ ï 6 7 Û ³ [ ' ( w [ R ã R 4 ~~ àá " ~¾~Ã~À~Á~ (âã a) 1 3 7 1 7 3 12 12 7 7 7 7 7 12

@ U K! C I 15 ˆ Š Œ 5 ~~ àá " ~¾~ ~À~Á~ (âã b) 1 3 7 1 14 7 7 3 7 7 7 7 14 1 12 12 12 7 7 ~~ àá " # $~ (âã a) 1 3 7 1 7 13 11 3 13 14 12 7 7 7 7 11 7 12 ~~ àá " & '~À~Á~ ( )â * (âã a) 1 3 7 1 0 07707 02341 3 05164 0444 0 7 0 0 0 0242 0 0 æh Ý Þ _,+ U p Ç - 7 23 pìí ž H Ü ã a, b íî (5) () M Ü L a (O) = 7 + 7 + + 7 = 2 L b (O) = 7 + + 7 + 7 = 2 L(G) = 7 + 6 + 6 + 6 = 25 6 ~~ àá " ~¾~Ã~À~Á~ (âã b) 1 3 7 1 7 7 3 7 7 7 7 12 12 12 12 12 7 ~~ àá " # $~ (âã b) 1 3 7 1 13 7 7 3 7 7 7 7 14 17 12 12 12 7 10 ~~ àá " & '~À~Á~ ( )â * (âã b) ³ : LL a (O) = LL b (O) = 2 25 = 4 D a D b ³, (),(10) M (O) = 05164 + 0 + 07707 + 02341 = 15212 (O) = 00074 + 12154 + 0 + 0 = 1222 Ü ³ ˆ Æ : 1 3 7 1 07777 0 0 3 0 0 0 7 00074 12154 0 0 0 0 1 = max(ll(o)) = maxll a (O), LL b (O) = LL a (O) = LL b (O) 2 = min(d (O)) = mind a (O), D b (O) = D b (O) U p ˆ È, ã b / 01 ã a ) ü Ý Þ K 01, 4567 h E 01 ã Mù û:/ ã [ (6), ÙÉ L a (O) = L b (O) > L(G), `=<,>» :V Š, 01?@ <,>:ABCDEFG 01H@ < >:ABCDE IJ:K 01LM, 01?@ <,> 0NO <,>Q:RST @ BCDE, UVWY?@ <,>BCZ[\:F C^Y, _,G`abcdefgDhi N Bkl @nmo@, pqrcdstpuv wxy=z O q~ J @ ƒ : O B @ˆ Š Œ O CŽ O @ ^ C^Y `š œ, žÿw C, «ª ijc ` š O,²³ pa B µ, 2 (5)

ƒ 7 ¹ ¹, º :» ½ ¾ À Á ¾ Â Ã Å Æ Ç È 15 ÉÊ, ËÌ µíwîï~, C^YÐ`ÑÒÓ, ÔÕÐ=Ö, ØÙ^=Ö, _,GnÚÜÛÝÞß, àáâãä C^Y åæ N Ö,çQèRST BCDEé Œ=Ö«çBC Z[\, êëìí îï C^Y LM, ðñòó=ô,õö ø, ùò úû O ìüýþ, ÿ[ O n 1, n 2 Ù^=Ö C^YËÌ [1 Robbins H E A theorem on graphs, with an application to a problem of traffic control[j Amer Math Monthly, 13, 46: 21 23 [2 Roberts F S Discrete Mathematical Models, with Applications to Social, Biological, and Environmental roblems[m rentice-hall, Englewood Cliffs, NJ, 176 [3 Boesch F, Tindell R Robbins theorem for mixed graphs[j Amer Math Monthly, 10, 7: 716 71 [4 Chung F R K, Garey M R, Tarian R E Strongly connected orientations of mixed multi-graphs[j Networks, 15, 15: 477 44 [5 Roberts F S, u Y On the optimal strongly connected orientations of city street graphs I: Large grids[j SIAM J Disc Math, 1, 1: 1 222 [6 Roberts F S, u Y On the optimal strongly connected orientations of city street graphs II: Two East-West avenues or north-south streets[j Networks, 1, 1: 221 233 [7 Roberts F S, u Y On the optimal strongly connected orientations of city street graphs III: Three East-West avenues or north-south streets[j Networks, 12, 22: 10 143 [ [M :, 2004 Ning The Blocking Flow Theory and Its Applications[M Beiing: Science ress, 2004 [!" Æ#$& [J '()*+,, 2002, 17(3): 337 340 Ning Research on stochastic flow in a transportation network by simulation method[j Journal of Data Acquisition & rocessing, 2002, 17(3): 337 340 [10 ¹ ¹, - Â/0123 45 Æ#$& [J 67, 2006, 14(3): 6 1 Wu W W, Ning Simulation research based on improving the flow capability of emergency network[j Chinese Journal of Management Science, 2006, 14(3): 6 1 [11 ¹ ¹, : <=>?@ABCD [J EFGFHIJ, 2007, 3(5): 65 60 Wu W W, Ning An algorithm for the minimum saturated flow problem of a directed network[j Journal of Naning University of Aeronautics & Astronautics, 2007, 3(5): 65 60