A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
From MaRDI portal
Publication:6047905
DOI10.1016/j.cor.2023.106350OpenAlexW4384283448MaRDI QIDQ6047905
Nayane Carvalho Freitas, Elisangela Martins de Sá, Sérgio Ricardo de Souza
Publication date: 13 September 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106350
Cites Work
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- 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
- Partitioning procedures for solving mixed-variables programming problems
- Variable neighborhood search
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- Variable neighborhood search: basics and variants
- HUBBI: iterative network design for incomplete hub location problems
- Enumeration and search procedures for a hub location problem with economies of scale
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
- Benders Decomposition for Large-Scale Uncapacitated Hub Location
- The Latest Arrival Hub Location Problem
- Solving Real-World Linear Programs: A Decade and More of Progress
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Single Allocation Hub Location with Heterogeneous Economies of Scale