arXiv 1503.044682015-03-15math.OCcs.DS

Ordered Median Hub Location Problems with Capacity Constraints

J. Puerto, A. B. Ramos, A. M. Rodriguez-Chia, M. C. Sanchez-Gil

英文摘要：

The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in Puerto et al. (2011) that provides a unifying analysis of a wide class of hub location mod- els. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also studied through the use of some fami- lies of valid inequalities. A battery of test problems with data taken from the AP library are solved where it is shown that the running times have been significantly reduced with the improvements presented in the paper.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

An extended version of a Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

The Discrete Ordered Median Problem (DOMP) is formulated as a set partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the information of the sorting position of their corresponding costs. We develop a column generation approach to solve the continuous relaxation of this model. Then, we apply a branch-price-and-cut algorithm to solve to optimality small to moderate size of DOMP in competitive computational time.

2018-02-09math.OC

An exact copositive programming formulation for the Discrete Ordered Median Problem: Extended version

This paper presents a first continuous, linear, conic formulation for the Discrete Ordered Median Problem (DOMP). Starting from a binary, quadratic formulation in the original space of location and allocation variables that are common in Location Analysis (L.A.), we prove that there exists a transformation of that formulation, using the same space of variables, that allows us to cast DOMP as a continuous linear problem in the space of completely positive matrices. This is the first positive result that states equivalence between the family of continuous convex problems and some hard problems i…

2018-08-31math.OC

A Branch-and-Price approach for the Continuous Multifacility Monotone Ordered Median Problem

In this paper, we address the Continuous Multifacility Monotone Ordered Median Problem. This problem minimizes a monotone ordered weighted median function of the distances between given demand points in $\mathbb{R}^d$ and its closest facility among the $p$ selected, also in a continuous space. We propose a new branch-and-price procedure for this problem, and two mathehuristics. One of them is a decomposition-based procedure and the other an aggregation-based heuristic. We give detailed discussions of the validity of the exact formulations and also specify the implementation details of all the …

2021-08-01math.OC

A variable service rate queue model for hub median problem

Hub location problems have multiple applications in logistic systems, airways industry, supply chain network design, and telecommunication. In the hub location problem, a number of nodes should be selected as the hub nodes to act as the main distributors and other nodes are connected together by these hubs. The input flow to the hub nodes is very large so more often we face the congestion in the hub nodes that causes disturbances in the whole system. Also, we have different service rates which is another cause of disturbance and should be addressed by the models. This paper addresses these iss…

2020-02-27math.OC

Algorithms and dimensionality reductions for continuous multifacility ordered median location problems

In this paper we propose a general methodology for solving a broad class of continuous, multifacility location problems, in any dimension and with $\ell_τ$-norms proposing two different methodologies: 1) by a new second order cone mixed integer programming formulation and 2) by formulating a sequence of semidefinite programs that converges to the solution of the problem; each of these relaxed problems solvable with SDP solvers in polynomial time. We apply dimensionality reductions of the problems by sparsity and symmetry in order to be able to solve larger problems.

2014-10-19math.OC

Ordered p-median problems with neighborhoods

In this paper, we introduce a new variant of the $p$-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 prog…

2017-10-23math.COmath.OC

更多相关论文收起更多论文

有序中位数树选址问题的扩展版本，含附录和详细计算结果

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results

本文提出有序中位数树选址问题（OMT），通过引入覆盖变量、预处理阶段和 Benders 分解算法改进求解性能，使中等规模随机图实例可解。

2025-02-08cs.DMmath.OC

重新审视具有 Monge 成本结构的运输问题及其在选址问题中的应用

Revisiting transportation problems under Monge costs with applications to the Discrete Ordered Median Problem

Karlsruhe Institute of Technology（卡尔斯鲁厄理工学院）；University of Seville（塞维利亚大学）

本文重新审视具有 Monge 成本结构的运输问题，推导出最优对偶解的紧凑公式，并应用于离散有序中位问题，提升计算性能和鲁棒性。

2026-10-02math.OC

物流枢纽选址优化：一种基于路网距离的K-Means与P-Median模型混合方法

Logistics Hub Location Optimization: A K-Means and P-Median Model Hybrid Approach Using Road Network Distances

LUMS（拉合尔管理科学大学）；King Fahd University of Petroleum and Minerals（法赫德国王石油与矿产大学）

本文提出一种结合K-Means聚类与P-Median模型的混合方法，基于路网距离优化物流枢纽选址，并在真实配送数据上验证每次配送可节省815米（10%）。

2024-07-04cs.AIcs.LGmath.OC

离散有序中位数问题的约束松弛

Constraint relaxation for the Discrete Ordered Median Problem

本文针对离散有序中位数问题，提出一种松弛强序约束并通过行生成技术迭代添加约束的新方法，实验证明该方法能高效处理更大规模实例。

2024-03-28math.OC

A modeling framework for Ordered Weighted Average Combinatorial Optimization

Multiobjective combinatorial optimization deals with problems considering more than one viewpoint or scenario. The problem of aggregating multiple criteria to obtain a globalizing objective function is of special interest when the number of Pareto solutions becomes considerably large or when a single, meaningful solution is required. Ordered Weighted Average or Ordered Median operators are very useful when preferential information is available and objectives are comparable since they assign importance weights not to specific objectives but to their sorted values. In this paper, Ordered Weighte…

2013-06-06math.OC

有理函数有序加权平均最小化的半定规划方法

A Semidefinite Programming approach for minimizing ordered weighted averages of rational functions

Universidad de Granada（格拉纳达大学）；Universidad de Sevilla（塞维利亚大学）

提出将紧半代数集上有理函数有序加权平均最小化问题转化为高维空间中的等价形式，并通过半定规划松弛层次逼近最优值，应用于连续选址问题。

2011-06-28cs.NAmath.NAmath.OC