پديد آورنده :
آخوندي باجگاني، اسماعيل
عنوان :
مسيريابي با حمل در بازگشت وابسته به زمان وسائط نقليه همراه با فرض اولين ورود - اولين خروج
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان: دانشگاه صنعتي اصفهان، دانشكده صنايع و سيستم ها
صفحه شمار :
دوازده، ۸۸ص.: مصور، جدول، نمودار
استاد راهنما :
ناصر ملاوردي
استاد مشاور :
مهدي علينقيان
توصيفگر ها :
حمل ونقل , مسيريابي با حمل در بازگشت وابسته به زمان وسائط نقليه , فرض ترتيب , الگوريتم متاهيوريستيك جستجوي همسايگي متغير , الگوريتم متهيوريستيك جستجوي همسايگي متغير
استاد داور :
محمد سعيد صباغ، حميد ميرمحمدي
تاريخ ورود اطلاعات :
1396/08/16
رشته تحصيلي :
صنايع و سيستم ها
دانشكده :
مهندسي صنايع و سيستم ها
چكيده انگليسي :
89 Time dependent vehicle routing problem with backhaul considering FIFO assumption Esmaeil Akhondi Bajegani e akhondi@in iut ac ir Date of Submission 2017 06 14 Department of Industrial Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language FarsiSupervisors Dr Naser Mollaverdi Naserm@cc iut ac irAbstract Transportation dedicates remarkable part of national gross production in every countryand a large part of researches One of the transportation problems is vehicle routingproblem with backhaul in which vehicles departed from origin and on the way deliverrequired goods or products to the consumers and with the completion of visiting part orwhole of them on the way back can visit another part of consumers and pick up itemsfrom them and return to the origin Often distribution of goods occurs in the urban areasand not considering traffic affect the quality of solution In this thesis for time dependentvehicle routing problem with backhaul a mathematical mixed integer model is presentedto reduce travel time In order to get closer this problem to the real world the First InputFirst Output FIFO assumption is considered Considering the issue that the proposed problem is NP hard in order to optimally solvethe proposed model the Cplex solver is used for small scale instances Using large scaleinstances results of two suggested methods including veriable neighborhood search mat veriable neighborhood search Algorithms are compared Results shows that mat variableneighborhood search in terms of quality of solutions has better performance than othersuggested algorithm Finally in order to investigate the effectiveness of the proposedmodel a case study in Qomeini shahr was considered results show about 19 about 45minutes reduction in travel time and this reduction increased to 23 about 55 minutes by 15 minutes acceleration in service time start Keywords Transportation Time dependent vehicle routing problem with backhaul FIFO assumption Veriable neighborhood search algorithm Mat veriable neighborhoodsearch algorithm
استاد راهنما :
ناصر ملاوردي
استاد مشاور :
مهدي علينقيان
استاد داور :
محمد سعيد صباغ، حميد ميرمحمدي
