Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
From MaRDI portal
Publication:879279
DOI10.1016/j.ejor.2006.06.056zbMath1128.90038OpenAlexW1968911485MaRDI QIDQ879279
Jozef Kratica, Zorica Stanimirović, Vladimir Filipović, Dušan Tošić
Publication date: 11 May 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.056
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Spatial analysis of single allocation hub location problems ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion ⋮ Computing the metric dimension of graphs by genetic algorithms ⋮ A compact linearisation of Euclidean single allocation hub location problems ⋮ GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem ⋮ A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem ⋮ A genetic algorithm for the uncapacitated single allocation planar hub location problem ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem ⋮ Skyport location problem for urban air mobility system ⋮ Machine learning augmented approaches for hub location problems ⋮ Allocation strategies in hub networks ⋮ The capacitated \(p\)-hub median problem with integral constraints: an application to a Chinese air cargo network ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method ⋮ Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry ⋮ Hub location-allocation in intermodal logistic networks ⋮ The freight consolidation and containerization problem ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem ⋮ Computing minimal doubly resolving sets of graphs ⋮ An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ A competitive hub location and pricing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Solving the uncapacitated hub location problem using genetic algorithms
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Location of hubs in a competitive environment
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- On cost allocation in hub-like networks
- Network cost minimization using threshold-based discounting
- Genetic algorithm for network cost minimization using threshold based discounting
- Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem
- Threshold based discounting networks: the cost allocation provided by the nucleolus
- Obtaining test problems via Internet
- Hub Arc Location Problems: Part I—Introduction and Results
- Hub Arc Location Problems: Part II—Formulations and Optimal Algorithms
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Neural versus traditional approaches to the location of interacting hub facilities
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Evolutionary Computation in Combinatorial Optimization
