Allocation strategies in hub networks
From MaRDI portal
Publication:418055
DOI10.1016/J.EJOR.2011.01.014zbMATH Open1237.90137OpenAlexW2141570108MaRDI QIDQ418055FDOQ418055
Authors: Hande Yaman 
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
Recommendations
- On cost allocation in hub-like networks
- Hub network design with single and multiple allocation: A computational study
- Multiple allocation hub-and-spoke network design under hub congestion
- Allocation in networks. With a foreword by Hervé Moulin
- A cost allocation problem arising in hub-spoke network systems
- Allocation rules on networks
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- A distributed approach to capacity allocation in logical networks
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- 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
- Preprocessing and cutting for multiple allocation hub location problems.
- A hybrid heuristic for the uncapacitated hub location problem
- Network hub location problems: The state of the art
- Title not available (Why is that?)
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- 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
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- Adapting polyhedral properties from facility to hub location problems
- Solving the uncapacitated hub location problem using genetic algorithms
- 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
- 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
- Benders decomposition for the uncapacitated multiple allocation hub location problem
- On tabu search for the location of interacting hub facilities
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Hub location problems in urban traffic networks
- An efficient procedure for designing single allocation hub and spoke systems
- Hub arc location problems: 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
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median 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
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- The latest arrival hub location problem
- Solution approaches to hub location problems
- Network cost minimization using threshold-based discounting
- Star \(p\)-hub median problem with modular arc capacities
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- Lower Bounds for the Hub Location Problem
- A linear program for the two-hub location problem
- A Note on “The Latest Arrival Hub Location Problem”
- Neural versus traditional approaches to the location of interacting hub facilities
- Dual-based approach for a hub network design problem under non-restrictive policy
- An exact solution procedure for a cluster hub location problem
Cited In (43)
- Multiple allocation tree of hubs location problem for non-complete networks
- Facility location with tree topology and radial distance constraints
- A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method
- The 2-allocation \(p\)-hub median problem and a modified Benders decomposition method for solving hub location problems
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- Multiple allocation hub-and-spoke network design under hub congestion
- The single allocation problem in the interacting three-hub network
- Multimodal freight transportation planning: a literature review
- Hub and spoke network design with single-assignment, capacity decisions and balancing requirements
- An improved algorithm for fixed-hub single allocation problems
- Scalable vertiport hub location selection for air taxi operations in a metropolitan region
- On cost allocation in hub-like networks
- Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
- A non-triangular hub location problem
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- Heuristics for the capacitated modular hub location problem
- The minimum number of hubs in networks
- A branch-and-cut algorithm for the hub location and routing problem
- LTL logistics networks with differentiated services
- Modeling congestion and service time in hub location problems
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- Proprietor and customer costs in the incomplete hub location-routing network topology
- Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Hub location problem considering spoke links with incentive-dependent capacities
- The uncapacitated r‐allocation p‐hub center problem
- Solving the continuous multiple allocation \(p\)-hub median problem by the hyperbolic smoothing approach
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Algorithm for single allocation problem on hub-and-spoke networks in 2-dimensional plane
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- Joint tank container demurrage policy and flow optimisation using a progressive hedging algorithm with expanded time-space network
- Unmanned aerial vehicle hub-location and routing for monitoring geographic borders
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Perspectives on modeling hub location problems
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- How to Allocate Network Centers
- An efficient heuristic for a hub location routing problem
- A new formulation and branch-and-cut method for single-allocation hub location problems
This page was built for publication: Allocation strategies in hub networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418055)
