weber problem
Recently Published Documents


TOTAL DOCUMENTS

172
(FIVE YEARS 4)

H-INDEX

24
(FIVE YEARS 0)

2021 ◽  
Vol 55 (5) ◽  
pp. 1136-1150
Author(s):  
Giovanni Righini

The single source Weber problem with limited distances (SSWPLD) is a continuous optimization problem in location theory. The SSWPLD algorithms proposed so far are based on the enumeration of all regions of [Formula: see text] defined by a given set of n intersecting circumferences. Early algorithms require [Formula: see text] time for the enumeration, but they were recently shown to be incorrect in case of degenerate intersections, that is, when three or more circumferences pass through the same intersection point. This problem was fixed by a modified enumeration algorithm with complexity [Formula: see text], based on the construction of neighborhoods of degenerate intersection points. In this paper, it is shown that the complexity for correctly dealing with degenerate intersections can be reduced to [Formula: see text] so that existing enumeration algorithms can be fixed without increasing their [Formula: see text] time complexity, which is due to some preliminary computations unrelated to intersection degeneracy. Furthermore, a new algorithm for enumerating all regions to solve the SSWPLD is described: its worst-case time complexity is [Formula: see text]. The new algorithm also guarantees that the regions are enumerated only once.



Author(s):  
Chunxiang Guo ◽  
Yinjie Zhang ◽  
Ruili Shi ◽  
Dongzhi Wang


2020 ◽  
Vol 113 ◽  
pp. 104780
Author(s):  
Arsham Atashi Khoei ◽  
Haldun Süral ◽  
Mustafa Kemal Tural
Keyword(s):  




2019 ◽  
Vol 78 (2) ◽  
pp. 271-294 ◽  
Author(s):  
Chandra Ade Irawan ◽  
Said Salhi ◽  
Kusmaningrum Soemadi


Author(s):  
Tarik Kucukdeniz ◽  
Sakir Esnaf ◽  
Engin Bayturk

An uncapacitated multisource Weber problem involves finding facility locations for known customers. When this problem is restated as finding locations for additional new facilities, while keeping the current facilities, a new solution approach is needed. In this study, two new and cooperative fuzzy clustering algorithms are developed to solve a variant of the uncapacitated version of a multisource Weber problem (MWP). The first algorithm proposed is the extensive version of the single iteration fuzzy c-means (SIFCM) algorithm. The SIFCM algorithm assigns customers to existing facilities. The new extended SIFCM (ESIFCM), which is first proposed in this study, allocates discrete locations (coordinates) with the SIFCM and locates and allocates continuous locations (coordinates) with the original FCM simultaneously. If the SIFCM and the FCM, show differences between the successive cluster center values are still decreasing, share customer points among facilities. It is simply explained as single-iteration fuzzy c-means with fuzzy c-means. The second algorithm, also proposed here, runs like the ESIFCM. Instead of the FCM, a Gustafson-Kessel (GK) fuzzy clustering algorithm is used under the same framework. This algorithm is based on single-iteration (SIGK) and the GK algorithms. Numerical results are reported using two MWP problems in a class of a medium-size-data (106 bytes). Using clustering algorithms to locate and allocate the new facilities while keeping current facilities is a novel approach. When applied to the big problems, the speed of the proposed algorithms enable to find a solution while mathematical programming solution is not doable due to the great computational costs.





2019 ◽  
Vol 76 (4) ◽  
pp. 793-818
Author(s):  
Jianlin Jiang ◽  
Su Zhang ◽  
Yibing Lv ◽  
Xin Du ◽  
Ziwei Yan


Sign in / Sign up

Export Citation Format

Share Document