A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
From MaRDI portal
Publication:1677297
DOI10.1007/s11590-015-0867-6zbMath1381.90075OpenAlexW2020491042MaRDI QIDQ1677297
Nenad Mladenović, Raca Todosijević, Saïd Hanafi, Dragan Urošević
Publication date: 10 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0867-6
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items
Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality, Competitive multiple allocation hub location problem considering primary and backup routes, Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem, On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality, A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war, A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, The uncapacitated r‐allocation p‐hub center problem, A non-triangular hub location problem, Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation, 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, Variable neighborhood search: basics and variants, HUBBI: iterative network design for incomplete hub location problems, A multiobjective hub-airport location problem for an airline network design, A new distributionally robust \(p\)-hub median problem with uncertain carbon emissions and its tractable approximation method, 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, Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs, Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion, An efficient heuristic for a hub location routing problem
Uses Software
Cites Work
- Unnamed Item
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Two level general variable neighborhood search for attractive traveling salesman problem
- Allocation strategies in hub networks
- Location and allocation for distribution systems with transshipments and transportion economies of scale
- The \(p\)-median problem: a survey of metaheuristic approaches
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median 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
- Variable neighborhood search for minimum sum-of-squares clustering on networks
- A note on solving MINLP's using formulation space search
- Network hub location problems: The state of the art
- First vs. best improvement: an empirical study
- Variable neighborhood search for maximum diverse grouping problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
