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.

کلیدواژه ها:

Location ، Allocation ، Data Envelopment Analysis (DEA).