Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem

DOI10.1016/j.disopt.2021.100672OpenAlexW3212019837MaRDI QIDQ2691195

Stefan Mišković, Zorica Stanimirović, Olivera Stančić, Raca Todosijević

Publication date: 29 March 2023

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100672

zbMATH Keywords

variable neighborhood search\(r\)-allocationgreedy randomized adaptive search procedure\(p\)-hub covering problembinary and partial coverage

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Mathematical programming (90Cxx)

Uses Software

• GRASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
• Allocation strategies in hub networks
• A general VNS heuristic for the traveling salesman problem with time windows
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
• General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
• Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
• Design of stacked self-healing rings using a genetic algorithm
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• Tabu search and GRASP for the maximum diversity problem
• A hybrid multistart heuristic for the uncapacitated facility location problem
• An effective VNS for the capacitated \(p\)-median problem
• A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
• Variable neighbourhood search: methods and applications
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• Variable neighbourhood search: Methods and applications
• A quadratic integer program for the location of interacting hub facilities
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Integer programming formulations of discrete hub location problems
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• Variable neighborhood search
• A greedy genetic algorithm for the quadratic assignment problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
• Variable neighborhood search: basics and variants
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• Less is more: general variable neighborhood search for the capacitated modular hub location problem
• Network hub location problems: The state of the art
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
• GRASP with Path Relinking for Three-Index Assignment
• A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
• Release Time Scheduling and Hub Location for Next-Day Delivery
• Optimization by GRASP
• An annotated bibliography of GRASP-Part II: Applications
• A hub covering model for cargo delivery systems
• GRASP with path relinking for the weighted MAXSAT problem
• Model formulations for hub covering problems
• An annotated bibliography of GRASP – Part I: Algorithms
• Randomized heuristics for the Max-Cut problem
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Tabu search based heuristics for multi-floor facility layout
• An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Models and solution methods for the uncapacitated r‐allocation p‐hub equitable center problem
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy

This page was built for publication: Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem