A hybrid heuristic for the uncapacitated hub location problem
From MaRDI portal
Publication:1609911
DOI10.1016/S0377-2217(97)00286-5zbMath0991.90081MaRDI QIDQ1609911
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (22)
New simple and efficient heuristics for the uncapacitated single allocation hub location problem ⋮ Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ The \(p\)-hub center allocation problem ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem ⋮ The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques ⋮ A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil ⋮ Scalable Vertiport Hub Location Selection for Air Taxi Operations in a Metropolitan Region ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ On hub location problems in geographically flexible networks ⋮ Allocation strategies in hub networks ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ Managing facility disruption in hub-and-spoke networks: formulations and efficient solution methods ⋮ Network hub location problems: The state of the art ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Solving the uncapacitated hub location problem using genetic algorithms ⋮ A Benders decomposition approach for a distribution network design problem with consolidation and capacity considerations ⋮ HubLocator: An exact solution method for the multiple allocation hub location problem ⋮ Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor ⋮ SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- Heuristics for the p-hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- On tabu search for the location of interacting hub facilities
- Genetic algorithms and tabu search: Hybrids for optimization
- Solution approaches to hub location problems
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- A dual algorithm for the uncapacitated hub location problem
- Hub Location and the p-Hub Median Problem
This page was built for publication: A hybrid heuristic for the uncapacitated hub location problem
