Less is more: general variable neighborhood search for the capacitated modular hub location problem
From MaRDI portal
Publication:2002852
DOI10.1016/j.cor.2019.05.020zbMath1458.90448OpenAlexW2946355926WikidataQ127828924 ScholiaQ127828924MaRDI QIDQ2002852
Marija Mikić, Dragan Urošević, Raca Todosijević
Publication date: 12 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.05.020
heuristichub location problemgeneral variable neighborhood searchbasic sequential variable neighborhood descent
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Planning and design of intermodal hub networks: a literature review, Skyport location problem for urban air mobility system, A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale, Variable neighborhood search for the single machine scheduling problem to minimize the total early work, Fat-tailed distributions for continuous variable neighborhood search, Machine learning augmented approaches for hub location problems, A parallel adaptive memory algorithm for the capacitated modular hub location problem, 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, An efficient heuristic for a hub location routing problem
Cites Work
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- The tree of hubs location problem
- A quadratic integer program for the location of interacting hub facilities
- Integer programming formulations of discrete hub location problems
- Variable neighborhood search
- An exact algorithm for the modular hub location problem with single assignments
- Heuristics for the capacitated modular hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- Variable neighborhood search: basics and variants
- Solving the hub location problem with modular link capacities
- Network hub location problems: The state of the art
- First vs. best improvement: an empirical study
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
