پديد آورنده :
غفاري، حسين
عنوان :
ارائه يك روش جديد براي حل مسئله حمل و نقل متعادل
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
سيزده،132ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
محمدسعيد صباغ
توصيفگر ها :
جدول بهينه , مستطيل همزاد منفي , جفت مجموعه هاي منفي
تاريخ نمايه سازي :
28/1/92
استاد داور :
نادر شتاب بوشهري، ناصر ملاوردي
دانشكده :
مهندسي صنايع و سيستم ها
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
Introducing a new method to solve the balanced transportation problem Hossein Ghaffari h ghafari @in iut ac ir Date of submission 2012 12 10 Department of industrial and system engineering Isfahan University of technology Isfahan Iran Degree M Sc Language Farsi Supervisor Mohammad S Sabbagh Sabbagh@cc iut ac ir Abstract The transportation problem TP is a special class of linear programing The TP deals with the distribution of goods from m sources to n destinations The TP seeks to minimize the total shipping costs of transporting goods from m sources each with a supply si to n destinations each with a demand dj when the unit shipping cost from source i to destination j is cij If the sum of the supplies at the m sources equals the sum of the demands at n destinations then the problem is called a balanced problem TP has many applications in the real world such as production planning optimal location determination optimal resource allocation and optimal distribution management Due to numerous applications of this problem an efficient method is necessary to solve it So in this thesis a new method has been introduced to solve the balanced transportation problem In the proposed method only with simple operations on the cost matrix we obtain an optimal solution The proposed method that always obtains the optimal solution is much faster than the transportation simplex method and GAMS software For instance for problems of size greater than 600 600 our method reduces the runtime up to 80 percent In addition it was found that the superiority of our method is increasing as the problem size increases So that for problems of size 3000 3000 our algorithms reduces the runtime up to 90 percent Furthermore the other advantages of our method are easy implementation process less memory requirements possible parallel implementation not having any cycling problem and finding the dual optimal solution Keywords Transportation problem optimal tableau Negative dual rectangle Negative pair sets PDF created with pdfFactory trial version www pdffactory com
استاد راهنما :
محمدسعيد صباغ
استاد داور :
نادر شتاب بوشهري، ناصر ملاوردي
