Solving the uncapacitated hub location problem using genetic algorithms
From MaRDI portal
Publication:707014
DOI10.1016/J.COR.2003.09.008zbMATH Open1071.90025OpenAlexW2116660011MaRDI QIDQ707014FDOQ707014
Publication date: 9 February 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.008
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A quadratic integer program for the location of interacting hub facilities
- Tight linear programming relaxations of uncapacitated \(p\)-hub median problems
- Integer programming formulations of discrete hub location problems
- A hybrid heuristic for the uncapacitated hub location problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Hub Location and the p-Hub Median Problem
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Solving large single allocation \(p\)-hub problems with two or three hubs
- Heuristics for the p-hub location problem
- Lower Bounds for the Hub Location Problem
- Neural versus traditional approaches to the location of interacting hub facilities
Cited In (25)
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Metaheuristic applications on discrete facility location problems: a survey
- Allocation strategies in hub networks
- Hub location-allocation in intermodal logistic networks
- 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 simple and efficient heuristics for the uncapacitated single allocation hub location problem
- An efficient solution method for Weber problems with barriers based on genetic algorithms
- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- Competitive multiple allocation hub location problem considering primary and backup routes
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- 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
- A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
- An efficient genetic algorithm for the Uncapacitated r-allocation p-hub maximal covering problem
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
- Skyport location problem for urban air mobility system
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- On hub location problems in geographically flexible networks
- Title not available (Why is that?)
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
Uses Software
This page was built for publication: Solving the uncapacitated hub location problem using genetic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707014)
