Solving the uncapacitated hub location problem using genetic algorithms
From MaRDI portal
Recommendations
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
- A genetic algorithm for the uncapacitated single allocation planar hub location problem
Cites work
- A hybrid heuristic for the uncapacitated hub location problem
- A quadratic integer program for the location of interacting hub facilities
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Heuristics for the p-hub location problem
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- Hub Location and the p-Hub Median Problem
- Integer programming formulations of discrete hub location problems
- Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem
- Lower Bounds for the Hub Location Problem
- Neural versus traditional approaches to the location of interacting hub facilities
- Solving large single allocation p-hub problems with two or three hubs
- Tight linear programming relaxations of uncapacitated p-hub median problems
Cited in
(33)- A genetic algorithm based approach for the uncapacitated continuous location-allocation problem
- A hybrid heuristic for the uncapacitated hub location problem
- 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 biased random-key genetic algorithm for the tree of hubs location problem
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- Developing an integrated hub location and revenue management model considering multi-classes of customers in the airline industry
- Benders decomposition algorithms for two variants of the single allocation hub location problem
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Competitive multiple allocation hub location problem considering primary and backup routes
- A combined average-case and worst-case analysis for an integrated hub location and revenue management problem
- A competitive hub location and pricing problem
- Network hub location problems: The state of the art
- Metaheuristic applications on discrete facility location problems: a survey
- Skyport location problem for urban air mobility system
- scientific article; zbMATH DE number 6006811 (Why is no real title available?)
- 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
- The impact of hub failure in hub-and-spoke networks: mathematical formulations and solution techniques
- SOLVING THE UNCAPACITATED MULTIPLE ALLOCATION p-HUB CENTER PROBLEM BY GENETIC ALGORITHM
- Genetic algorithm for solving uncapacitated multiple allocation hub location problem
- Allocation strategies in hub networks
- An efficient genetic algorithm for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem
- Solving the uncapacitated single allocation p-hub Median problem on GPU
- Hub location-allocation in intermodal logistic networks
- An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem
- On hub location problems in geographically flexible networks
- Developing an integrated model of hierarchical hub location and inventory control for perishable products in urban and rural areas: a case study in food supply chain
- 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 for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil
- Two genetic algorithms for solving the uncapacitated single allocation \(p\)-hub median problem
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)
