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

DOI10.1016/J.COR.2013.01.008MaRDI QIDQ336554zbMATH OpenOpenAlexFDO

Authors Ali Saboury, Nader Ghaffari-Nasab, 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)

Recommendations

• A hub location problem with fully interconnected backbone and access networks
• An efficient heuristic for a hub location routing problem
• A hybrid heuristic for the uncapacitated hub location problem
• Network hub location problems: The state of the art
• Heuristics for the p-hub location problem
• HUBBI: iterative network design for incomplete hub location problems
• On hub location problems in geographically flexible networks
• HubLocator: An exact solution method for the multiple allocation hub location problem
• scientific article; zbMATH DE number 3885614

Cites work

• A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
• A hub location problem with fully interconnected backbone and access networks
• A hybrid heuristic for the uncapacitated hub location problem
• A quadratic integer program for the location of interacting hub facilities
• A survey on Benders decomposition applied to fixed-charge network design problems
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• Equation of state calculations by fast computing machines
• Future paths for integer programming and links to artificial intelligence
• Generalized network design problems.
• Heuristics for the p-hub location problem
• Network hub location problems: The state of the art
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• Optimization by simulated annealing
• Solution approaches to hub location problems
• Solving the uncapacitated hub location problem using genetic algorithms
• The generalized fixed-charge network design problem
• Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
• Variable neighborhood search

Cited in

(8)

• Competitive multiple allocation hub location problem considering primary and backup routes
• A capacitated hub location problem in freight logistics multimodal networks
• A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
• Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
• Solving the Hub location problem in telecommunication network design: A local search approach
• A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
• Hub interdiction problem variants: models and metaheuristic solution algorithms
• A hub location problem with fully interconnected backbone and access networks

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

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