A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
From MaRDI portal
Publication:976311
DOI10.1016/j.ejor.2010.02.022zbMath1188.90142OpenAlexW2074019423MaRDI QIDQ976311
Dragan Urošević, Jack Brimberg, Nenad Mladenović, Aleksandar Ilić
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.022
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Spatial analysis of single allocation hub location problems, Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem, The multi-vehicle profitable pickup and delivery problem, Robust optimization approach to capacitated single and multiple allocation hub location problems, 0-1 quadratic knapsack problem solved with VNS algorithm, Modelling and analysis of hub-and-spoke networks under stochastic demand and congestion, Nested general variable neighborhood search for the periodic maintenance problem, A compact linearisation of Euclidean single allocation hub location problems, Lower bounding procedures for the single allocation hub location problem, Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks, Combining intensification and diversification strategies in VNS. An application to the vertex separation problem, A genetic algorithm for the uncapacitated single allocation planar hub location problem, Heuristics for the capacitated modular hub location problem, Reliable single allocation hub location problem under hub breakdowns, Variable neighborhood search for location routing, Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem, Variable neighborhood search for metric dimension and minimal doubly resolving set problems, Variable neighbourhood structures for cycle location problems, Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, In memory of Professor Nenad Mladenović (1951--2022), The uncapacitated r‐allocation p‐hub center problem, A non-triangular hub location problem, Machine learning augmented approaches for hub location problems, Allocation strategies in hub networks, In-depth analysis of granular local search for capacitated vehicle routing, Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU, Variable neighborhood search for the travelling deliveryman 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, A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey, Variable neighborhood search: basics and variants, A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs, HUBBI: iterative network design for incomplete hub location problems, A multiobjective hub-airport location problem for an airline network design, Solving the maximum min-sum dispersion by alternating formulations of two different problems, 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, A fuzzy programming approach for dynamic virtual hub location problem, Less is more: general variable neighborhood search for the capacitated modular hub location problem, Benders decomposition algorithms for two variants of the single allocation hub location problem, A review of transport market modeling using game-theoretic principles, Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution, An efficient heuristic for a hub location routing problem
Uses Software
Cites Work
- Unnamed Item
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Two genetic algorithms 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
- On tabu search for the location of interacting hub facilities
- Variable neighborhood search
- Network hub location problems: The state of the art
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Variable Neighborhood Search
- A hybrid VNS–path relinking for the p-hub median problem
- Evolutionary Computation in Combinatorial Optimization
- Variable neighborhood search: Principles and applications
