An efficient heuristic for a hub location routing problem

DOI10.1007/s11590-020-01675-zzbMath1483.90171OpenAlexW3107516874MaRDI QIDQ2070128

Abdessamad Ait El Cadi, Dragan Urošević, Mustapha Ratli, 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

zbMATH Keywords

heuristics\(p\)-hubgeneral variable neighborhood searchhub location-routing problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Multi-period single-allocation hub location-routing: models and heuristic solutions

Cites Work

• GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem
• Scatter search for an uncapacitated \(p\)-hub median problem
• Allocation strategies in hub networks
• 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
• Aggregation in hub location problems
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• Variable neighborhood search
• Heuristics for the capacitated modular hub location problem
• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
• Variable neighborhood search: basics and variants
• Less is more: general variable neighborhood search for the capacitated modular hub location problem
• A non-triangular hub location problem
• Network hub location problems: The state of the art
• An efficient GVNS for solving Traveling Salesman Problem with Time Windows
• Variable neighbourhood search for financial derivative problem
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• The uncapacitated r‐allocation p‐hub center problem

This page was built for publication: An efficient heuristic for a hub location routing problem