Ordered p-median problems with neighbourhoods
From MaRDI portal
Abstract: In this paper, we introduce a new variant of the -median facility location problem in which it is assumed that the exact location of the potential facilities is unknown. Instead, each of the facilities must be located in a region around their initially assigned location (the neighborhood). In this problem, two main decisions have to be made simultaneously: the determination of the potential facilities that must be open to serve the demands of the customers and the location of the open facilities in their neighborhoods, at global minimum cost. We present several mixed integer non-linear programming formulations for a wide family of objective functions which are common in Location Analysis: ordered median functions. We also develop two math-heuristic approaches for solving the problem. We report the results of extensive computational experiments.
Recommendations
Cites work
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A flexible approach to location problems
- A flexible model and efficient solution strategies for discrete location problems
- A modified variable neighborhood search for the discrete ordered median problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An extended covering model for flexible discrete and equity location problems
- Applications of second-order cone programming
- Approximation algorithms for TSP with neighborhoods in the plane
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Continuous multifacility ordered median location problems
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- Exact procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- Geometrical properties of the symmetrical single facility location problem
- Heuristic procedures for solving the discrete ordered median problem
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- Locating tree-shaped facilities using the ordered median objective
- Location theory. A unified approach
- Minimizing ordered weighted averaging of rational functions with applications to continuous location
- Minimizing the sum of the \(k\) largest functions in linear time.
- Minimum Spanning Tree with Neighborhoods
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
- Multifacility ordered median problems on networks: A further analysis
- On minimum- and maximum-weight minimum spanning trees with neighborhoods
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Revisiting k-sum optimization
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Single-allocation ordered median hub location problems
- Technical Note—Bounds in the Generalized Weber Problem under Locational Uncertainty
- The multi-period incremental service facility location problem
- The ordered capacitated facility location problem
- The travelling salesman problem with neighbourhoods: MINLP solution
- TSP with neighborhoods of varying size
- Using Block Norms for Location Modeling
Cited in
(17)- A revised variable neighborhood search for the discrete ordered median problem
- The ordered anti-median problem with distances derived from a strictly convex norm
- Routing for unmanned aerial vehicles: touring dimensional sets
- Minimum cost b-matching problems with neighborhoods
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- A fresh view on the discrete ordered median problem based on partial monotonicity
- Solution methods for a min-max facility location problem with regional customers considering closest Euclidean distances
- Solving the ordered one-median problem in the plane
- The \(p\)-facility ordered median problem on networks
- Multicriteria planar ordered median problems
- Solving the \(p\)-median problem on regular and lattice networks
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- Facility location problems on graphs with non-convex neighborhoods
- On hub location problems in geographically flexible networks
- On minimal extended representations of generalized power cones
- The hampered k-Median problem with neighbourhoods
- Extensions to the continuous ordered median problem
This page was built for publication: Ordered \(p\)-median problems with neighbourhoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2419559)
