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, tw ...

فایل ارائه پاورپوینت با موضوع ﺍﻟﮕﻮﺭﻳﺘﻢ ﺣﺮﻛﺖ ﺩﺳﺘﻪ ﺟﻤﻌﻰ ﭘﺮﻧﺪﮔﺎﻥ (pso) +شبیه سازی در متلب+داکیومنت ورد

تعداد اسلاید:10 فایل های برنامه نویسی شبیه سازی در متلب فیل داکیومنت ورد قابل ویرایش 15 صفحه ای فایل ورد نمونه ورودی های الگورییم+خلاصه الگوریتم ...

الگوریتم بهینه سازی چند هدفه ازدحام ذرات MOPSO

الگوریتم بهینه سازی چند هدفه ازدحام ذرات MOPSO یک مثال بسیار کاربردی آموزش کامل نحوه عملکرد الگوریتم ازدحام ذرات Particle swarm optimization کد متلب الگوریتم Particle swarm optimization ...

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, tw ...