A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
Computational Optimization and Applications
HubLocator: an exact solution method for the multiple allocation hub location problem
Computers and Operations Research - Location analysis
Solving hub arc location problems on a cluster of workstations
Parallel Computing - Special issue: Parallel computing in logistics
Journal of Global Optimization
Hub Arc Location Problems: Part I-Introduction and Results
Management Science
Hub Arc Location Problems: Part II-Formulations and Optimal Algorithms
Management Science
Benders decomposition for the uncapacitated multiple allocation hub location problem
Computers and Operations Research
Star p-hub median problem with modular arc capacities
Computers and Operations Research
Capacitated single allocation hub location problem-A bi-criteria approach
Computers and Operations Research
Uncapacitated single and multiple allocation p-hub center problems
Computers and Operations Research
Benders Decomposition for Hub Location Problems with Economies of Scale
Transportation Science
Aggregation in hub location problems
Computers and Operations Research
A 2-phase algorithm for solving the single allocation p-hub center problem
Computers and Operations Research
Evolutionary local search for the super-peer selection problem and the p-hub median problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Bicriteria p-Hub Location Problems and Evolutionary Algorithms
INFORMS Journal on Computing
Benders Decomposition for Large-Scale Uncapacitated Hub Location
Operations Research
Star p-hub center problem and star p-hub median problem with bounded path lengths
Computers and Operations Research
Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels
Transportation Science
| Hi-index | 0.00 |
The problem of locating hub facilities arises in the design of transportation and telecommunications networks. The p-hub median problem belongs to a class of discrete location-allocation problems in which all the hubs are fully interconnected. Nonhub nodes may be either uniquely or multiply allocated to hubs. The hubs are uncapacitated and the total number of hubs, p is specified a priori. We describe a novel exact-solution approach for solving the multiple-allocation case of the p-hub median problem and show how a similar method can be adapted for solving the more difficult single-allocation case. The methods for both of these solve shortest-path problems to obtain lower bounds, which are used in a branch-and-bound scheme to obtain the exact solution. Numerical results show the superiority of this new approach over traditional LP-based methods.