A Problem Based on the Cost of the Location Allocation Problem and Data Envelopment Analysis

In this paper, we consider a location allocation problem with considering the data envelopment analysis problem. In this case, the service capacity of each server is considered as its efficiency. Our main goal is to reduce servers to a specified number so that the sum of the traveling cost from customers to servers and the sum of the inputs cost relative to each server (as a DMU) are minimized.

Keywords:

Location , Allocation , Data Envelopment Analysis (DEA).

Authors

Tahereh Sayyar

Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood, Iran;

Jafar Fathaii

Associate Professor, Faculty of Mathematical Sciences, Shahrood University of Technology, Shahrood,Iran

Mojtaba Ghiyasi

Assistant Professor, Faculty of Management and Industry, Shahrood University of Technology,Shahrood, Iran;

Certificate
من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

https://civilica.com/doc/1125043

شناسه ملی سند علمی:

ICIORS13_241

تاریخ نمایه سازی: 6 آذر 1399

How to Cite to This Paper:

If you want to refer to this Paper in your research work, you can simply use the following phrase in the resources section:

Sayyar, Tahereh and Fathaii, Jafar and Ghiyasi, Mojtaba,1399,A Problem Based on the Cost of the Location Allocation Problem and Data Envelopment Analysis,The 13th International Conference of Iranian Operations Research Society,Shahrud,https://civilica.com/doc/1125043

Scientometrics

The specifications of the publisher center of this Paper are as follows:

Ranking of Shahrood University of Technology

Type of center: دانشگاه دولتی

Paper count: 10,199

In the scientometrics section of CIVILICA, you can see the scientific ranking of the Iranian academic and research centers based on the statistics of indexed articles.

مقالات مرتبط جدید