交通網絡促進社會生產、人口流動、資源交換等關鍵人類發展環節，為社會進步之主要動力。隨著城市規模不斷擴大，交通網路日益複雜，不良的交通網絡設計會影響城市發展品質，造成區域性經濟上的損失。如何規劃交通路線以及分配交通資源為現今社會重要課題。
本研究採用網路可靠度 (Network reliability) 方法來解決交通網路問題，網路可靠度是指網路中的起點與終點連結成功之機率，世界上有許多系統皆應用網路架構，因此網路可靠度被廣泛應用各種不同實際的問題和案例中，過去曾有學者利用網路可靠度解決交通服務網路問題，但對於時間的處理不夠細節，無法完整表達現實使用者時間上的需求，同時沒有考慮路線流量會連帶影響整個網路可靠度。
為了使網路模型更貼近現實交通網路，以利更有效率解決問題，本研究對於過去網路可靠度方法進行改善，採用模糊系統 (Fuzzy system) 以及時間窗 (Time Window) 去構築網路模型，利用模糊系統的概念，依照過去經驗、數據或者專家的預測，定義流量、時間與可靠度所屬程度，達到符合實際三者間互相影響的關係；時間窗可以根據現實中對於時間限制來調整，達到完整表達時間的限制條件，此外本研究所使用之網路可靠度演算法為直接演算法，相較於過去的間接演算法，計算時間大幅降低，更能有效率解決現實複雜問題。

The traffic network is the key of human social development such as production, population flow and resource exchange. It is the main driving force for social progress. The traffic network becomes more and more complex. The poor traffic network design affects the urban development and cause regional economic losses. How to plan the traffic routes and allocate traffic resources is an important issue today.
In this study, we apply network reliability to solve the traffic network problem. The network reliability refers to the probability of successfully transport demand between the starting point and the terminal point in the network. Many systems in the world are the network architecture. Therefore, the network reliability has been widely used in many practical problems and cases. In the past, some scholars used network reliability to solve the problem of traffic service network. However, they are not deal with the time restraint in detail so that it can’t express time requirements completely. At the same time, they did not consider network flow will affect the reliability of the network.
In order to solve the problem more efficiently. This study improved the method of network reliability by using the fuzzy system and the time window. We utilize the fuzzy system to define the flow, time and reliability in past data or expert predictions and meet the actual relationship between the three parties. Time window can be adjusted according to the actual time constraints so that it can express time constraints in reality completely. In addition, the network reliability algorithm used in this research is direct algorithm. Its’ time complexity and computation time are faster and more intuitive than the past indirect algorithm, so it can solve real problems more efficiently.

