General variable neighborhood search for the uncapacitated single allocation p-hub center problem

DOI10.1007/S11590-016-1004-XzbMATH Open1369.90072OpenAlexW2469651670MaRDI QIDQ526421FDOQ526421

Authors: Jack Brimberg, Nenad Mladenović, Raca Todosijević, Dragan Urošević 

Publication date: 12 May 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-016-1004-x

Recommendations

• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem

zbMATH Keywords

variable neighborhood search\(p\)-hubsingle allocationhub centernested variable neighborhood descent

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Integer programming formulations of discrete hub location problems
• Network hub location problems: The state of the art
• Title not available (Why is that?)
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• 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
• Developments of variable neighborhood search
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• On the single-assignment \(p\)-hub center problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Aggregation in hub location problems
• Optimal design of a distributed network with a two-level hierarchical structure
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem

Cited In (21)

• Location of facility based on simulated annealing and ``ZKW algorithms
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• The p-hub centre routing problem with emissions budget: formulation and solution procedure
• A GVNS algorithm applied to the single allocation hub location problem with heterogeneous economies of scale
• A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities
• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A non-triangular hub location problem
• Improved hardness and approximation results for single allocation hub location
• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
• A multiobjective hub-airport location problem for an airline network design
• Heuristic algorithms for the bi-objective hierarchical multimodal hub location problem in cargo delivery systems
• Improved hardness and approximation results for single allocation hub location problems
• The uncapacitated r‐allocation p‐hub center problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
• Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems
• A supply chain network design for blood and its products using genetic algorithm: a case study of Turkey
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• An efficient heuristic for a hub location routing problem
• A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem

This page was built for publication: General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526421)