“School of Mathematics”

Back to Papers Home
Back to Papers of School of Mathematics

Paper   IPM / M / 15175
School of Mathematics
  Title:   An algorithm for generalized constrained multi-source Weber problem with demand substations
  Author(s):  Soghra Nobakhtian (Joint with A. Raeisi Dehkordi)
  Status:   Published
  Journal: 4OR- A Quarterly Journal of Operations Research
  Year:  2018
  Pages:   DOI: 10.1007/s10288-017-0366-y
  Supported by:  IPM
In this paper, we consider a multi-sourceWeber problem of m new facilities with respect to n demand regions in order to minimize the sum of the transportation costs between these facilities and the demand regions. We find a point on the border of each demand region from which the facilities serve the demand regions at these points. We present an algorithm including a location phase and an allocation phase in each iteration for solving this problem. An algorithm is also proposed for carrying out the location phase. Moreover, global convergence of the new algorithm is proved under mild assumptions, and some numerical results are presented.

Download TeX format
back to top
scroll left or right