Allocation strategies in hub networks
From MaRDI portal
Publication:418055
DOI10.1016/j.ejor.2011.01.014zbMath1237.90137OpenAlexW2141570108MaRDI QIDQ418055
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/12266
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (30)
Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing ⋮ Multimodal freight transportation planning: a literature review ⋮ Benders decomposition applied to profit maximizing hub location problem with incomplete hub network ⋮ GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem ⋮ A branch-and-cut algorithm for the hub location and routing problem ⋮ Scatter search for an uncapacitated \(p\)-hub median problem ⋮ A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem ⋮ Heuristics for the capacitated modular hub location problem ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Hub location problem considering spoke links with incentive-dependent capacities ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ A non-triangular hub location problem ⋮ Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network ⋮ A new formulation and branch-and-cut method for single-allocation hub location problems ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Proprietor and customer costs in the incomplete hub location-routing network topology ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ LTL logistics networks with differentiated services ⋮ Unmanned aerial vehicle hub-location and routing for monitoring geographic borders ⋮ Facility location with tree topology and radial distance constraints ⋮ Perspectives on modeling hub location problems ⋮ Modeling congestion and service time in hub location problems ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ An efficient heuristic for a hub location routing problem ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem
Cites Work
- Unnamed Item
- Unnamed Item
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Adapting polyhedral properties from facility to hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- Heuristics for the p-hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- New formulations for the uncapacitated multiple allocation hub location problem
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- Hub location for time definite transportation
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- An exact solution procedure for a cluster hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- A linear program for the two-hub location problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Efficient solution procedure and reduced size formulations for \(p\)-hub location problems
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Solution approaches to hub location problems
- Preprocessing and cutting for multiple allocation hub location problems.
- On the single-assignment \(p\)-hub center problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Network cost minimization using threshold-based discounting
- A hybrid heuristic for the uncapacitated hub location problem
- Star \(p\)-hub median problem with modular arc capacities
- Network hub location problems: The state of the art
- An Efficient Procedure for Designing Single Allocation Hub and Spoke Systems
- The Latest Arrival Hub Location Problem
- A Note on “The Latest Arrival Hub Location Problem”
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- Projecting the flow variables for hub location problems
- The hub location and network design problem with fixed and variable arc costs: formulation and dual-based solution heuristic
- Hub network design with single and multiple allocation: A computational study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Lower Bounds for the Hub Location Problem
- Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
- Solving the hub location problem in a star–star network
- Dual-based approach for a hub network design problem under non-restrictive policy
- HubLocator: An exact solution method for the multiple allocation hub location problem
This page was built for publication: Allocation strategies in hub networks
