New simple and efficient heuristics for the uncapacitated single allocation hub location problem
From MaRDI portal
Publication:833533
DOI10.1016/J.COR.2008.12.019zbMATH Open1177.90255OpenAlexW1978880380MaRDI QIDQ833533FDOQ833533
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
Recommendations
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Search theory (90B40) Discrete location and assignment (90B80)
Cites Work
- Mersenne twister
- Future paths for integer programming and links to artificial intelligence
- Tabu Search—Part I
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
- Integer programming formulations of discrete hub location problems
- A hybrid heuristic for the uncapacitated hub location problem
- Network hub location problems: The state of the art
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Solving the uncapacitated hub location problem using genetic algorithms
- A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Solution algorithms for the capacitated single allocation hub location problem
- On tabu search for the location of interacting hub facilities
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- Solution approaches to hub location problems
- Heuristics for the p-hub location problem
Cited In (29)
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
- Metaheuristic applications on discrete facility location problems: a survey
- Allocation strategies in hub networks
- Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU
- New formulations for the uncapacitated multiple allocation hub location problem
- Robust optimization approach to capacitated single and multiple allocation hub location problems
- Competitive multiple allocation hub location problem considering primary and backup routes
- A learning-based probabilistic tabu search for the uncapacitated single allocation hub location problem
- An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty
- Multi-period single-allocation hub location-routing: models and heuristic solutions
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem
- A Stackelberg hub arc location model for a competitive environment
- Solution algorithms for the capacitated single allocation hub location problem
- Constructive heuristics for the uncapacitated continuous location-allocation problem
- LTL logistics networks with differentiated services
- Multi-objective hub network design under uncertainty considering congestion: an M/M/c/K queue system
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A simulated annealing-based heuristic for the single allocation maximal covering hub location problem
- A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
- 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
- HUBBI: iterative network design for incomplete hub location problems
- A capacitated hub location problem in freight logistics multimodal networks
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- A fuzzy programming approach for dynamic virtual hub location problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
Uses Software
This page was built for publication: New simple and efficient heuristics for the uncapacitated single allocation hub location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833533)
