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