A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
From MaRDI portal
Publication:526415
DOI10.1007/s11590-015-0973-5zbMath1369.90093OpenAlexW2269669929MaRDI QIDQ526415
Raca Todosijević, Jack Brimberg, Nenad Mladenović, Dragan Urošević
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-015-0973-5
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (11)
A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem ⋮ The uncapacitated r‐allocation p‐hub center problem ⋮ A non-triangular hub location problem ⋮ 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 ⋮ Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations ⋮ A multiobjective hub-airport location problem for an airline network design ⋮ General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem ⋮ Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm ⋮ A parallel variable neighborhood search for solving covering salesman problem ⋮ An efficient heuristic for a hub location routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Attraction probabilities in variable neighborhood search
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Variable neighbourhood search: Methods and applications
- Optimal design of a distributed network with a two-level hierarchical structure
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Variable neighborhood search
- 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
This page was built for publication: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
