اس فایل

مرجع دانلود فایل ,تحقیق , پروژه , پایان نامه , فایل فلش گوشی

اس فایل

مرجع دانلود فایل ,تحقیق , پروژه , پایان نامه , فایل فلش گوشی

دانلود پاورپوینت Multifacility location problems

اختصاصی از اس فایل دانلود پاورپوینت Multifacility location problems دانلود با لینک مستقیم و پر سرعت .

دانلود پاورپوینت Multifacility location problems


دانلود پاورپوینت Multifacility location problems

لینک پرداخت و دانلود *پایین مطلب*

فرمت فایل: PowerPoint (قابل ویرایش و آماده پرینت)

 تعداد اسلاید19

 

 

شناخت یک مساله Multifacility location problems

 

در حوزه مسایل مکانیابی پیوسته قرار میگیرند.

 

تفاوتشان با مسایل singlefacility در این است که در آنها مکانیابی بیش از یک تسهیل  در آن واحد مورد نظر می باشد.

 

چرا یک مساله Multifacility را از طریق حل چند مساله Singlefacility نمی توان حل کرد؟

 

  همان طور که در ادامه بیشتر توضیح داده خواهد شد دلیل این امر وجود رابطه متقابل بین خود تسهیلات جدید است وگرنه  اگر بین آنها جریانی وجود نداشته باشد مساله براحتی با حل چند مساله تک وسیله ای مستقل قابل حل است.

 

 

 

تابع هدف در یک مساله چند وسیله ای به صورت زیر تعریف  میشود:

 

 

 

 

اگر p=1 باشد فاصله پله ای میشود.

 

اگر p=2 باشد فاصله اقلیدسی میشود.

 

 

 

 

 

 

 

 

لینک دانلود  کمی پایینتر میباشد

 


دانلود با لینک مستقیم


دانلود پاورپوینت Multifacility location problems

ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework

اختصاصی از اس فایل ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework دانلود با لینک مستقیم و پر سرعت .

ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework


ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework

مقاله ISI چاپ شده در مجله علمی ساینتیا ایرانیکا (Scientia Iranica), شماره 105، چاپ سال 2015

In this paper, a new model is developed considering diversity of service in service centers location problem. It is assumed that different services can be provided at each service center. The model has three objective functions including: minimizing the sum of customers’ travel time and waiting time in service centers, balancing service loads among the given centers, and minimizing the total establishment costs of service centers and assignment costs of servers. Different number of servers can be assigned to each service center. Regarding the allocation of customers to the centers, each customer patronizes with respect to the distance to the service center, the attractiveness of each service center’s site for the customer and the number of located servers at the service center. Since the proposed model is of nonlinear integer programming type and is of high complexity on solving, two meta-heuristic based heuristics using particle swarm optimization (PSO) and variable neighborhood search (VNS) are proposed to solve the problem. Different sizes of numerical examples are designed and solved in order to compare the efficiency of the heuristics.

Authors: Fezzeh Partovi, Mehdi Seifbarghy

 

فرمت فایل: PDF                     زبان مقاله: انگلیسی               تعداد صفحه: 14

 


دانلود با لینک مستقیم


ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework

Service Centers Location Problem Considering Service Diversity within Queuing Framework

اختصاصی از اس فایل Service Centers Location Problem Considering Service Diversity within Queuing Framework دانلود با لینک مستقیم و پر سرعت .

Service Centers Location Problem Considering Service Diversity within Queuing Framework


ISI Paper: Service Centers Location Problem Considering Service Diversity within Queuing Framework

مقاله ISI چاپ شده در مجله علمی ساینتیا ایرانیکا (Scientia Iranica), شماره 105، چاپ سال 2015

In this paper, a new model is developed considering diversity of service in service centers location problem. It is assumed that different services can be provided at each service center. The model has three objective functions including: minimizing the sum of customers’ travel time and waiting time in service centers, balancing service loads among the given centers, and minimizing the total establishment costs of service centers and assignment costs of servers. Different number of servers can be assigned to each service center. Regarding the allocation of customers to the centers, each customer patronizes with respect to the distance to the service center, the attractiveness of each service center’s site for the customer and the number of located servers at the service center. Since the proposed model is of nonlinear integer programming type and is of high complexity on solving, two meta-heuristic based heuristics using particle swarm optimization (PSO) and variable neighborhood search (VNS) are proposed to solve the problem. Different sizes of numerical examples are designed and solved in order to compare the efficiency of the heuristics.

Authors: Fezzeh Partovi, Mehdi Seifbarghy

 

فرمت فایل: PDF                     زبان مقاله: انگلیسی               تعداد صفحه: 14

 


دانلود با لینک مستقیم


Service Centers Location Problem Considering Service Diversity within Queuing Framework