Ordered median hub location problems with capacity constraints

被引：28
|
作者：
Puerto, J. [1 ]
Ramos, A. B. [1 ]
Rodriguez-Chia, A. M. [2 ]
Sanchez-Gil, M. C. [2 ]
机构：
[1] Univ Seville, Fac Matemat, Seville, Spain
[2] Univ Cadiz, Fac Ciencias, Cadiz, Spain
来源：
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES | 2016年 / 70卷
关键词：
Hub location; Discrete ordered median problems; Capacities; SPOKE NETWORK DESIGN; CUT ALGORITHM; FORMULATIONS; BRANCH; MODEL; RELAXATION;
D O I：
10.1016/j.trc.2015.05.012
中图分类号：
U [交通运输];
学科分类号：
08 ; 0823 ;
摘要：
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 models. 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 families 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. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码：142 / 156
页数：15
相关论文
共 50 条
12345