New simple and efficient heuristics for the uncapacitated single allocation hub location problem
From MaRDI portal
Publication:833533
DOI10.1016/j.cor.2008.12.019zbMath1177.90255OpenAlexW1978880380MaRDI QIDQ833533
Marcos Roberto Silva, Claudio B. Cunha
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.12.019
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items (22)
Robust optimization approach to capacitated single and multiple allocation hub location problems ⋮ A capacitated hub location problem in freight logistics multimodal networks ⋮ Competitive multiple allocation hub location problem considering primary and backup routes ⋮ Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks ⋮ A Stackelberg hub arc location model for a competitive environment ⋮ A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem ⋮ Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems ⋮ An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty ⋮ A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem ⋮ A multi-start local search heuristic for the multi-period auto-carrier loading and transportation problem in Brazil ⋮ Machine learning augmented approaches for hub location problems ⋮ Allocation strategies in hub networks ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ A multi-objective, hub-and-spoke model to design and manage biofuel supply chains ⋮ A fuzzy programming approach for dynamic virtual hub location problem ⋮ LTL logistics networks with differentiated services ⋮ Benders decomposition algorithms for two variants of the single allocation hub location problem ⋮ Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution ⋮ Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system ⋮ Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion ⋮ Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Solving the uncapacitated hub location problem using genetic algorithms
- Heuristics for the p-hub location problem
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Solution algorithms for the capacitated single allocation hub location problem
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- On tabu search for the location of interacting hub facilities
- Solution approaches to hub location problems
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- A hybrid heuristic for the uncapacitated hub location problem
- Future paths for integer programming and links to artificial intelligence
- Network hub location problems: The state of the art
- Tabu Search—Part I
- Mersenne twister
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Unnamed Item
- Unnamed Item
This page was built for publication: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
