The single facility location problem with average-distances

Franco, Concepción Valero; Rodríguez‐Chía, Antonio M.; Miranda, Isidoro

doi:10.1007/s11750-008-0040-9

Cited by 10 publications

(1 citation statement)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since then, we can find in the literature many references concerning this algorithm, as for instance the generalization to ℓ p distances with p ∈ [1,2] [38] or the analysis of its local and global convergence [4,5,6,10]. Also, these results were extended to more general problems: on Banach spaces [23,43,44], on the sphere [53], with regional demand [13,49], with sets as demand facilities and using closest Euclidean distances [7] or with radial distances [14,15,16,31,39]. In addition, one can find in the literature papers where the convergence is accelerated using alternative step sizes [17,18,25,30,42] or some related properties concerning the termination of the algorithm in any of the demand points after a finite number of iterations [6,9,8,11,12,29].…”

Section: Introductionmentioning

confidence: 99%

Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms

2014

View full text Add to dashboard Cite

This paper addresses the general continuous single facility location problems in finite dimension spaces under possibly different ℓ p norms in the demand points. We analyze the difficulty of this family of problems and revisit convergence properties of some well-known algorithms. The ultimate goal is to provide a common approach to solve the family of continuous ℓ p ordered median location problems in dimension d (including of course the ℓ p minisum or Fermat-Weber location problem for any p ≥ 1). We prove that this approach has a polynomial worse case complexity for monotone lambda weights and can be also applied to constrained and even non-convex problems.

show abstract

Section: Introductionmentioning

confidence: 99%

Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms

2014

View full text Add to dashboard Cite

show abstract

A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed Demand

Yao

Murray

2020

Innovations in Urban and Regional Systems

View full text Add to dashboard Cite

A Solution Approach for Agricultural Service Center Location Problem Using TOPSIS, DEA and SAW Techniques

et al. 2015

View full text Add to dashboard Cite

In this research, agricultural service centers have been introduced as a strategic decision to improve efficiency of agricultural supply chain. Since the location problems in agriculture exhibit several features, such as their large scope and size, and demonstrate increased levels of complexity, so the main aim of this study is developing an integrated Multi-Attribute Decision Making (MADM) approach considering all aspects of the Agricultural Service Center Location Problem (ASCLP) including: customers, service suppliers, and also technical suitability of candidate location. In this regard two main MADM approaches are developed. The first approach was the combination of Simple Additive Weighting (SAW), Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) and Data Envelopment Analysis (DEA). The second approach is developed to improve the solutions for some cases which the first approach was unable to reach to the non-dominated solutions. Before completing the MADM approaches, initially a Delphi fuzzy-analytical hierarchy process survey has been completed to extract the objectives and attributes of ASCLP and their local weight, which is published in previous work by the authors. The main contribution of current chapter is to consider more comprehensively the attributes in solving a service facility location problem such as: distances to demand points and also suppliers, cultivated area of demand points, population of demand points, number of cultivated crops, and the ration of irrigated cultivated lands to dried cultivated lands. The developed approach was able to use all mentioned decision methods, simultaneously. In the second approach, the developed attributes are used, two scores (maxi-min and maxi-max) for each candidate location is computed and nondominated solutions are identified. To prove the capability of the selected attributes one case study is addressed. The results reveal that the chosen attributes to a very large degree can lead to the non-dominated solutions.

show abstract

The single facility location problem with average-distances

Abstract: Average distance, Weber problem, Weiszfeld algorithm, 90B85,

Cited by 10 publications

References 16 publications

Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms

Revisiting several problems and algorithms in continuous location with $$\ell _\tau $$ ℓ τ norms

A Spatial Optimization Approach for Solving a Multi-facility Location Problem with Continuously Distributed Demand

A Solution Approach for Agricultural Service Center Location Problem Using TOPSIS, DEA and SAW Techniques

Contact Info

Product

Resources

About