Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks

DOI10.1016/j.cor.2013.01.008zbMath1348.90416OpenAlexW2065452895MaRDI QIDQ336554

Nader Ghaffari-Nasab, Ali Saboury, Farnaz Barzinpour, Mohamad Saeed Jabalameli

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.008

zbMATH Keywords

simulated annealingtabu searchvariable neighborhood searchhub locationhierarchical networkshybrid heuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (4)

A capacitated hub location problem in freight logistics multimodal networks ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Hub interdiction problem variants: models and metaheuristic solution algorithms ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion

Cites Work

• Optimization by Simulated Annealing
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Solving the uncapacitated hub location problem using genetic algorithms
• Heuristics for the p-hub location problem
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• The generalized fixed-charge network design problem
• A hub location problem with fully interconnected backbone and access networks
• 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
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Variable neighborhood search
• Solution approaches to hub location problems
• A hybrid heuristic for the uncapacitated hub location problem
• A survey on Benders decomposition applied to fixed-charge network design problems
• Generalized network design problems.
• Future paths for integer programming and links to artificial intelligence
• Network hub location problems: The state of the art
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Equation of State Calculations by Fast Computing Machines
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

This page was built for publication: Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks