A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
Summary: This paper considers the locations of multiple facilities in the space \(R^p\), with the aim of minimizing the sum of weighted distances between facilities and regional customers, where the proximity between a facility and a regional customer is evaluated by the closest distance. Due to the fact that facilities are usually allowed to be sited in certain restricted areas, some locational constraints are imposed to the facilities of our problem. In addition, since the symmetry of distances is sometimes violated in practical situations, the gauge is employed in this paper instead of the frequently used norms for measuring both the symmetric and asymmetric distances. In the spirit of the Cooper algorithm [\textit{L. Cooper}, SIAM Rev. 6, 37--53 (1964; Zbl 0956.90014)], a new location-allocation heuristic algorithm is proposed to solve this problem. In the location phase, the single-source subproblem with regional demands is reformulated into an equivalent linear variational inequality (LVI), and then, a projection-contraction (PC) method is adopted to find the optimal locations of facilities, whereas in the allocation phase, the regional customers are allocated to facilities according to the nearest center reclassification (NCR). The convergence of the proposed algorithm is proved under mild assumptions. Some preliminary numerical results are reported to show the effectiveness of the new algorithm.
- A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A variational inequality approach for constrained multifacility Weber problem under gauge
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A heuristic method for large-scale multi-facility location problems
- A new method for a class of linear variational inequalities
- A primal-dual algorithm for the fermat-weber problem involving mixed gauges
- A qualitative mathematical analysis of a class of linear variational inequalities via semi-complementarity problems: applications in electronics
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
- Accelerating the convergence in the single-source and multi-source Weber problems
- An alternative theorem for generalized variational inequalities and solvability of nonlinear quasi-P^M_*-complementarity problems
- An Approach to Location Models Involving Sets as Existing Facilities
- An inexact alternating direction method for solving a class of structured variational inequalities
- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- Convergence properties of projection and contraction methods for variational inequality problems
- Engineering and Economic Applications of Complementarity Problems
- Heuristic Methods for Location-Allocation Problems
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 47593 (Why is no real title available?)
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 844464 (Why is no real title available?)
- scientific article; zbMATH DE number 1423921 (Why is no real title available?)
- Locating a central hunter on the plane
- Location Models With Groups Of Demand Points
- Location of facilities with rectangular distances among point and area destinations
- Mathematical Models of Road Travel Distances
- Minisum location with closest Euclidean distances
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- On the basic theorem of complementarity
- On the Complexity of Some Common Geometric Location Problems
- On the structure of the solution set for the single facility location problem with average distances
- Optimal location of a facility relative to area demands
- Restricted center problems under polyhedral gauges
- Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
- Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
- The p-center location problem in an area
- The Weber problem with regional demand
- Three-field modelling of nonlinear nonsmooth boundary value problems and stability of differential mixed variational inequalities
- Time-dependent variational inequality for an oligopolistic market equilibrium problem with production and demand excesses
- Using Block Norms for Location Modeling
- A variational inequality approach for constrained multifacility Weber problem under gauge
- An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge
- A heuristic algorithm for constrained multi-source Weber problem - the variational inequality approach
- A variational inequality heuristic algorithm for a constrained multi-source location-allocation model
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
This page was built for publication: A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318909)
