Solution algorithms for the capacitated single allocation hub location problem

DOI10.1023/A:1018994432663zbMATH Open0918.90096OpenAlexW1231707848MaRDI QIDQ1290137FDOQ1290137

Authors: Andreas T. Ernst, Mohan Krishnamoorthy

Publication date: 10 June 1999

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018994432663

Recommendations

A Heuristic for the Capacitated Single Allocation Hub Location Problem
The capacitated multiple allocation hub location problem: Formulations and algorithms
Solving a capacitated hub location problem
Capacitated single allocation hub location problem-A bi-criteria approach
The capacitated single-allocation hub location problem revisited: a note on a classical formulation
An improved algorithm for fixed-hub single allocation problems
Improved hardness and approximation results for single allocation hub location problems
New simple and efficient heuristics for the uncapacitated single allocation hub location problem
Lower bounding procedures for the single allocation hub location problem
A branch and cut algorithm for hub location problems with single assignment

zbMATH Keywords

simulated annealing heuristic branch and bound random descent capacitated single allocation hub location

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Discrete location and assignment (90B80)

Cited In (81)

Solving a new stochastic multi-mode \(p\)-hub covering location problem considering risk by a novel multi-objective algorithm
Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region
An intermodal hub location problem for container distribution in Indonesia
A fuzzy algorithm for continuous capacitated location allocation model with risk consideration
Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
Benders decomposition algorithms for two variants of the single allocation hub location problem
The p-hub centre routing problem with emissions budget: formulation and solution procedure
Alternate second order conic program reformulations for hub location under stochastic demand and congestion
Single Allocation Hub Location with Heterogeneous Economies of Scale
A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands
Multi-period hub set covering problems with flexible radius: a modified genetic solution
Machine learning augmented approaches for hub location problems
Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor
Multiple allocation hub location with service level constraints for two shipment classes
Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
The \(p\)-hub center allocation problem
Exact procedures for solving the discrete ordered median problem
A Heuristic for the Capacitated Single Allocation Hub Location Problem
Multi-product capacitated single-allocation hub location problems: formulations and inequalities
A parametric approach for a nonlinear discrete location problem
Allocating nodes to hubs for minimizing the hubs processing resources: A case study
HubLocator: An exact solution method for the multiple allocation hub location problem
Multiple allocation hub-and-spoke network design under hub congestion
New simple and efficient heuristics for the uncapacitated single allocation hub location problem
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
An efficient model for the multiple allocation hub maximal covering problem
Benders decomposition for the uncapacitated multiple allocation hub location problem
The tree of hubs location problem
Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion
Robust optimization approach to capacitated single and multiple allocation hub location problems
The capacitated facility location-allocation problem under uncertain environment
Preprocessing and cutting for multiple allocation hub location problems.
A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
An \(M/M/c\) queue model for hub covering location problem
Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods
A decomposition approach for single allocation hub location problems with multiple capacity levels
Endogenous effects of hubbing on flow intensities
Hub-and-spoke network design with congestion
Single-allocation ordered median hub location problems
An improved algorithm for fixed-hub single allocation problems
Hub location problems: the location of interacting facilities
General network design: a unified view of combined location and network design problems
Tight bounds from a path based formulation for the tree of hub location problem
A parallel adaptive memory algorithm for the capacitated modular hub location problem
A mixed-integer approach to Core-Edge design of storage area networks
Mathematical modeling for a \(p\)-mobile hub location problem in a dynamic environment by a genetic algorithm
The capacitated single-allocation hub location problem revisited: a note on a classical formulation
An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
Reliable single allocation hub location problem under hub breakdowns
Multi-period single-allocation hub location-routing: models and heuristic solutions
The capacitated directed cycle hub location and routing problem under congestion
The capacitated multi-facility location–allocation problem with probabilistic customer location and demand: two hybrid meta-heuristic algorithms
Efficient algorithms for the capacitated concentrator location problem
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
Stochastic single-allocation hub location
Modeling congestion and service time in hub location problems
Lagrangean relaxation for the capacitated hub location problem with single assignment
Location models for airline hubs behaving as \(M/D/c\) queues.
Stochastic hub location problems with Bernoulli demands
The capacitated multiple allocation hub location problem: Formulations and algorithms
Network hub location problems: The state of the art
Proprietor and customer costs in the incomplete hub location-routing network topology
A branch and cut algorithm for hub location problems with single assignment
A comparative study of different formulations for the capacitated discrete ordered median problem
On the Quadratic Programming Approach for Hub Location Problems
Formulating and solving splittable capacitated multiple allocation hub location problems
A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
Solving a capacitated hub location problem
Capacitated single allocation hub location problem-A bi-criteria approach
Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
Solution approaches to hub location problems
Logistics network based on an improved ant colony algorithm
Fuzzy facility location-allocation problem under the Hurwicz criterion
Solving the hub location problem with modular link capacities
Multi-period hub network design problems with modular capacities
Matheuristics for optimizing the network in German wagonload traffic
Perspectives on modeling hub location problems
Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
A fuzzy programming approach for dynamic virtual hub location problem
The hub location and pricing problem
A new formulation and branch-and-cut method for single-allocation hub location problems

This page was built for publication: Solution algorithms for the capacitated single allocation hub location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290137)