پديد آورنده :
كورنك بهشتي، علي
عنوان :
يك الگوريتم تركيبي براي حل مدل توسعه يافته ي مسير يابي اتوبوس مدارس
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
دوازده،100ص.: مصور،جدول،نمودار
يادداشت :
ص.ع.به فارسي و انگليسي
استاد راهنما :
جمشيد پرويزيان
استاد مشاور :
حامد تركش اصفهاني
توصيفگر ها :
مسيريابي وسايل نقليه , الگوريتم الكترومغناطيس- ژنتيك , الگوريتم سقوط قطرات آب
تاريخ نمايه سازي :
7/10/89
استاد داور :
نادر شتاب بوشهري، حميد مير محمدي
دانشكده :
مهندسي صنايع و سيستم ها
چكيده فارسي :
به فارسي و انگليسي: قابل رويت در نسخه ديجيتالي
چكيده انگليسي :
A Hybrid Algorithm to Solve the School Bus Routing Problem Ali Kourank Beheshti a Korankbeheshti@in iut ac ir Date of Submission 2010 10 27 Department of Industrial Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language Farsi Supervisor Jamshid Parvizian japa@cc iut ac ir Abstract School Bus Routing Problem SBRP is one of the most applicable problems in Operations Research This problem aims in finding an effectual schedule for school bus systems In this schedule each bus picks students up from diverse stations and takes them to their destination school in such a way that wide variety of constraints such as maximum capacity of each bus maximum staying time of each student in bus and appropriate delivery times hold In this research it is tried to perform some developments in the model consisting some real constraints and then an effective algorithm is proposed to solve the model To do this the problem is solved via two phases During the first phase using intelligent water drop algorithm initial solutions population is achieved and in second phase initial solutions are conducted to optimal or near optimal solutions During this phase in order to have an appropriate conduction to optimality some algorithms in the field of main and local search are defined When designing the main search algorithm we have utilized combinatorial approaches such as Electromagnetism Genetic algorithm Also when designing local search algorithms we have benefited iterated swap procedure ISP and some philosophies such as theory of constraint TOC Finally the proposed method is run on a case study a sample problem and some other testing samples Computational results demonstrate that the proposed approach has higher capabilities in contrast with other existing methods Keywords 1 Vehicle Routing Problem 2 School Bus Routing Problem 3 Electromagnetism Genetic Algorithm 4 Intelligent water Drop Algorithm
استاد راهنما :
جمشيد پرويزيان
استاد مشاور :
حامد تركش اصفهاني
استاد داور :
نادر شتاب بوشهري، حميد مير محمدي
