A projection method for l_ p norm location-allocation problems
From MaRDI portal
(Redirected from Publication:1337136)
A projection method for \(l p\) norm location-allocation problems
A projection method for \(l p\) norm location-allocation problems
The authors present a method for solving \(l_p\)-norm location- allocation problems involving bivalent allocations. The \((0, 1)\) constraints on the allocations are relaxed and the proposed method relies upon necessary conditions for local minima of the relaxed problem. The algorithm finds a local minimum by using active set methods and projections onto successive subspaces in which the current activities remain active. It is shown that all local minima of the relaxed problem can be achieved at points with bivalent allocations. The implementation of the algorithm exploits the special structure of the problems for reducing the computational cost. Finally, numerical results are given for a set of thirty-six test problems.
Recommendations
Cites work
- A New Algorithm for Locating Sources Among Destinations
- A note on Fermat's problem
- A projected newton method forl p norm location problems
- A projection method for the uncapacitated facility location problem
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- An optimal method for solving the (generalized) multi-Weber problem
- Exact and approximate solutions to the multisource weber problem
- Heuristic Methods for Location-Allocation Problems
- Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
- scientific article; zbMATH DE number 3942888 (Why is no real title available?)
- scientific article; zbMATH DE number 4047401 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 4183163 (Why is no real title available?)
- Large-scale linearly constrained optimization
- Location-Allocation Problems
- Properties and Solution Methods for Large Location-Allocation Problems
Cited in
(35)- Allocation search methods for a generalized class of location-allocation problems
- Norm statistics and the complexity of clustering problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
- Duality theorem for a generalized Fermat-Weber problem
- A cellular heuristic for the multisource Weber problem.
- Self-organizing feature maps for solving location--allocation problems with rectilinear distances.
- Heuristic solutions to multi-depot location-routing problems
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
- A two-echelon joint continuous-discrete location model
- Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
- Classical and inverse median location problems under uncertain environment
- A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
- Biologically inspired parent selection in genetic algorithms
- A voltage drop limited decentralized electric power distribution network
- A new local search for continuous location problems
- Multi-facility green Weber problem
- An efficient hybrid particle swarm optimization algorithm for solving the uncapacitated continuous location-allocation problem
- Generating good starting solutions for the \(p\)-median problem in the plane
- New heuristic algorithms for solving the planar p-median problem
- A new heuristic for solving the \(p\)-median problem in the plane
- scientific article; zbMATH DE number 4047401 (Why is no real title available?)
- A projected newton method forl p norm location problems
- Accelerating the convergence in the single-source and multi-source Weber problems
- A hybrid data mining metaheuristic for the p‐median problem
- Using injection points in reformulation local search for solving continuous location problems
- New local searches for solving the multi-source Weber problem
- Formulae of epigraphical projection for solving minimax location problems
- Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights
- Location Science in Canada
- Clustering and the perturbed spatial median
- A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification
- A hyperbolic smoothing approach to the multisource Weber problem
- Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
- A projection method for the uncapacitated facility location problem
This page was built for publication: A projection method for \(l_ p\) norm location-allocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337136)
