An efficient heuristic for a hub location routing problem
DOI10.1007/S11590-020-01675-ZzbMATH Open1483.90171OpenAlexW3107516874MaRDI QIDQ2070128FDOQ2070128
Authors: Mustapha Ratli, Dragan Urošević, Abdessamad Ait El Cadi, Raca Todosijević, Jack Brimberg, Nenad Mladenović 
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01675-z
Recommendations
- Heuristics for the p-hub location problem
- A branch-and-cut algorithm for the hub location and routing problem
- The hub location and routing problem
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- A Location Based Heuristic for General Routing Problems
- scientific article; zbMATH DE number 4057268
- A class of heuristic algorithms for the routing problem
- Heuristics for the capacitated modular hub location problem
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Network hub location problems: The state of the art
- Allocation strategies in hub networks
- Variable neighborhood search
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
- Scatter search for an uncapacitated \(p\)-hub median problem
- The uncapacitated r‐allocation p‐hub center problem
- Aggregation in hub location 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 non-triangular hub location problem
- Heuristics for the capacitated modular hub location problem
- Variable neighborhood search: basics and variants
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
- An efficient GVNS for solving traveling salesman problem with time windows
- Less is more: general variable neighborhood search for the capacitated modular hub location problem
- Variable neighbourhood search for financial derivative problem
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
Cited In (11)
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- A tabu-search based heuristic for the hub covering problem over incomplete hub networks
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Routing and scheduling decisions in the hierarchical hub location problem
- Exact and heuristic approaches for the cycle hub location problem
- The hub location and routing problem
- Hub location problem in round-trip service applications
- Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem
This page was built for publication: An efficient heuristic for a hub location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070128)
