In this paper we analyze a new location problem which is a generalization of the well-known single facility location model. This extension consists of introducing a general objective function and replacing fixed locations by trajectories. We prove that the problem is well-stated and solvable. A Weiszfeld type algorithm is proposed to solve this generalized dynamic single facility location probl...

This paper gives a new, simple, monotonically convergent, algorithm for the Fermat-Weber location problem, with extensions covering more general cost functions.

Conjugate gradient methods are efficient methods for minimizing differentiable objective functions in large dimension spaces. However, converging line search strategies are usually not easy to choose, nor to implement. Sun and colleagues (Ann. Oper. Res. 103:161–173, 2001; J. Comput. Appl. Math. 146:37–45, 2002) introduced a simple stepsize formula. However, the associated convergence domain ha...

We present a novel approach to federated learning that endows its aggregation process with greater robustness potential poisoning of local data or model parameters participating devices. The proposed approach, Robust Federated Aggregation (RFA), relies on the updates using geometric median, which can be computed efficiently Weiszfeld-type algorithm. RFA is agnostic level corruption and aggregat...

The Fermat-Weber problem of optimally locating a service facility in the Euclidean continuous two-dimensional space is usually solved by the iterative process first suggested by Weiszfeld or by later versions thereof. The methods are usually rather efficient, but exceptional problems are described in the literature in which the iterative solution is exceedingly long. These problems are such tha...

In this paper we introduce a new facility location model, called backup multifacility location problem by considering the ideal radius for each customer. In this problem the location of clients are given in the plane. A radius is assigned to each client. We should find the location of new facilities, which some of them may fail with a given probability, such that the sum of weighted distances f...

A mishap might happen at any port along Antalya’s 500-kilometer shorelines, and the counter spillage group ought to be on schedule for an intercession. The aim of this study is decide most appropriate areas office tourist ports. For reason, Tree Seeds Algorithm (TSA), Symbiotic Organisms Search (SOS), Sooty Terns Optimization (STOA), Weiszfeld (WA) optimization methods are used track down advan...