.
3.9. ³öÐзֲ¼Á¿Ô¤²â
·Ö²¼½»Í¨Á¿µÄÔ¤²âÒ»°ãÓÐÁ½Àà·½·¨£¬·Ö±ðΪÔö³¤ÏµÊý·¨ºÍ×ۺϷ¨£¬Ôö³¤ÏµÊý·¨ÓÖ°üº¬³£ÏµÊý·¨¡¢Æ½¾ùÔö³¤ÏµÊý·¨¡¢µ×ÌØÂÉ·¨¡¢¸£À³ÌØ·¨¡¢¸£Äá˹·¨¡£×ۺϷ¨°üÀ¨ÖØÁ¦Ä£ÐÍ·¨¡¢½éÈë»ú»áÄ£ÐÍ·¨¡¢×î´óìØÄ£ÐÍ·¨µÈ£¬²¿·Ö·½·¨±È½Ï¸´ÔÓ£¬¼ÆËãÁ¿´ó£¬µ«ÊǽèÖútransCADÄÚ²¿ÒÑÖÃÈëµÄÄ£ÐÍÎÒÃÇ¿ÉÒÔºÜÇáËɵØÀûÓÃÕâЩģÐÍÍê³ÉÔ¤²â¡£
3.9.1Éú³ÉСÇø¼äµÄ³öÐÐ×迹¾ØÕó
Ê×ÏÈ£¬´ò¿ªÂ·ÍøÊý¾Ý£¬½«node²ãÉèΪ¿É¼û²¢ÉèÖÃΪµ±Ç°²ã£¬µã»÷Êý¾Ý£¬¿ÉµÃÏÂͼ3.3.26ËùʾÊý¾Ý¡£
ͼ3.3.26 µã²ãÊý¾Ý
Ñ¡Ôñ²Ëµ¥À¸Selection-Select by Condition£¬ÔÚEnter a ConditionÖÐÊäÈëindex<>null£¬ÈçÏÂͼ3.3.27Ëùʾ£¬ÔòÖÊÐĵ㱻ѡÔñÁ˳öÀ´¡£
ͼ3.3.27 ½«ÖÊÐĵãÑ¡Ôñ³öÀ´
.
.
ͼ3.3.28 ±»Ñ¡³öÖÊÐĵãµÄ·Íø
Ñ¡³öÖÊÐĵãÖ®ºó£¬¾Í¿ÉÒÔ¶ÔÖÊÐĵãÖ®¼äµÄ×迹½øÐмÆË㡣ѡÔñ²Ëµ¥À¸ÖÐNetworks/Paths¡ªMultiple Paths£¬ÊäÈ뽨Á¢µÄÍøÂçÎļþ£¬È·¶¨£¬ÈçÏÂͼ3.3.29Ëùʾ£¬½«Ê±¼äÉèΪ×îС£¬²¢Ñ¡ÔñMatrix FileÑ¡Ïµã»÷OKºó±£´æÔÚMatrixÎļþ¼ÐÏ¡£µÃµ½×迹¾ØÕó¡£
ͼ3.3.29 ½¨Á¢×迹¾ØÕó
.
.
3.9.2Ôö³¤ÏµÊý·¨
ÎÒÃÇÐèÒª´ò¿ªÁ½×éÊý¾Ý£¬Ò»¸öÊÇ֮ǰ·´ÍƵÄÏÖ×´OD¾ØÕ󣬻¹ÓÐÒ»¸öÊÇδÀ´ÄêµÄ³öÐз¢ÉúÎüÒýÁ¿Êý¾Ý±í£¬Èçͼ3.3.31Ëùʾ¡£
ͼ3.3.30 ×迹¾ØÕó
ͼ3.3.31 ÐèҪ׼±¸µÄÁ½×éÊý¾Ý
µã»÷²Ëµ¥À¸Planning¡ªTrip Distribution¡ªGrowth Factor Method¡£ÔÚÓÒϽǵķ¢ÉúÎüÒýÁ¿·Ö±ðÑ¡ÔñP_FURºÍA_FUR£¬µã»÷OK±£´æ¡£
.
.
ͼ3.3.32 Ôö³¤ÏµÊý·¨
Ô¤²â½á¹ûÈçÏÂͼ3.3.33¡«Í¼3.3.35£º
ͼ3.3.33 2014Äê³öÐзֲ¼Á¿Ô¤²â½á¹û
ͼ3.3.34 2015Äê³öÐзֲ¼Á¿Ô¤²â½á¹û
.