پديد آورنده :
ابراهيمي، علي
عنوان :
تعيين محل بهينه شمارش كمان هاي شبكه در شهرهاي بزرگ با استفاده از شبكه هاي بيزين ﴿مطالعه موردي: شهر اصفهان﴾
مقطع تحصيلي :
كارشناسي ارشد
گرايش تحصيلي :
سيستم هاي اقتصادي - اجتماعي
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
نه،82ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
نادر شتاب بوشهري
توصيفگر ها :
كمان هاي مهم جهت شمارش , شبكه هاي حمل و نقلي بزرگ , ماتريس تقاضاي سفر مبدا-مقصد
تاريخ نمايه سازي :
17/6/92
استاد داور :
مهدي ابطحي، غلامعلي رئيسي
دانشكده :
مهندسي صنايع و سيستم ها
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Optimal Counting Location of the Network Links for large cities Using Bayesian Networks Case Study Isfahan City Ali Ebrahimi a ebrahimi@in iut ac ir Date of Submission 2013 1 22 Department of Industrial Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language FarsiSupervisor Seyed Nader Shetab shetab@cc iut ac irAbstract The analysis of network traffic flows needs origin destination matrix information This matrix consistsof the origin destination data of the transportation network which can be obtained via two direct andindirect methods Since construction of the origin destination matrix using direct methods is so much costlyand time consuming hence using indirect methods has received more attention One of the most importantindirect methods is estimation of origin destination matrices by counting traffic of some of the links Theaccuracy of the origin destination matrix is related to some data such as the initial origin destination matrixand the links chosen for counting On the other hand the budget for counting the links is limited thusselecting links which give the most information is so important The estimation and upgrading of the origin destination matrix has been investigated extensively but the location of the traffic counting points hasreceived very limited attention One of the accurate methods for selecting optimal traffic counting locationthat has received more attention in recent decades is using the Bayesian networks The problem of thismethod is its long using time for large networks In this thesis two solutions are presented for using thismethod for large networks These solutions are omitting the unimportant links and decreasing the number oforigin destination pairs Also the new indicator for selecting the links is presented At last this method isinstalled for Isfahan transportation network It is obvious that by much changing of some zones attractiveness for traveling this method has some constraints in installation Keywords Important Links for Counting Large Transportation Networks Origin DestinationMatrix Bayesian Network
استاد راهنما :
نادر شتاب بوشهري
استاد داور :
مهدي ابطحي، غلامعلي رئيسي
