A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
From MaRDI portal
Publication:1683131
DOI10.1016/j.ejor.2017.03.066zbMath1375.90173OpenAlexW2599976886MaRDI QIDQ1683131
Marcos Roberto Silva, Claudio B. Cunha
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.03.066
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems, An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty, Hub location problem considering spoke links with incentive-dependent capacities, An efficient model for the multiple allocation hub maximal covering problem, A parallel adaptive memory algorithm for the capacitated modular hub location problem, The hub location problem with market selection, Hub interdiction problem variants: models and metaheuristic solution algorithms, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
Uses Software
Cites Work
- Exact and heuristic algorithms for the design of hub networks with multiple lines
- A branch-and-cut algorithm for the hub location and routing problem
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- New simple and efficient heuristics for the uncapacitated single allocation hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- A hybrid heuristic for the uncapacitated hub location problem
- Unmanned aerial vehicle hub-location and routing for monitoring geographic borders
- Network hub location problems: The state of the art
- A hub covering network design problem for cargo applications in Turkey
- Tabu Search—Part I
- Tabu Search—Part II
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- The single-assignment hub covering problem: Models and linearizations
