Efficient algorithms for the uncapacitated single allocation p-hub median problem

1996 ◽  
Vol 4 (3) ◽  
pp. 139-154 ◽  
Author(s):  
Andreas T. Ernst ◽  
Mohan Krishnamoorthy
Keyword(s):  
Efficient Algorithms ◽  
Median Problem ◽  
Single Allocation

Efficient Algorithms for the Capacitated 1-Median Problem

1992 ◽  
Vol 4 (4) ◽  
pp. 418-425 ◽  
Author(s):  
Hossam ElGindy ◽  
J. Mark Keil
Keyword(s):  
Efficient Algorithms ◽  
Median Problem

scholarly journals An artificial immune system algorithm for solving the uncapacitated single allocation p-Hub median problem

2021 ◽  
Vol 11 (3) ◽  
pp. 2293
Author(s):  
Fatima Zahraa Grine ◽  
Oulaid Kamach ◽  
Abdelhakim Khatab ◽  
Naoufal Sefiani
Keyword(s):  
Clonal Selection ◽  
Artificial Immune Systems ◽  
Data Sets ◽  
Clonal Selection Algorithm ◽  
Artificial Immune ◽  
Hub Location ◽  
Median Problem ◽  
Solution Quality ◽  
Artificial Immune System Algorithm ◽  
Single Allocation

The present paper deals with a variant of hub location problems (HLP): the uncapacitated single allocation p-Hub median problem (USApHMP). This problem consists to jointly locate hub facilities and to allocate demand nodes to these selected facilities. The objective function is to minimize the routing of demands between any origin and destination pair of nodes. This problem is known to be NP-hard. Based on the artificial immune systems (AIS) framework, this paper develops a new approach to efficiently solve the USApHMP. The proposed approach is in the form of a clonal selection algorithm (CSA) that uses appropriate encoding schemes of solutions and maintains their feasibility. Comprehensive experiments and comparison of the proposed approach with other existing heuristics are conducted on benchmark from civil aeronautics board, Australian post, PlanetLab and Urand data sets. The results obtained allow to demonstrate the validity and the effectiveness of our approach. In terms of solution quality, the results obtained outperform the best-known solutions in the literature.

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane

2016 ◽  
Vol 26 (03n04) ◽  
pp. 185-210
Author(s):  
Haitao Wang ◽  
Jingru Zhang
Keyword(s):  
Time Algorithm ◽  
Efficient Algorithms ◽  
Additional Constraint ◽  
Distance Measures ◽  
Np Hard ◽  
Center Problem ◽  
Median Problem ◽  
One Dimensional ◽  
The Given

The (weighted) [Formula: see text]-median, [Formula: see text]-means, and [Formula: see text]-center problems in the plane are known to be NP-hard. In this paper, we study these problems with an additional constraint that requires the sought [Formula: see text] facilities to be on a given line. We present efficient algorithms for various distance measures such as [Formula: see text]. We assume that all [Formula: see text] weighted points are given sorted by their projections on the given line. For [Formula: see text]-median, our algorithms for [Formula: see text] and [Formula: see text] metrics run in [Formula: see text] time and [Formula: see text] time, respectively. For [Formula: see text]-means, which is defined only on the squared [Formula: see text] distance, we give an [Formula: see text] time algorithm. For [Formula: see text]-center, our algorithms run in [Formula: see text] time for all three metrics, and in [Formula: see text] time for the unweighted version under [Formula: see text] and [Formula: see text] metrics. While our results for the [Formula: see text]-center problem are optimal, the results for the [Formula: see text]-median problem almost match the best algorithms for the corresponding one-dimensional problems.

scholarly journals Efficient algorithms for two generalized 2-median problems and the group median problem on trees

2009 ◽  
Vol 410 (8-10) ◽  
pp. 867-876 ◽  
Author(s):  
Chi-Yuan Chan ◽  
Shan-Chyun Ku ◽  
Chi-Jen Lu ◽  
Biing-Feng Wang
Keyword(s):  
Efficient Algorithms ◽  
Median Problem ◽  
Median Problems

A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem

2010 ◽  
Vol 206 (2) ◽  
pp. 289-300 ◽  
Author(s):  
Aleksandar Ilić ◽  
Dragan Urošević ◽  
Jack Brimberg ◽  
Nenad Mladenović
Keyword(s):  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Median Problem ◽  
Single Allocation

scholarly journals Artificial Immune Systems for Solving the Uncapacitated Single-Allocation p-Hub Median Problem

2018 ◽  
Author(s):  
Gabriel L. Nobrega ◽  
Vinicius J. Tasso ◽  
Allan G. Souza ◽  
Stephanie A. Fernandez ◽  
Daniel G. Silva
Keyword(s):  
Network Design ◽  
Optimization Problems ◽  
Artificial Immune Systems ◽  
Research Interest ◽  
Artificial Immune ◽  
Hub Location ◽  
Median Problem ◽  
Immune Systems ◽  
Single Allocation

Optimization problems such as the Uncapacitated Single-Allocation p-Hub Median Problem represent good models for real network design issues, hence an increasing research interest has emerged. A good hub location reduces costs and improves the quality of delivered services on network-based systems. In this work, two artificial immune systems are employed in order to address the problem, where the numerical results indicate good quality of solutions.

A single allocation p-hub median problem with general piecewise-linear costs in arcs

2019 ◽  
Vol 128 ◽  
pp. 477-491 ◽  
Author(s):  
Armin Lüer-Villagra ◽  
H.A. Eiselt ◽  
Vladimir Marianov
Keyword(s):  
Piecewise Linear ◽  
Median Problem ◽  
Single Allocation
Sign in / Sign up

Export Citation Format

Share Document