Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems

DOI10.1007/s10479-017-2508-1zbMath1380.90236OpenAlexW2612915199MaRDI QIDQ1698283

Olivera Janković, Raca Todosijević, Stefan Mišković, Zorica Stanimirović

Publication date: 15 February 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2508-1

zbMATH Keywords

mixed integer programmingvariable neighborhood search\(p\)-hub maximal covering problembinary and partial coverage

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ The hub location problem with market selection ⋮ An efficient heuristic for a hub location routing problem

Cites Work

• Unnamed Item
• A two phase variable neighborhood search for the multi-product inventory routing problem
• Two level general variable neighborhood search for attractive traveling salesman problem
• New heuristic algorithms for solving the planar \(p\)-median problem
• Allocation strategies in hub networks
• A variable neighborhood search based matheuristic for nurse rostering problems
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
• 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
• A quadratic integer program for the location of interacting hub facilities
• A Lagrangean heuristic for the maximal covering location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Variable neighborhood search
• The gradual covering decay location problem on a network.
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Variable neighborhood search: basics and variants
• A maximal covering location model in the presence of partial coverage
• Obtaining test problems via Internet
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• Network hub location problems: The state of the art
• A hub covering network design problem for cargo applications in Turkey
• Model formulations for hub covering problems
• The single-assignment hub covering problem: Models and linearizations
• The generalized maximal covering location problem
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem

This page was built for publication: Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems