General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
From MaRDI portal
Publication:526421
DOI10.1007/s11590-016-1004-xzbMath1369.90072OpenAlexW2469651670MaRDI QIDQ526421
Jack Brimberg, Dragan Urošević, Nenad Mladenović, Raca Todosijević
Publication date: 12 May 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-016-1004-x
variable neighborhood search\(p\)-hubsingle allocationhub centernested variable neighborhood descent
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality, Improved hardness and approximation results for single allocation hub location problems, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, A non-triangular hub location problem, The p-hub centre routing problem with emissions budget: formulation and solution procedure, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities, A multiobjective hub-airport location problem for an airline network design, Location of facility based on simulated annealing and ``ZKW algorithms, Improved hardness and approximation results for single allocation hub location, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems, An efficient heuristic for a hub location routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- Aggregation in hub location problems
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Variable neighbourhood search: methods and applications
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Optimal design of a distributed network with a two-level hierarchical structure
- Integer programming formulations of discrete hub location problems
- Variable neighborhood search
- On the single-assignment \(p\)-hub center problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Network hub location problems: The state of the art
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