參考文獻
[1] D.J. Papakammenos, E.N. Dialynas, Reliability and cost assessment of power transmission networks in the competitive electrical energy market, IEEE Transactions on Power Systems, 19 (2004) 390-398.
[2] B.S. Dhillon, Transportation systems reliability and safety, CRC press, 2016.
[3] Y.-K. Lin, Performance evaluation for the logistics system in case that capacity weight varies from arcs and types of commodity, International Journal of Production Economics, 107 (2007) 572-580.
[4] W.-C. Yeh, J.-S. Lin, New parallel swarm algorithm for smart sensor systems redundancy allocation problems in the Internet of Things, The Journal of Supercomputing, (2016) 1-27.
[5] J.R. Grout, Influencing a Supplier Using Delivery Windows: Its Effect on the Variance of Flow Time and On‐Time Delivery, Decision Sciences, 29 (1998) 747-764.
[6] J. Zhang, W.H. Lam, B.Y. Chen, On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows, European Journal of Operational Research, 249 (2016) 144-154.
[7] Y. Shen, A new simple algorithm for enumerating all minimal paths and cuts of a graph, Microelectronics Reliability, 35 (1995) 973-976.
[8] W.-C. Yeh, A simple heuristic algorithm for generating all minimal paths, IEEE Transactions on Reliability, 56 (2007) 488-494.
[9] W.-C. Yeh, Search for all MCs in networks with unreliable nodes and arcs, Reliability Engineering & System Safety, 79 (2003) 95-101.
[10] W.-C. Yeh, A simple algorithm to search for all MCs in networks, European Journal of Operational Research, 174 (2006) 1694-1705.
[11] W.-C. Yeh, A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network, IEEE Transactions on Reliability, 47 (1998) 436-442.
[12] W.-C. Yeh, A simple algorithm to search for all d-MPs with unreliable nodes, Reliability Engineering & System Safety, 73 (2001) 49-54.
[13] W.-C. Yeh, A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability, The international journal of advanced manufacturing technology, 20 (2002) 77-81.
[14] W. Yeh, A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance, Journal of the Operational Research Society, 56 (2005) 1235-1240.
[15] W.-C. Yeh, Search for MC in modified networks, Computers & Operations Research, 28 (2001) 177-184.
[16] Y. Iida, Basic concepts and future directions of road network reliability analysis, Journal of advanced transportation, 33 (1999) 125-134.
[17] R.R. Yager, On the measure of fuzziness and negation part I: membership in the unit interval, (1979).
[18] D. Nelson, K. O'Neil, Commuter rail service reliability: On-time performance and causes for delays, Transportation Research Record: Journal of the Transportation Research Board, (2000) 42-50.
[19] A. Higgins, E. Kozan, Modeling train delays in urban networks, Transportation Science, 32 (1998) 346-357.
[20] J. Pachl, Railway operation and control, 2002.
[21] L.A. Zadeh, Outline of a new approach to the analysis of complex systems and decision processes, IEEE Transactions on systems, Man, and Cybernetics, (1973) 28-44.
[22] E.K. Baker, An exact algorithm for the time-constrained traveling salesman problem, Operations Research, 31 (1983) 938-945.
[23] M.M. Solomon, Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations research, 35 (1987) 254-265.
[24] K. Aggarwal, J. Gupta, K. Misra, A simple method for reliability evaluation of a communication system, IEEE Transactions on Communications, 23 (1975) 563-566.
[25] C.J. Colbourn, C. Colbourn, The combinatorics of network reliability, Oxford University Press New York, 1987.
[26] P. Rietveld, F.R. Bruinsma, D.J. Van Vuuren, Coping with unreliability in public transport chains: A case study for Netherlands, Transportation Research Part A: Policy and Practice, 35 (2001) 539-559.
[27] H.C. Manual, Highway capacity manual, Washington, DC, (2000).
[28] T. Sutaria, J. Haynes, Level of service at signalized intersections, Transportation Research Record, (1977).
[29] M. Carey, A. Kwieciński, Stochastic approximation to the effects of headways on knock-on delays of trains, Transportation Research Part B: Methodological, 28 (1994) 251-267.
[30] R.H. Leilich, Application of simulation models in capacity constrained rail corridors, in: Proceedings of the 30th conference on Winter simulation, IEEE Computer Society Press, 1998, pp. 1125-1134.
[31] T. Huisman, R.J. Boucherie, Running times on railway sections with heterogeneous train traffic, Transportation Research Part B: Methodological, 35 (2001) 271-292.
[32] L. Mattson, Train service reliability A survey of methods for deriving relationships for train delays, Written at the request of the Swedish Institute for Transport and Communications Analysis, (2004).
[33] L. Ford, D. Fulkerson, Flows in networks. 1962, Princeton U. Press, Princeton, NJ, (1962).
[34] W.-C. Yeh, C.-H. Lin, A squeeze response surface methodology for finding symbolic network reliability functions, IEEE Transactions on Reliability, 58 (2009) 374-382.
[35] W.-C. Yeh, Multistate network reliability evaluation under the maintenance cost constraint, International Journal of Production Economics, 88 (2004) 73-83.
[36] K. Heidtmann, Statistical comparison of two sum-of-disjoint-product algorithms for reliability and safety evaluation, Lecture notes in computer science, (2002) 70-81.
[37] W.-C. Yeh, An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths, Reliability Engineering & System Safety, 92 (2007) 260-268.
[38] M.J. Zuo, Z. Tian, H.-Z. Huang, An efficient method for reliability evaluation of multistate networks given all minimal path vectors, IIE transactions, 39 (2007) 811-817.
[39] L.A. Zadeh, Fuzzy logic and its applications, New York, NY, USA, (1965).
[40] J.M. Mendel, Fuzzy logic systems for engineering: a tutorial, Proceedings of the IEEE, 83 (1995) 345-377.
[41] K.-Y. Cai, C.-Y. Wen, M.-L. Zhang, Fuzzy states as a basis for a theory of fuzzy reliability, Microelectronics Reliability, 33 (1993) 2253-2263.
[42] Z. Li, K.C. Kapur, Continuous-state reliability measures based on fuzzy sets, IIE Transactions, 44 (2012) 1033-1044.
[43] G. Klir, B. Yuan, Fuzzy sets and fuzzy logic, Prentice hall New Jersey, 1995.
[44] B. Kosko, Neural networks and fuzzy systems: a dynamical systems approach to machine intelligence/book and disk, Vol. 1Prentice hall, (1992).
[45] R.N. Dave, Fuzzy shell-clustering and applications to circle detection in digital images, International Journal Of General System, 16 (1990) 343-355.
[46] R. Fullér, H.-J. Zimmermann, Fuzzy reasoning for solving fuzzy mathematical programming problems, Fuzzy Sets and Systems, 60 (1993) 121-133.
[47] L.A. Zadeh, On fuzzy algorithms, in: Fuzzy Sets, Fuzzy Logic, And Fuzzy Systems: Selected Papers by Lotfi A Zadeh, World Scientific, 1996, pp. 127-147.
[48] S.M. Bridges, R.B. Vaughn, Fuzzy data mining and genetic algorithms applied to intrusion detection, in: Proceedings of 12th Annual Canadian Information Technology Security Symposium, 2000, pp. 109-122.
[49] Z.-L. Chen, C.-Y. Lee, Parallel machine scheduling with a common due window, European Journal of Operational Research, 136 (2002) 512-527.
[50] M.M. Solomon, J. Desrosiers, Survey paper—time window constrained routing and scheduling problems, Transportation science, 22 (1988) 1-13.