RT - Journal Article
T1 - Approximation Methods for Solving the Equitable Location Problem with Probabilistic Customer Behavior
JF - IUST
YR - 2013
JO - IUST
VO - 24
IS - 3
UR - http://ijiepr.iust.ac.ir/article-1-396-en.html
SP - 217
EP - 227
K1 - Facility location
K1 - Equitable load
K1 - Gravity model
K1 - Heuristic algorithm
K1 - Genetic algorithm
K1 - Integer programming
AB - Location-allocation of facilities in service systems is an essential factor of their performance. One of the considerable situations which less addressed in the relevant literature is to balance service among customers in addition to minimize location-allocation costs. This is an important issue, especially in the public sector. Reviewing the recent researches in this field shows that most of them allocated demand customer to the closest facility. While, using probability rules to predict customer behavior when they select the desired facility is more appropriate. In this research, equitable facility location problem based on the gravity rule was investigated. The objective function has been defined as a combination of balancing and cost minimization, keeping in mind some system constraints. To estimate demand volume among facilities, utility function(attraction function) added to model as one constraint. The research problem is modeled as one mixed integer linear programming. Due to the model complexity, two heuristic and genetic algorithms have been developed and compared by exact solutions of small dimension problems. The results of numerical examples show the heuristic approach effectiveness with good-quality solutions in reasonable run time.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-396-en.html
M3
ER -